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_spec3_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:21:05,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:21:05,371 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:21:05,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:21:05,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:21:05,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:21:05,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:21:05,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:21:05,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:21:05,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:21:05,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:21:05,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:21:05,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:21:05,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:21:05,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:21:05,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:21:05,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:21:05,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:21:05,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:21:05,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:21:05,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:21:05,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:21:05,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:21:05,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:21:05,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:21:05,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:21:05,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:21:05,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:21:05,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:21:05,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:21:05,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:21:05,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:21:05,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:21:05,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:21:05,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:21:05,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:21:05,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:21:05,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:21:05,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:21:05,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:21:05,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:21:05,417 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:21:05,432 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:21:05,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:21:05,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:21:05,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:21:05,434 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:21:05,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:21:05,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:21:05,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:21:05,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:21:05,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:21:05,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:21:05,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:21:05,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:21:05,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:21:05,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:21:05,436 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:21:05,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:21:05,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:21:05,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:21:05,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:21:05,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:21:05,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:21:05,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:21:05,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:21:05,438 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:21:05,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:21:05,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:21:05,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:21:05,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:21:05,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:21:05,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:21:05,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:21:05,483 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:21:05,484 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:21:05,484 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product30.cil.c [2019-10-02 13:21:05,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe38dbdd/cd805751ae264dd5896d0642fac56c34/FLAG84df68b51 [2019-10-02 13:21:06,174 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:21:06,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product30.cil.c [2019-10-02 13:21:06,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe38dbdd/cd805751ae264dd5896d0642fac56c34/FLAG84df68b51 [2019-10-02 13:21:06,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe38dbdd/cd805751ae264dd5896d0642fac56c34 [2019-10-02 13:21:06,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:21:06,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:21:06,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:21:06,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:21:06,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:21:06,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:21:06" (1/1) ... [2019-10-02 13:21:06,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fab2174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:06, skipping insertion in model container [2019-10-02 13:21:06,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:21:06" (1/1) ... [2019-10-02 13:21:06,417 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:21:06,504 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:21:07,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:21:07,277 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:21:07,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:21:07,503 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:21:07,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07 WrapperNode [2019-10-02 13:21:07,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:21:07,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:21:07,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:21:07,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:21:07,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,643 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (1/1) ... [2019-10-02 13:21:07,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:21:07,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:21:07,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:21:07,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:21:07,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (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 13:21:07,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:21:07,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:21:07,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:21:07,756 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:21:07,757 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 13:21:07,758 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:21:07,758 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:21:07,758 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:21:07,759 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:21:07,759 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:21:07,759 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:21:07,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:21:07,761 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:21:07,761 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:21:07,762 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:21:07,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:21:07,765 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:21:07,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:21:07,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:21:07,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:21:07,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:21:07,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:21:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:21:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:21:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:21:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:21:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:21:07,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:21:07,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:21:07,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:21:07,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:21:07,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:21:07,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:21:07,770 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:21:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:21:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:21:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:21:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:21:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:21:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:21:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:21:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:21:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:21:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:21:07,773 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:21:07,773 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:21:07,773 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:21:07,773 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:21:07,773 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:21:07,774 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:21:07,774 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:21:07,774 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:21:07,774 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:21:07,774 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:21:07,775 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:21:07,775 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:21:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:21:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:21:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:21:07,776 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:21:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:21:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:21:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:21:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:21:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:21:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:21:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:21:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:21:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:21:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:21:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:21:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:21:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:21:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:21:07,780 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:21:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:21:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:21:07,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:21:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:21:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:21:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:21:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:21:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:21:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:21:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:21:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:21:07,783 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:21:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:21:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:21:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:21:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:21:07,784 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:21:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:21:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:21:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:21:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:21:07,785 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:21:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:21:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:21:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:21:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:21:07,786 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:21:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:21:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:21:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:21:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:21:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:21:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:21:07,789 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:21:07,789 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:21:07,789 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:21:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:21:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:21:07,790 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:21:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:21:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:21:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:21:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:21:07,791 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:21:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:21:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:21:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:21:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:21:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 13:21:07,792 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:21:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:21:07,793 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:21:07,794 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:21:07,796 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:21:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:21:07,797 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:21:07,798 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:21:07,804 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:21:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:21:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:21:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:21:07,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:21:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:21:07,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:21:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:21:07,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:21:07,809 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:21:07,810 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:21:07,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:21:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:21:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:21:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:21:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:21:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:21:07,812 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:21:07,813 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:21:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:21:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:21:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:21:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:21:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:21:07,814 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:21:07,815 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:21:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:21:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:21:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:21:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:21:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:21:07,816 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:21:07,817 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:21:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:21:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:21:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:21:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:21:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:21:07,818 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:21:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:21:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:21:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:21:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:21:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:21:07,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:21:10,077 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:21:10,077 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:21:10,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:21:10 BoogieIcfgContainer [2019-10-02 13:21:10,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:21:10,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:21:10,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:21:10,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:21:10,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:21:06" (1/3) ... [2019-10-02 13:21:10,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efc5dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:21:10, skipping insertion in model container [2019-10-02 13:21:10,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:21:07" (2/3) ... [2019-10-02 13:21:10,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efc5dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:21:10, skipping insertion in model container [2019-10-02 13:21:10,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:21:10" (3/3) ... [2019-10-02 13:21:10,088 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product30.cil.c [2019-10-02 13:21:10,098 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:21:10,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:21:10,124 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:21:10,161 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:21:10,162 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:21:10,162 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:21:10,163 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:21:10,167 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:21:10,167 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:21:10,167 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:21:10,167 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:21:10,168 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:21:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states. [2019-10-02 13:21:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 13:21:10,244 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:10,246 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:21:10,251 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:10,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:10,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1721519425, now seen corresponding path program 1 times [2019-10-02 13:21:10,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:10,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:10,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:10,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:10,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:10,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:21:10,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:21:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:21:10,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:21:10,988 INFO L87 Difference]: Start difference. First operand 556 states. Second operand 2 states. [2019-10-02 13:21:11,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:11,061 INFO L93 Difference]: Finished difference Result 798 states and 1059 transitions. [2019-10-02 13:21:11,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:21:11,063 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-10-02 13:21:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:11,091 INFO L225 Difference]: With dead ends: 798 [2019-10-02 13:21:11,091 INFO L226 Difference]: Without dead ends: 505 [2019-10-02 13:21:11,105 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 13:21:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-10-02 13:21:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2019-10-02 13:21:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-10-02 13:21:11,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 671 transitions. [2019-10-02 13:21:11,207 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 671 transitions. Word has length 195 [2019-10-02 13:21:11,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:11,209 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 671 transitions. [2019-10-02 13:21:11,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:21:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 671 transitions. [2019-10-02 13:21:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:21:11,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:11,215 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:21:11,216 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1479265370, now seen corresponding path program 1 times [2019-10-02 13:21:11,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:11,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:11,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:11,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:11,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:11,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:11,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:11,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:11,488 INFO L87 Difference]: Start difference. First operand 505 states and 671 transitions. Second operand 3 states. [2019-10-02 13:21:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:11,578 INFO L93 Difference]: Finished difference Result 781 states and 1022 transitions. [2019-10-02 13:21:11,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:11,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:21:11,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:11,590 INFO L225 Difference]: With dead ends: 781 [2019-10-02 13:21:11,590 INFO L226 Difference]: Without dead ends: 508 [2019-10-02 13:21:11,595 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 13:21:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-10-02 13:21:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 507. [2019-10-02 13:21:11,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-10-02 13:21:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 673 transitions. [2019-10-02 13:21:11,686 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 673 transitions. Word has length 196 [2019-10-02 13:21:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:11,687 INFO L475 AbstractCegarLoop]: Abstraction has 507 states and 673 transitions. [2019-10-02 13:21:11,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 673 transitions. [2019-10-02 13:21:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:21:11,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:11,692 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:21:11,692 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash 789958250, now seen corresponding path program 1 times [2019-10-02 13:21:11,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:11,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:11,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:11,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:11,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:11,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:11,899 INFO L87 Difference]: Start difference. First operand 507 states and 673 transitions. Second operand 3 states. [2019-10-02 13:21:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:11,949 INFO L93 Difference]: Finished difference Result 990 states and 1344 transitions. [2019-10-02 13:21:11,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:11,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-02 13:21:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:11,958 INFO L225 Difference]: With dead ends: 990 [2019-10-02 13:21:11,958 INFO L226 Difference]: Without dead ends: 548 [2019-10-02 13:21:11,960 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 13:21:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-02 13:21:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 547. [2019-10-02 13:21:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-10-02 13:21:12,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 742 transitions. [2019-10-02 13:21:12,007 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 742 transitions. Word has length 206 [2019-10-02 13:21:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:12,009 INFO L475 AbstractCegarLoop]: Abstraction has 547 states and 742 transitions. [2019-10-02 13:21:12,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:12,009 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 742 transitions. [2019-10-02 13:21:12,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:21:12,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:12,019 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:12,019 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:12,020 INFO L82 PathProgramCache]: Analyzing trace with hash 688583183, now seen corresponding path program 1 times [2019-10-02 13:21:12,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:12,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:12,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:12,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:12,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:12,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:12,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:12,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:12,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:12,292 INFO L87 Difference]: Start difference. First operand 547 states and 742 transitions. Second operand 3 states. [2019-10-02 13:21:12,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:12,335 INFO L93 Difference]: Finished difference Result 1107 states and 1546 transitions. [2019-10-02 13:21:12,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:12,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-10-02 13:21:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:12,343 INFO L225 Difference]: With dead ends: 1107 [2019-10-02 13:21:12,343 INFO L226 Difference]: Without dead ends: 625 [2019-10-02 13:21:12,346 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 13:21:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-02 13:21:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 624. [2019-10-02 13:21:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 13:21:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 874 transitions. [2019-10-02 13:21:12,383 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 874 transitions. Word has length 207 [2019-10-02 13:21:12,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:12,384 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 874 transitions. [2019-10-02 13:21:12,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 874 transitions. [2019-10-02 13:21:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:21:12,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:12,390 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:12,390 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1758410390, now seen corresponding path program 1 times [2019-10-02 13:21:12,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:12,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:12,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:12,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:12,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:12,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:12,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:12,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:12,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:12,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:12,637 INFO L87 Difference]: Start difference. First operand 624 states and 874 transitions. Second operand 3 states. [2019-10-02 13:21:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:12,671 INFO L93 Difference]: Finished difference Result 1332 states and 1932 transitions. [2019-10-02 13:21:12,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:12,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-02 13:21:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:12,677 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 13:21:12,677 INFO L226 Difference]: Without dead ends: 773 [2019-10-02 13:21:12,679 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 13:21:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-02 13:21:12,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 772. [2019-10-02 13:21:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-10-02 13:21:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1126 transitions. [2019-10-02 13:21:12,711 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1126 transitions. Word has length 208 [2019-10-02 13:21:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:12,712 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 1126 transitions. [2019-10-02 13:21:12,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:12,712 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1126 transitions. [2019-10-02 13:21:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:21:12,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:12,718 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:21:12,718 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1379207951, now seen corresponding path program 1 times [2019-10-02 13:21:12,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:12,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:12,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:12,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:12,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:12,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:21:12,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:21:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:21:12,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:21:12,879 INFO L87 Difference]: Start difference. First operand 772 states and 1126 transitions. Second operand 3 states. [2019-10-02 13:21:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:12,931 INFO L93 Difference]: Finished difference Result 1764 states and 2668 transitions. [2019-10-02 13:21:12,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:21:12,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-02 13:21:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:12,939 INFO L225 Difference]: With dead ends: 1764 [2019-10-02 13:21:12,939 INFO L226 Difference]: Without dead ends: 1057 [2019-10-02 13:21:12,942 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 13:21:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-10-02 13:21:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1056. [2019-10-02 13:21:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1056 states. [2019-10-02 13:21:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1606 transitions. [2019-10-02 13:21:13,033 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1606 transitions. Word has length 209 [2019-10-02 13:21:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:13,034 INFO L475 AbstractCegarLoop]: Abstraction has 1056 states and 1606 transitions. [2019-10-02 13:21:13,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:21:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1606 transitions. [2019-10-02 13:21:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:21:13,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:13,041 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:13,042 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:13,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1500956376, now seen corresponding path program 1 times [2019-10-02 13:21:13,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:13,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:13,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:13,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:13,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:21:13,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:13,487 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 13:21:13,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:14,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 2955 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:21:14,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:21:14,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:14,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:21:14,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:21:14,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:21:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:21:14,576 INFO L87 Difference]: Start difference. First operand 1056 states and 1606 transitions. Second operand 26 states. [2019-10-02 13:21:24,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:24,579 INFO L93 Difference]: Finished difference Result 3699 states and 5645 transitions. [2019-10-02 13:21:24,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:21:24,580 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-10-02 13:21:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:24,605 INFO L225 Difference]: With dead ends: 3699 [2019-10-02 13:21:24,606 INFO L226 Difference]: Without dead ends: 2679 [2019-10-02 13:21:24,616 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:21:24,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2019-10-02 13:21:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2639. [2019-10-02 13:21:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-10-02 13:21:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4003 transitions. [2019-10-02 13:21:24,821 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4003 transitions. Word has length 212 [2019-10-02 13:21:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:24,821 INFO L475 AbstractCegarLoop]: Abstraction has 2639 states and 4003 transitions. [2019-10-02 13:21:24,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:21:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4003 transitions. [2019-10-02 13:21:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:21:24,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:24,836 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 13:21:24,837 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1538912746, now seen corresponding path program 1 times [2019-10-02 13:21:24,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:21:25,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:25,169 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 13:21:25,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:25,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:21:25,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:21:26,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 13:21:26,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:21:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:21:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:21:26,088 INFO L87 Difference]: Start difference. First operand 2639 states and 4003 transitions. Second operand 16 states. [2019-10-02 13:21:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:28,592 INFO L93 Difference]: Finished difference Result 5305 states and 8110 transitions. [2019-10-02 13:21:28,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:21:28,594 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 214 [2019-10-02 13:21:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:28,624 INFO L225 Difference]: With dead ends: 5305 [2019-10-02 13:21:28,625 INFO L226 Difference]: Without dead ends: 2701 [2019-10-02 13:21:28,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:21:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2019-10-02 13:21:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2019-10-02 13:21:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2701 states. [2019-10-02 13:21:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 4105 transitions. [2019-10-02 13:21:28,886 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 4105 transitions. Word has length 214 [2019-10-02 13:21:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:28,887 INFO L475 AbstractCegarLoop]: Abstraction has 2701 states and 4105 transitions. [2019-10-02 13:21:28,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:21:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 4105 transitions. [2019-10-02 13:21:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 13:21:28,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:28,905 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:21:28,905 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1548070957, now seen corresponding path program 1 times [2019-10-02 13:21:28,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:28,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:28,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:21:29,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:29,233 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 13:21:29,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:29,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 2958 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:21:29,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:30,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:30,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:21:30,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:21:30,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:21:30,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:21:30,032 INFO L87 Difference]: Start difference. First operand 2701 states and 4105 transitions. Second operand 22 states. [2019-10-02 13:21:38,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:38,267 INFO L93 Difference]: Finished difference Result 5470 states and 8376 transitions. [2019-10-02 13:21:38,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:21:38,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2019-10-02 13:21:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:38,286 INFO L225 Difference]: With dead ends: 5470 [2019-10-02 13:21:38,286 INFO L226 Difference]: Without dead ends: 2830 [2019-10-02 13:21:38,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 13:21:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2019-10-02 13:21:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2785. [2019-10-02 13:21:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2785 states. [2019-10-02 13:21:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 4237 transitions. [2019-10-02 13:21:38,452 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 4237 transitions. Word has length 215 [2019-10-02 13:21:38,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:38,453 INFO L475 AbstractCegarLoop]: Abstraction has 2785 states and 4237 transitions. [2019-10-02 13:21:38,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:21:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 4237 transitions. [2019-10-02 13:21:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:21:38,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:38,472 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:38,472 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:38,473 INFO L82 PathProgramCache]: Analyzing trace with hash -582791751, now seen corresponding path program 1 times [2019-10-02 13:21:38,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:38,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:38,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:21:38,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:38,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:21:38,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:21:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:21:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:21:38,869 INFO L87 Difference]: Start difference. First operand 2785 states and 4237 transitions. Second operand 16 states. [2019-10-02 13:21:39,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:39,315 INFO L93 Difference]: Finished difference Result 4038 states and 5934 transitions. [2019-10-02 13:21:39,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:21:39,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 216 [2019-10-02 13:21:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:39,345 INFO L225 Difference]: With dead ends: 4038 [2019-10-02 13:21:39,345 INFO L226 Difference]: Without dead ends: 2808 [2019-10-02 13:21:39,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:21:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-10-02 13:21:39,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2780. [2019-10-02 13:21:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2780 states. [2019-10-02 13:21:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 4205 transitions. [2019-10-02 13:21:39,496 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 4205 transitions. Word has length 216 [2019-10-02 13:21:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:39,497 INFO L475 AbstractCegarLoop]: Abstraction has 2780 states and 4205 transitions. [2019-10-02 13:21:39,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:21:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 4205 transitions. [2019-10-02 13:21:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:21:39,508 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:39,508 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:39,509 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1262441468, now seen corresponding path program 1 times [2019-10-02 13:21:39,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:39,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:39,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:39,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:39,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:21:39,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:39,692 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 13:21:39,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:40,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 2959 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:21:40,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:21:40,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:21:40,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:21:40,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:21:40,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:21:40,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:21:40,436 INFO L87 Difference]: Start difference. First operand 2780 states and 4205 transitions. Second operand 12 states. [2019-10-02 13:21:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:44,755 INFO L93 Difference]: Finished difference Result 8026 states and 12152 transitions. [2019-10-02 13:21:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:21:44,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-10-02 13:21:44,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:44,788 INFO L225 Difference]: With dead ends: 8026 [2019-10-02 13:21:44,789 INFO L226 Difference]: Without dead ends: 5321 [2019-10-02 13:21:44,799 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:21:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5321 states. [2019-10-02 13:21:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5321 to 5288. [2019-10-02 13:21:45,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5288 states. [2019-10-02 13:21:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5288 states to 5288 states and 7940 transitions. [2019-10-02 13:21:45,084 INFO L78 Accepts]: Start accepts. Automaton has 5288 states and 7940 transitions. Word has length 216 [2019-10-02 13:21:45,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:45,085 INFO L475 AbstractCegarLoop]: Abstraction has 5288 states and 7940 transitions. [2019-10-02 13:21:45,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:21:45,085 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 7940 transitions. [2019-10-02 13:21:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 13:21:45,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:45,103 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:21:45,104 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash 120415888, now seen corresponding path program 1 times [2019-10-02 13:21:45,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:45,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:45,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:45,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:45,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:21:45,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:45,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:21:45,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:21:45,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:21:45,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:21:45,342 INFO L87 Difference]: Start difference. First operand 5288 states and 7940 transitions. Second operand 12 states. [2019-10-02 13:21:56,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:56,168 INFO L93 Difference]: Finished difference Result 27273 states and 37216 transitions. [2019-10-02 13:21:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:21:56,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 217 [2019-10-02 13:21:56,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:56,275 INFO L225 Difference]: With dead ends: 27273 [2019-10-02 13:21:56,276 INFO L226 Difference]: Without dead ends: 21825 [2019-10-02 13:21:56,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:21:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21825 states. [2019-10-02 13:21:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21825 to 20753. [2019-10-02 13:21:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20753 states. [2019-10-02 13:21:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20753 states to 20753 states and 28352 transitions. [2019-10-02 13:21:57,325 INFO L78 Accepts]: Start accepts. Automaton has 20753 states and 28352 transitions. Word has length 217 [2019-10-02 13:21:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:57,327 INFO L475 AbstractCegarLoop]: Abstraction has 20753 states and 28352 transitions. [2019-10-02 13:21:57,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:21:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 20753 states and 28352 transitions. [2019-10-02 13:21:57,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:21:57,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:57,356 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:21:57,356 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash 472127972, now seen corresponding path program 1 times [2019-10-02 13:21:57,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:57,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:57,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:57,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:21:58,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:21:58,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:21:58,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:21:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:21:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:21:58,566 INFO L87 Difference]: Start difference. First operand 20753 states and 28352 transitions. Second operand 18 states. [2019-10-02 13:21:59,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:21:59,328 INFO L93 Difference]: Finished difference Result 34293 states and 46076 transitions. [2019-10-02 13:21:59,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:21:59,328 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 218 [2019-10-02 13:21:59,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:21:59,393 INFO L225 Difference]: With dead ends: 34293 [2019-10-02 13:21:59,393 INFO L226 Difference]: Without dead ends: 14623 [2019-10-02 13:21:59,446 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:21:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14623 states. [2019-10-02 13:22:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14623 to 13367. [2019-10-02 13:22:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13367 states. [2019-10-02 13:22:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13367 states to 13367 states and 18521 transitions. [2019-10-02 13:22:00,063 INFO L78 Accepts]: Start accepts. Automaton has 13367 states and 18521 transitions. Word has length 218 [2019-10-02 13:22:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:00,063 INFO L475 AbstractCegarLoop]: Abstraction has 13367 states and 18521 transitions. [2019-10-02 13:22:00,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:22:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 13367 states and 18521 transitions. [2019-10-02 13:22:00,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 13:22:00,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:00,084 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:22:00,085 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:00,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1116114066, now seen corresponding path program 1 times [2019-10-02 13:22:00,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:00,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:00,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:00,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:00,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:22:00,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:00,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:22:00,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:22:00,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:22:00,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:22:00,351 INFO L87 Difference]: Start difference. First operand 13367 states and 18521 transitions. Second operand 8 states. [2019-10-02 13:22:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:01,801 INFO L93 Difference]: Finished difference Result 33461 states and 45179 transitions. [2019-10-02 13:22:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:22:01,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 13:22:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:01,892 INFO L225 Difference]: With dead ends: 33461 [2019-10-02 13:22:01,893 INFO L226 Difference]: Without dead ends: 25166 [2019-10-02 13:22:01,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:22:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25166 states. [2019-10-02 13:22:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25166 to 24544. [2019-10-02 13:22:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24544 states. [2019-10-02 13:22:03,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24544 states to 24544 states and 33348 transitions. [2019-10-02 13:22:03,053 INFO L78 Accepts]: Start accepts. Automaton has 24544 states and 33348 transitions. Word has length 227 [2019-10-02 13:22:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:03,053 INFO L475 AbstractCegarLoop]: Abstraction has 24544 states and 33348 transitions. [2019-10-02 13:22:03,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:22:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 24544 states and 33348 transitions. [2019-10-02 13:22:03,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:22:03,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:03,083 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 13:22:03,083 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1064651066, now seen corresponding path program 1 times [2019-10-02 13:22:03,084 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:03,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:03,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:22:03,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:03,354 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 13:22:03,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:04,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:22:04,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:22:04,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:04,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:22:04,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:22:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:22:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:22:04,185 INFO L87 Difference]: Start difference. First operand 24544 states and 33348 transitions. Second operand 20 states. [2019-10-02 13:22:06,796 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-10-02 13:22:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:13,992 INFO L93 Difference]: Finished difference Result 50415 states and 69122 transitions. [2019-10-02 13:22:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:22:13,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 228 [2019-10-02 13:22:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:14,091 INFO L225 Difference]: With dead ends: 50415 [2019-10-02 13:22:14,092 INFO L226 Difference]: Without dead ends: 25951 [2019-10-02 13:22:14,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:22:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25951 states. [2019-10-02 13:22:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25951 to 24445. [2019-10-02 13:22:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24445 states. [2019-10-02 13:22:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24445 states to 24445 states and 33224 transitions. [2019-10-02 13:22:15,061 INFO L78 Accepts]: Start accepts. Automaton has 24445 states and 33224 transitions. Word has length 228 [2019-10-02 13:22:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:15,061 INFO L475 AbstractCegarLoop]: Abstraction has 24445 states and 33224 transitions. [2019-10-02 13:22:15,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:22:15,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24445 states and 33224 transitions. [2019-10-02 13:22:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:22:15,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:15,085 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:15,085 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:15,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1510254888, now seen corresponding path program 1 times [2019-10-02 13:22:15,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:15,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:15,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:15,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:15,685 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:15,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:15,685 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 13:22:16,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:16,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:22:16,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:22:16,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:16,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-10-02 13:22:16,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:22:16,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:22:16,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:22:16,915 INFO L87 Difference]: Start difference. First operand 24445 states and 33224 transitions. Second operand 30 states. [2019-10-02 13:22:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:28,281 INFO L93 Difference]: Finished difference Result 50956 states and 69767 transitions. [2019-10-02 13:22:28,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 13:22:28,281 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 229 [2019-10-02 13:22:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:28,399 INFO L225 Difference]: With dead ends: 50956 [2019-10-02 13:22:28,399 INFO L226 Difference]: Without dead ends: 26107 [2019-10-02 13:22:28,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=659, Invalid=7351, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 13:22:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26107 states. [2019-10-02 13:22:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26107 to 25144. [2019-10-02 13:22:30,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25144 states. [2019-10-02 13:22:30,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25144 states to 25144 states and 34157 transitions. [2019-10-02 13:22:30,759 INFO L78 Accepts]: Start accepts. Automaton has 25144 states and 34157 transitions. Word has length 229 [2019-10-02 13:22:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:30,759 INFO L475 AbstractCegarLoop]: Abstraction has 25144 states and 34157 transitions. [2019-10-02 13:22:30,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:22:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25144 states and 34157 transitions. [2019-10-02 13:22:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:22:30,775 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:30,775 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 13:22:30,776 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:30,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:30,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1222561721, now seen corresponding path program 1 times [2019-10-02 13:22:30,776 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:30,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:30,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:31,007 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:22:31,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:31,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:22:31,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:22:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:22:31,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:22:31,009 INFO L87 Difference]: Start difference. First operand 25144 states and 34157 transitions. Second operand 13 states. [2019-10-02 13:22:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:31,836 INFO L93 Difference]: Finished difference Result 36109 states and 49248 transitions. [2019-10-02 13:22:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:22:31,837 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-10-02 13:22:31,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:31,942 INFO L225 Difference]: With dead ends: 36109 [2019-10-02 13:22:31,943 INFO L226 Difference]: Without dead ends: 27433 [2019-10-02 13:22:31,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27433 states. [2019-10-02 13:22:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27433 to 26131. [2019-10-02 13:22:33,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26131 states. [2019-10-02 13:22:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26131 states to 26131 states and 35734 transitions. [2019-10-02 13:22:33,171 INFO L78 Accepts]: Start accepts. Automaton has 26131 states and 35734 transitions. Word has length 230 [2019-10-02 13:22:33,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:33,172 INFO L475 AbstractCegarLoop]: Abstraction has 26131 states and 35734 transitions. [2019-10-02 13:22:33,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:22:33,172 INFO L276 IsEmpty]: Start isEmpty. Operand 26131 states and 35734 transitions. [2019-10-02 13:22:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:22:33,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:33,189 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 13:22:33,189 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1884380019, now seen corresponding path program 2 times [2019-10-02 13:22:33,190 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:33,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:33,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:33,405 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 13:22:33,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:22:34,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:22:34,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:22:34,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 13:22:34,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:22:34,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:22:34,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:22:34,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:22:34,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:22:34,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:34,355 INFO L87 Difference]: Start difference. First operand 26131 states and 35734 transitions. Second operand 18 states. [2019-10-02 13:22:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:44,907 INFO L93 Difference]: Finished difference Result 69463 states and 95510 transitions. [2019-10-02 13:22:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:22:44,907 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-10-02 13:22:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:45,034 INFO L225 Difference]: With dead ends: 69463 [2019-10-02 13:22:45,034 INFO L226 Difference]: Without dead ends: 44507 [2019-10-02 13:22:45,087 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:22:45,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44507 states. [2019-10-02 13:22:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44507 to 37154. [2019-10-02 13:22:47,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37154 states. [2019-10-02 13:22:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37154 states to 37154 states and 51047 transitions. [2019-10-02 13:22:47,775 INFO L78 Accepts]: Start accepts. Automaton has 37154 states and 51047 transitions. Word has length 230 [2019-10-02 13:22:47,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:47,776 INFO L475 AbstractCegarLoop]: Abstraction has 37154 states and 51047 transitions. [2019-10-02 13:22:47,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:22:47,776 INFO L276 IsEmpty]: Start isEmpty. Operand 37154 states and 51047 transitions. [2019-10-02 13:22:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:22:47,799 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:47,799 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:47,799 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash -398899966, now seen corresponding path program 1 times [2019-10-02 13:22:47,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:47,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:47,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:22:47,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:22:48,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:48,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:22:48,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:22:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:22:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:22:48,056 INFO L87 Difference]: Start difference. First operand 37154 states and 51047 transitions. Second operand 13 states. [2019-10-02 13:22:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:49,618 INFO L93 Difference]: Finished difference Result 53316 states and 73584 transitions. [2019-10-02 13:22:49,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:22:49,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 231 [2019-10-02 13:22:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:49,753 INFO L225 Difference]: With dead ends: 53316 [2019-10-02 13:22:49,753 INFO L226 Difference]: Without dead ends: 40528 [2019-10-02 13:22:49,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:22:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40528 states. [2019-10-02 13:22:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40528 to 38059. [2019-10-02 13:22:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-10-02 13:22:51,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 52604 transitions. [2019-10-02 13:22:51,189 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 52604 transitions. Word has length 231 [2019-10-02 13:22:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:51,189 INFO L475 AbstractCegarLoop]: Abstraction has 38059 states and 52604 transitions. [2019-10-02 13:22:51,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:22:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 52604 transitions. [2019-10-02 13:22:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:22:51,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:51,222 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:51,222 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:51,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1196688235, now seen corresponding path program 1 times [2019-10-02 13:22:51,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:51,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:22:51,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:51,709 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 13:22:51,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:53,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:22:53,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:22:53,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:22:53,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4] total 24 [2019-10-02 13:22:53,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:22:53,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:22:53,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:22:53,867 INFO L87 Difference]: Start difference. First operand 38059 states and 52604 transitions. Second operand 24 states. [2019-10-02 13:23:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:00,320 INFO L93 Difference]: Finished difference Result 77178 states and 106697 transitions. [2019-10-02 13:23:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:23:00,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 231 [2019-10-02 13:23:00,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:00,461 INFO L225 Difference]: With dead ends: 77178 [2019-10-02 13:23:00,461 INFO L226 Difference]: Without dead ends: 39247 [2019-10-02 13:23:00,524 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 13:23:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39247 states. [2019-10-02 13:23:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39247 to 38769. [2019-10-02 13:23:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38769 states. [2019-10-02 13:23:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38769 states to 38769 states and 53559 transitions. [2019-10-02 13:23:02,193 INFO L78 Accepts]: Start accepts. Automaton has 38769 states and 53559 transitions. Word has length 231 [2019-10-02 13:23:02,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:02,194 INFO L475 AbstractCegarLoop]: Abstraction has 38769 states and 53559 transitions. [2019-10-02 13:23:02,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:23:02,194 INFO L276 IsEmpty]: Start isEmpty. Operand 38769 states and 53559 transitions. [2019-10-02 13:23:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:23:02,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:02,219 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:02,219 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:02,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash -2073550806, now seen corresponding path program 1 times [2019-10-02 13:23:02,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:02,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:02,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:02,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:02,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:02,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:02,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:02,357 INFO L87 Difference]: Start difference. First operand 38769 states and 53559 transitions. Second operand 3 states. [2019-10-02 13:23:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:03,495 INFO L93 Difference]: Finished difference Result 80594 states and 112906 transitions. [2019-10-02 13:23:03,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:03,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 13:23:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:03,621 INFO L225 Difference]: With dead ends: 80594 [2019-10-02 13:23:03,622 INFO L226 Difference]: Without dead ends: 42051 [2019-10-02 13:23:03,689 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 13:23:03,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42051 states. [2019-10-02 13:23:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42051 to 41938. [2019-10-02 13:23:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41938 states. [2019-10-02 13:23:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41938 states to 41938 states and 59382 transitions. [2019-10-02 13:23:05,620 INFO L78 Accepts]: Start accepts. Automaton has 41938 states and 59382 transitions. Word has length 231 [2019-10-02 13:23:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:05,621 INFO L475 AbstractCegarLoop]: Abstraction has 41938 states and 59382 transitions. [2019-10-02 13:23:05,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 41938 states and 59382 transitions. [2019-10-02 13:23:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:23:05,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:05,653 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:05,653 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1072923031, now seen corresponding path program 1 times [2019-10-02 13:23:05,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:05,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:05,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:05,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:05,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:05,784 INFO L87 Difference]: Start difference. First operand 41938 states and 59382 transitions. Second operand 3 states. [2019-10-02 13:23:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:08,753 INFO L93 Difference]: Finished difference Result 90268 states and 130670 transitions. [2019-10-02 13:23:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:08,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 13:23:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:08,893 INFO L225 Difference]: With dead ends: 90268 [2019-10-02 13:23:08,893 INFO L226 Difference]: Without dead ends: 48572 [2019-10-02 13:23:08,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 13:23:08,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48572 states. [2019-10-02 13:23:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48572 to 47776. [2019-10-02 13:23:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47776 states. [2019-10-02 13:23:10,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47776 states to 47776 states and 70323 transitions. [2019-10-02 13:23:10,759 INFO L78 Accepts]: Start accepts. Automaton has 47776 states and 70323 transitions. Word has length 232 [2019-10-02 13:23:10,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:10,760 INFO L475 AbstractCegarLoop]: Abstraction has 47776 states and 70323 transitions. [2019-10-02 13:23:10,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 47776 states and 70323 transitions. [2019-10-02 13:23:10,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:23:10,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:10,820 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:10,820 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:10,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1171000170, now seen corresponding path program 1 times [2019-10-02 13:23:10,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:10,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:10,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:10,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:10,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:10,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:10,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:10,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:10,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:10,947 INFO L87 Difference]: Start difference. First operand 47776 states and 70323 transitions. Second operand 3 states. [2019-10-02 13:23:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:13,266 INFO L93 Difference]: Finished difference Result 107596 states and 162614 transitions. [2019-10-02 13:23:13,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:13,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:23:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:13,452 INFO L225 Difference]: With dead ends: 107596 [2019-10-02 13:23:13,452 INFO L226 Difference]: Without dead ends: 60074 [2019-10-02 13:23:13,537 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 13:23:13,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60074 states. [2019-10-02 13:23:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60074 to 59925. [2019-10-02 13:23:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59925 states. [2019-10-02 13:23:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59925 states to 59925 states and 92017 transitions. [2019-10-02 13:23:18,059 INFO L78 Accepts]: Start accepts. Automaton has 59925 states and 92017 transitions. Word has length 233 [2019-10-02 13:23:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:18,059 INFO L475 AbstractCegarLoop]: Abstraction has 59925 states and 92017 transitions. [2019-10-02 13:23:18,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 59925 states and 92017 transitions. [2019-10-02 13:23:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:23:18,225 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:18,225 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:18,225 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:18,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1096500395, now seen corresponding path program 1 times [2019-10-02 13:23:18,226 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:18,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:18,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:18,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:18,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:18,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:18,357 INFO L87 Difference]: Start difference. First operand 59925 states and 92017 transitions. Second operand 3 states. [2019-10-02 13:23:21,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:21,265 INFO L93 Difference]: Finished difference Result 144558 states and 228648 transitions. [2019-10-02 13:23:21,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:21,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 13:23:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:21,608 INFO L225 Difference]: With dead ends: 144558 [2019-10-02 13:23:21,608 INFO L226 Difference]: Without dead ends: 84895 [2019-10-02 13:23:21,725 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 13:23:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84895 states. [2019-10-02 13:23:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84895 to 84889. [2019-10-02 13:23:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84889 states. [2019-10-02 13:23:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84889 states to 84889 states and 136179 transitions. [2019-10-02 13:23:28,171 INFO L78 Accepts]: Start accepts. Automaton has 84889 states and 136179 transitions. Word has length 234 [2019-10-02 13:23:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:28,172 INFO L475 AbstractCegarLoop]: Abstraction has 84889 states and 136179 transitions. [2019-10-02 13:23:28,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 84889 states and 136179 transitions. [2019-10-02 13:23:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:23:28,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:28,396 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:28,397 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:28,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:28,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1997754774, now seen corresponding path program 1 times [2019-10-02 13:23:28,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:28,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:28,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:28,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:28,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:28,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:28,520 INFO L87 Difference]: Start difference. First operand 84889 states and 136179 transitions. Second operand 3 states. [2019-10-02 13:23:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:36,251 INFO L93 Difference]: Finished difference Result 215598 states and 353436 transitions. [2019-10-02 13:23:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:36,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 13:23:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:36,657 INFO L225 Difference]: With dead ends: 215598 [2019-10-02 13:23:36,657 INFO L226 Difference]: Without dead ends: 130987 [2019-10-02 13:23:36,809 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 13:23:36,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130987 states. [2019-10-02 13:23:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130987 to 130946. [2019-10-02 13:23:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130946 states. [2019-10-02 13:23:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130946 states to 130946 states and 216018 transitions. [2019-10-02 13:23:43,941 INFO L78 Accepts]: Start accepts. Automaton has 130946 states and 216018 transitions. Word has length 235 [2019-10-02 13:23:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:43,941 INFO L475 AbstractCegarLoop]: Abstraction has 130946 states and 216018 transitions. [2019-10-02 13:23:43,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:23:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 130946 states and 216018 transitions. [2019-10-02 13:23:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:23:44,373 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:44,374 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:44,374 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:44,374 INFO L82 PathProgramCache]: Analyzing trace with hash -413705005, now seen corresponding path program 1 times [2019-10-02 13:23:44,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:44,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:44,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:44,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:23:44,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:23:44,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:23:44,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:23:44,507 INFO L87 Difference]: Start difference. First operand 130946 states and 216018 transitions. Second operand 3 states. [2019-10-02 13:23:56,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:56,239 INFO L93 Difference]: Finished difference Result 349156 states and 583736 transitions. [2019-10-02 13:23:56,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:23:56,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-02 13:23:56,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:56,890 INFO L225 Difference]: With dead ends: 349156 [2019-10-02 13:23:56,890 INFO L226 Difference]: Without dead ends: 218508 [2019-10-02 13:23:57,126 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 13:23:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218508 states. [2019-10-02 13:24:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218508 to 218296. [2019-10-02 13:24:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218296 states. [2019-10-02 13:24:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218296 states to 218296 states and 364740 transitions. [2019-10-02 13:24:14,894 INFO L78 Accepts]: Start accepts. Automaton has 218296 states and 364740 transitions. Word has length 236 [2019-10-02 13:24:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:14,894 INFO L475 AbstractCegarLoop]: Abstraction has 218296 states and 364740 transitions. [2019-10-02 13:24:14,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 218296 states and 364740 transitions. [2019-10-02 13:24:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:24:15,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:15,760 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:15,760 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:15,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1912993494, now seen corresponding path program 1 times [2019-10-02 13:24:15,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:15,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:15,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:15,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:15,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:15,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:15,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:15,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:15,889 INFO L87 Difference]: Start difference. First operand 218296 states and 364740 transitions. Second operand 3 states. [2019-10-02 13:24:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:36,268 INFO L93 Difference]: Finished difference Result 417014 states and 691037 transitions. [2019-10-02 13:24:36,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:36,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-02 13:24:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:37,610 INFO L225 Difference]: With dead ends: 417014 [2019-10-02 13:24:37,610 INFO L226 Difference]: Without dead ends: 384166 [2019-10-02 13:24:37,759 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 13:24:38,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384166 states. [2019-10-02 13:25:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384166 to 384077. [2019-10-02 13:25:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384077 states. [2019-10-02 13:25:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384077 states to 384077 states and 641085 transitions. [2019-10-02 13:25:13,169 INFO L78 Accepts]: Start accepts. Automaton has 384077 states and 641085 transitions. Word has length 237 [2019-10-02 13:25:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:13,169 INFO L475 AbstractCegarLoop]: Abstraction has 384077 states and 641085 transitions. [2019-10-02 13:25:13,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:25:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 384077 states and 641085 transitions. [2019-10-02 13:25:14,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:25:14,338 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:14,338 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:25:14,339 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:14,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:14,339 INFO L82 PathProgramCache]: Analyzing trace with hash -839047661, now seen corresponding path program 1 times [2019-10-02 13:25:14,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:14,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:14,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:14,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:25:14,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:25:14,705 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:25:14,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:15,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 3029 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:25:15,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:25:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 13:25:15,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:25:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 32 [2019-10-02 13:25:15,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 13:25:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 13:25:15,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2019-10-02 13:25:15,864 INFO L87 Difference]: Start difference. First operand 384077 states and 641085 transitions. Second operand 32 states. [2019-10-02 13:25:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:50,783 INFO L93 Difference]: Finished difference Result 410406 states and 676296 transitions. [2019-10-02 13:25:50,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:25:50,783 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 238 [2019-10-02 13:25:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:52,249 INFO L225 Difference]: With dead ends: 410406 [2019-10-02 13:25:52,249 INFO L226 Difference]: Without dead ends: 391551 [2019-10-02 13:25:52,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=385, Invalid=2807, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 13:25:52,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391551 states. [2019-10-02 13:26:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391551 to 389565. [2019-10-02 13:26:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389565 states. [2019-10-02 13:26:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389565 states to 389565 states and 648214 transitions. [2019-10-02 13:26:25,059 INFO L78 Accepts]: Start accepts. Automaton has 389565 states and 648214 transitions. Word has length 238 [2019-10-02 13:26:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:25,060 INFO L475 AbstractCegarLoop]: Abstraction has 389565 states and 648214 transitions. [2019-10-02 13:26:25,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 13:26:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 389565 states and 648214 transitions. [2019-10-02 13:26:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:26:26,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:26,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:26:26,252 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1807159973, now seen corresponding path program 1 times [2019-10-02 13:26:26,252 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:26,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:26,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:26,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:26,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:26:26,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:26,791 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:26:28,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:28,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 3031 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 13:26:28,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:26:28,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:26:28,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-10-02 13:26:28,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 13:26:28,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 13:26:28,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:26:28,956 INFO L87 Difference]: Start difference. First operand 389565 states and 648214 transitions. Second operand 35 states.