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_spec7_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:50:40,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:50:40,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:50:40,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:50:40,601 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:50:40,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:50:40,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:50:40,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:50:40,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:50:40,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:50:40,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:50:40,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:50:40,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:50:40,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:50:40,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:50:40,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:50:40,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:50:40,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:50:40,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:50:40,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:50:40,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:50:40,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:50:40,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:50:40,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:50:40,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:50:40,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:50:40,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:50:40,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:50:40,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:50:40,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:50:40,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:50:40,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:50:40,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:50:40,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:50:40,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:50:40,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:50:40,637 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:50:40,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:50:40,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:50:40,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:50:40,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:50:40,643 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:50:40,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:50:40,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:50:40,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:50:40,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:50:40,679 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:50:40,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:50:40,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:50:40,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:50:40,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:50:40,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:50:40,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:50:40,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:50:40,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:50:40,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:50:40,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:50:40,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:50:40,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:50:40,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:50:40,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:50:40,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:50:40,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:50:40,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:50:40,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:50:40,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:50:40,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:50:40,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:50:40,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:50:40,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:50:40,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:50:40,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:50:40,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:50:40,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:50:40,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:50:40,764 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:50:40,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product30.cil.c [2019-10-02 13:50:40,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa532d70/8c09427b1d3a474097df95899a7921db/FLAGdc463e608 [2019-10-02 13:50:41,496 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:50:41,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product30.cil.c [2019-10-02 13:50:41,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa532d70/8c09427b1d3a474097df95899a7921db/FLAGdc463e608 [2019-10-02 13:50:41,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa532d70/8c09427b1d3a474097df95899a7921db [2019-10-02 13:50:41,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:50:41,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:50:41,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:50:41,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:50:41,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:50:41,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:50:41" (1/1) ... [2019-10-02 13:50:41,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d289120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:41, skipping insertion in model container [2019-10-02 13:50:41,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:50:41" (1/1) ... [2019-10-02 13:50:41,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:50:41,805 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:50:42,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:50:42,620 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:50:42,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:50:42,831 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:50:42,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42 WrapperNode [2019-10-02 13:50:42,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:50:42,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:50:42,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:50:42,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:50:42,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:42,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:42,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:42,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:42,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:42,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:43,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (1/1) ... [2019-10-02 13:50:43,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:50:43,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:50:43,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:50:43,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:50:43,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (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:50:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:50:43,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:50:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:50:43,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:50:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:50:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:50:43,120 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:50:43,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:50:43,121 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:50:43,121 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:50:43,121 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:50:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:50:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:50:43,122 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:50:43,123 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:50:43,123 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:50:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:50:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:50:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:50:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:50:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:50:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:50:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:50:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:50:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:50:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:50:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:50:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:50:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:50:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:50:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:50:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:50:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:50:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:50:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:50:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:50:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:50:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:50:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:50:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:50:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:50:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:50:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:50:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:50:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:50:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:50:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:50:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:50:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:50:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:50:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:50:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:50:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:50:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:50:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:50:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:50:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:50:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:50:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:50:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:50:43,136 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:50:43,136 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:50:43,136 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:50:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:50:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:50:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:50:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:50:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:50:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:50:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:50:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:50:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:50:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:50:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:50:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:50:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:50:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:50:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:50:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:50:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:50:43,141 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:50:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:50:43,142 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 13:50:43,143 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:50:43,143 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:50:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:50:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:50:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:50:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:50:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:50:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:50:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:50:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:50:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:50:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:50:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:50:43,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:50:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:50:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:50:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:50:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:50:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:50:43,147 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:50:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:50:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:50:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:50:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:50:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:50:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:50:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:50:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:50:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:50:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:50:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:50:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:50:43,152 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:50:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:50:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:50:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:50:43,153 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:50:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:50:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:50:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:50:43,154 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:50:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:50:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:50:43,155 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:50:43,156 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:50:43,160 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:50:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:50:43,161 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:50:43,162 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:50:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:50:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:50:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:50:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:50:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:50:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:50:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:50:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:50:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:50:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:50:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:50:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:50:43,173 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:50:43,174 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:50:43,175 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:50:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:50:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:50:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:50:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:50:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:50:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:50:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:50:43,178 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:50:43,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:50:43,179 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:50:43,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:50:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:50:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:50:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:50:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:50:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:50:43,180 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:50:43,181 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:50:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:50:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:50:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:50:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:50:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:50:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:50:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:50:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:50:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:50:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:50:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:50:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:50:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:50:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:50:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:50:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:50:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:50:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:50:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:50:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 13:50:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:50:43,185 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:50:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:50:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:50:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:50:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:50:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:50:43,186 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:50:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:50:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:50:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:50:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:50:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:50:43,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:50:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:50:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:50:45,354 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:50:45,355 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:50:45,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:50:45 BoogieIcfgContainer [2019-10-02 13:50:45,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:50:45,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:50:45,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:50:45,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:50:45,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:50:41" (1/3) ... [2019-10-02 13:50:45,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127f7da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:50:45, skipping insertion in model container [2019-10-02 13:50:45,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:50:42" (2/3) ... [2019-10-02 13:50:45,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127f7da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:50:45, skipping insertion in model container [2019-10-02 13:50:45,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:50:45" (3/3) ... [2019-10-02 13:50:45,368 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product30.cil.c [2019-10-02 13:50:45,380 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:50:45,392 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:50:45,412 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:50:45,457 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:50:45,457 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:50:45,458 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:50:45,458 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:50:45,458 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:50:45,459 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:50:45,463 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:50:45,463 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:50:45,463 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:50:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states. [2019-10-02 13:50:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 13:50:45,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:45,539 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:45,542 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:45,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:45,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1131064280, now seen corresponding path program 1 times [2019-10-02 13:50:45,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:45,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:45,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:45,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:46,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:46,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:50:46,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:50:46,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:50:46,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:50:46,222 INFO L87 Difference]: Start difference. First operand 540 states. Second operand 2 states. [2019-10-02 13:50:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:46,307 INFO L93 Difference]: Finished difference Result 766 states and 1013 transitions. [2019-10-02 13:50:46,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:50:46,309 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2019-10-02 13:50:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:46,332 INFO L225 Difference]: With dead ends: 766 [2019-10-02 13:50:46,332 INFO L226 Difference]: Without dead ends: 489 [2019-10-02 13:50:46,338 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:50:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-10-02 13:50:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2019-10-02 13:50:46,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-10-02 13:50:46,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 649 transitions. [2019-10-02 13:50:46,474 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 649 transitions. Word has length 182 [2019-10-02 13:50:46,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:46,478 INFO L475 AbstractCegarLoop]: Abstraction has 489 states and 649 transitions. [2019-10-02 13:50:46,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:50:46,478 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 649 transitions. [2019-10-02 13:50:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 13:50:46,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:46,487 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:50:46,487 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2140358730, now seen corresponding path program 1 times [2019-10-02 13:50:46,488 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:46,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:46,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:46,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:46,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:46,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:46,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:46,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:46,789 INFO L87 Difference]: Start difference. First operand 489 states and 649 transitions. Second operand 3 states. [2019-10-02 13:50:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:46,881 INFO L93 Difference]: Finished difference Result 749 states and 978 transitions. [2019-10-02 13:50:46,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:46,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-02 13:50:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:46,892 INFO L225 Difference]: With dead ends: 749 [2019-10-02 13:50:46,893 INFO L226 Difference]: Without dead ends: 492 [2019-10-02 13:50:46,903 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:50:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-10-02 13:50:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 491. [2019-10-02 13:50:46,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-10-02 13:50:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 651 transitions. [2019-10-02 13:50:46,953 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 651 transitions. Word has length 183 [2019-10-02 13:50:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:46,954 INFO L475 AbstractCegarLoop]: Abstraction has 491 states and 651 transitions. [2019-10-02 13:50:46,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 651 transitions. [2019-10-02 13:50:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 13:50:46,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:46,959 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:50:46,959 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:46,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1496766790, now seen corresponding path program 1 times [2019-10-02 13:50:46,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:46,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:46,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:46,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:47,204 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:47,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:47,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:47,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:47,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:47,212 INFO L87 Difference]: Start difference. First operand 491 states and 651 transitions. Second operand 3 states. [2019-10-02 13:50:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:47,270 INFO L93 Difference]: Finished difference Result 958 states and 1300 transitions. [2019-10-02 13:50:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:47,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-02 13:50:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:47,280 INFO L225 Difference]: With dead ends: 958 [2019-10-02 13:50:47,280 INFO L226 Difference]: Without dead ends: 532 [2019-10-02 13:50:47,283 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:50:47,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-02 13:50:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 531. [2019-10-02 13:50:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-02 13:50:47,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 720 transitions. [2019-10-02 13:50:47,345 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 720 transitions. Word has length 193 [2019-10-02 13:50:47,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:47,346 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 720 transitions. [2019-10-02 13:50:47,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 720 transitions. [2019-10-02 13:50:47,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 13:50:47,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:47,360 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:50:47,361 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:47,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:47,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1227376246, now seen corresponding path program 1 times [2019-10-02 13:50:47,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:47,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:47,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:47,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:47,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:47,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:47,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:47,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:47,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:47,637 INFO L87 Difference]: Start difference. First operand 531 states and 720 transitions. Second operand 3 states. [2019-10-02 13:50:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:47,680 INFO L93 Difference]: Finished difference Result 1075 states and 1502 transitions. [2019-10-02 13:50:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:47,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 13:50:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:47,689 INFO L225 Difference]: With dead ends: 1075 [2019-10-02 13:50:47,689 INFO L226 Difference]: Without dead ends: 609 [2019-10-02 13:50:47,691 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:50:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-10-02 13:50:47,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 608. [2019-10-02 13:50:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 13:50:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 852 transitions. [2019-10-02 13:50:47,723 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 852 transitions. Word has length 194 [2019-10-02 13:50:47,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:47,724 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 852 transitions. [2019-10-02 13:50:47,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 852 transitions. [2019-10-02 13:50:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 13:50:47,728 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:47,729 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:50:47,729 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:47,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1776385894, now seen corresponding path program 1 times [2019-10-02 13:50:47,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:47,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:47,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:47,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:47,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:47,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:47,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:47,994 INFO L87 Difference]: Start difference. First operand 608 states and 852 transitions. Second operand 3 states. [2019-10-02 13:50:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:48,039 INFO L93 Difference]: Finished difference Result 1300 states and 1888 transitions. [2019-10-02 13:50:48,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:48,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-02 13:50:48,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:48,048 INFO L225 Difference]: With dead ends: 1300 [2019-10-02 13:50:48,048 INFO L226 Difference]: Without dead ends: 757 [2019-10-02 13:50:48,051 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:50:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-10-02 13:50:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 756. [2019-10-02 13:50:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2019-10-02 13:50:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1104 transitions. [2019-10-02 13:50:48,103 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1104 transitions. Word has length 195 [2019-10-02 13:50:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:48,104 INFO L475 AbstractCegarLoop]: Abstraction has 756 states and 1104 transitions. [2019-10-02 13:50:48,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:48,104 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1104 transitions. [2019-10-02 13:50:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:50:48,111 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:48,112 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:50:48,112 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2040028310, now seen corresponding path program 1 times [2019-10-02 13:50:48,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:48,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:48,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:48,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:48,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:48,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:48,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:48,359 INFO L87 Difference]: Start difference. First operand 756 states and 1104 transitions. Second operand 3 states. [2019-10-02 13:50:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:48,422 INFO L93 Difference]: Finished difference Result 1732 states and 2624 transitions. [2019-10-02 13:50:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:48,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:50:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:48,430 INFO L225 Difference]: With dead ends: 1732 [2019-10-02 13:50:48,431 INFO L226 Difference]: Without dead ends: 1041 [2019-10-02 13:50:48,434 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:50:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-02 13:50:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1040. [2019-10-02 13:50:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-10-02 13:50:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1584 transitions. [2019-10-02 13:50:48,487 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1584 transitions. Word has length 196 [2019-10-02 13:50:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:48,489 INFO L475 AbstractCegarLoop]: Abstraction has 1040 states and 1584 transitions. [2019-10-02 13:50:48,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1584 transitions. [2019-10-02 13:50:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 13:50:48,496 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:48,496 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:50:48,496 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash 662668678, now seen corresponding path program 1 times [2019-10-02 13:50:48,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:48,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:48,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:48,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:50:48,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:48,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:50:48,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:50:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:50:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:50:48,692 INFO L87 Difference]: Start difference. First operand 1040 states and 1584 transitions. Second operand 3 states. [2019-10-02 13:50:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:48,823 INFO L93 Difference]: Finished difference Result 2560 states and 4024 transitions. [2019-10-02 13:50:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:50:48,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-02 13:50:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:48,835 INFO L225 Difference]: With dead ends: 2560 [2019-10-02 13:50:48,835 INFO L226 Difference]: Without dead ends: 1585 [2019-10-02 13:50:48,841 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:50:48,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-10-02 13:50:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1584. [2019-10-02 13:50:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1584 states. [2019-10-02 13:50:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2496 transitions. [2019-10-02 13:50:48,919 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2496 transitions. Word has length 197 [2019-10-02 13:50:48,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:48,919 INFO L475 AbstractCegarLoop]: Abstraction has 1584 states and 2496 transitions. [2019-10-02 13:50:48,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:50:48,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2496 transitions. [2019-10-02 13:50:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:50:48,930 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:48,930 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:50:48,930 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:48,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:48,931 INFO L82 PathProgramCache]: Analyzing trace with hash 2098370244, now seen corresponding path program 1 times [2019-10-02 13:50:48,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:48,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:48,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:48,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:50:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:49,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:50:49,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:50:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:50:49,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:50:49,365 INFO L87 Difference]: Start difference. First operand 1584 states and 2496 transitions. Second operand 19 states. [2019-10-02 13:50:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:54,173 INFO L93 Difference]: Finished difference Result 3933 states and 6147 transitions. [2019-10-02 13:50:54,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 13:50:54,174 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-10-02 13:50:54,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:54,201 INFO L225 Difference]: With dead ends: 3933 [2019-10-02 13:50:54,202 INFO L226 Difference]: Without dead ends: 3689 [2019-10-02 13:50:54,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:50:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-10-02 13:50:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3652. [2019-10-02 13:50:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3652 states. [2019-10-02 13:50:54,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5771 transitions. [2019-10-02 13:50:54,412 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 5771 transitions. Word has length 199 [2019-10-02 13:50:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:54,413 INFO L475 AbstractCegarLoop]: Abstraction has 3652 states and 5771 transitions. [2019-10-02 13:50:54,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:50:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 5771 transitions. [2019-10-02 13:50:54,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:50:54,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:54,431 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:54,432 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:54,432 INFO L82 PathProgramCache]: Analyzing trace with hash 2086662794, now seen corresponding path program 1 times [2019-10-02 13:50:54,432 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:54,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:54,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:54,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:50:54,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:54,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:50:54,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:50:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:50:54,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:50:54,843 INFO L87 Difference]: Start difference. First operand 3652 states and 5771 transitions. Second operand 15 states. [2019-10-02 13:50:58,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:58,264 INFO L93 Difference]: Finished difference Result 4781 states and 7296 transitions. [2019-10-02 13:50:58,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 13:50:58,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2019-10-02 13:50:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:58,299 INFO L225 Difference]: With dead ends: 4781 [2019-10-02 13:50:58,299 INFO L226 Difference]: Without dead ends: 3754 [2019-10-02 13:50:58,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 13:50:58,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2019-10-02 13:50:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3722. [2019-10-02 13:50:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3722 states. [2019-10-02 13:50:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5883 transitions. [2019-10-02 13:50:58,534 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5883 transitions. Word has length 200 [2019-10-02 13:50:58,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:58,535 INFO L475 AbstractCegarLoop]: Abstraction has 3722 states and 5883 transitions. [2019-10-02 13:50:58,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:50:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5883 transitions. [2019-10-02 13:50:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:50:58,564 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:58,565 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:58,565 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash -159485995, now seen corresponding path program 1 times [2019-10-02 13:50:58,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:50:58,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:58,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:50:58,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:50:58,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:50:58,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:50:58,770 INFO L87 Difference]: Start difference. First operand 3722 states and 5883 transitions. Second operand 5 states. [2019-10-02 13:50:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:58,879 INFO L93 Difference]: Finished difference Result 4540 states and 6954 transitions. [2019-10-02 13:50:58,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:50:58,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-02 13:50:58,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:58,903 INFO L225 Difference]: With dead ends: 4540 [2019-10-02 13:50:58,903 INFO L226 Difference]: Without dead ends: 3428 [2019-10-02 13:50:58,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:50:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2019-10-02 13:50:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 3428. [2019-10-02 13:50:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3428 states. [2019-10-02 13:50:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 5479 transitions. [2019-10-02 13:50:59,094 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 5479 transitions. Word has length 203 [2019-10-02 13:50:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:59,095 INFO L475 AbstractCegarLoop]: Abstraction has 3428 states and 5479 transitions. [2019-10-02 13:50:59,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:50:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 5479 transitions. [2019-10-02 13:50:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:50:59,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:59,114 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:59,114 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:59,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1989327825, now seen corresponding path program 1 times [2019-10-02 13:50:59,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:59,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:59,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:59,511 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:50:59,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:50:59,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:50:59,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:50:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:50:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:50:59,513 INFO L87 Difference]: Start difference. First operand 3428 states and 5479 transitions. Second operand 16 states. [2019-10-02 13:50:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:59,866 INFO L93 Difference]: Finished difference Result 4318 states and 6665 transitions. [2019-10-02 13:50:59,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:50:59,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 200 [2019-10-02 13:50:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:59,889 INFO L225 Difference]: With dead ends: 4318 [2019-10-02 13:50:59,889 INFO L226 Difference]: Without dead ends: 3480 [2019-10-02 13:50:59,895 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:50:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2019-10-02 13:51:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3462. [2019-10-02 13:51:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2019-10-02 13:51:00,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 5522 transitions. [2019-10-02 13:51:00,051 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 5522 transitions. Word has length 200 [2019-10-02 13:51:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:00,053 INFO L475 AbstractCegarLoop]: Abstraction has 3462 states and 5522 transitions. [2019-10-02 13:51:00,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:51:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 5522 transitions. [2019-10-02 13:51:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:51:00,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:00,070 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:00,070 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:00,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash 22885179, now seen corresponding path program 1 times [2019-10-02 13:51:00,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:00,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:00,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:00,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:00,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:00,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:51:00,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:51:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:51:00,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:51:00,301 INFO L87 Difference]: Start difference. First operand 3462 states and 5522 transitions. Second operand 5 states. [2019-10-02 13:51:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:01,525 INFO L93 Difference]: Finished difference Result 6692 states and 10472 transitions. [2019-10-02 13:51:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:51:01,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-10-02 13:51:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:01,581 INFO L225 Difference]: With dead ends: 6692 [2019-10-02 13:51:01,581 INFO L226 Difference]: Without dead ends: 6123 [2019-10-02 13:51:01,587 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:51:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6123 states. [2019-10-02 13:51:01,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6123 to 6092. [2019-10-02 13:51:01,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6092 states. [2019-10-02 13:51:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6092 states to 6092 states and 9655 transitions. [2019-10-02 13:51:01,859 INFO L78 Accepts]: Start accepts. Automaton has 6092 states and 9655 transitions. Word has length 200 [2019-10-02 13:51:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:01,859 INFO L475 AbstractCegarLoop]: Abstraction has 6092 states and 9655 transitions. [2019-10-02 13:51:01,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:51:01,859 INFO L276 IsEmpty]: Start isEmpty. Operand 6092 states and 9655 transitions. [2019-10-02 13:51:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:51:01,883 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:01,883 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:01,884 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:01,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 43222554, now seen corresponding path program 1 times [2019-10-02 13:51:01,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:01,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:01,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:01,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:01,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:02,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:02,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:51:02,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:51:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:51:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:51:02,068 INFO L87 Difference]: Start difference. First operand 6092 states and 9655 transitions. Second operand 7 states. [2019-10-02 13:51:03,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:03,956 INFO L93 Difference]: Finished difference Result 12518 states and 18483 transitions. [2019-10-02 13:51:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:51:03,957 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-02 13:51:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:04,002 INFO L225 Difference]: With dead ends: 12518 [2019-10-02 13:51:04,002 INFO L226 Difference]: Without dead ends: 10442 [2019-10-02 13:51:04,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:51:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10442 states. [2019-10-02 13:51:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10442 to 10420. [2019-10-02 13:51:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10420 states. [2019-10-02 13:51:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10420 states to 10420 states and 15548 transitions. [2019-10-02 13:51:04,486 INFO L78 Accepts]: Start accepts. Automaton has 10420 states and 15548 transitions. Word has length 200 [2019-10-02 13:51:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:04,487 INFO L475 AbstractCegarLoop]: Abstraction has 10420 states and 15548 transitions. [2019-10-02 13:51:04,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:51:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 10420 states and 15548 transitions. [2019-10-02 13:51:04,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:51:04,521 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:04,521 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:04,522 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:04,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 16236281, now seen corresponding path program 1 times [2019-10-02 13:51:04,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:04,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:05,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:05,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:51:05,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:51:05,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:51:05,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:51:05,004 INFO L87 Difference]: Start difference. First operand 10420 states and 15548 transitions. Second operand 26 states. [2019-10-02 13:51:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:06,075 INFO L93 Difference]: Finished difference Result 17040 states and 24717 transitions. [2019-10-02 13:51:06,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:51:06,076 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 201 [2019-10-02 13:51:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:06,122 INFO L225 Difference]: With dead ends: 17040 [2019-10-02 13:51:06,122 INFO L226 Difference]: Without dead ends: 9548 [2019-10-02 13:51:06,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:51:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9548 states. [2019-10-02 13:51:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9548 to 9415. [2019-10-02 13:51:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9415 states. [2019-10-02 13:51:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9415 states to 9415 states and 14191 transitions. [2019-10-02 13:51:06,606 INFO L78 Accepts]: Start accepts. Automaton has 9415 states and 14191 transitions. Word has length 201 [2019-10-02 13:51:06,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:06,606 INFO L475 AbstractCegarLoop]: Abstraction has 9415 states and 14191 transitions. [2019-10-02 13:51:06,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:51:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 9415 states and 14191 transitions. [2019-10-02 13:51:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:51:06,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:06,632 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:06,632 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:06,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash -953853226, now seen corresponding path program 1 times [2019-10-02 13:51:06,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:06,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:06,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:06,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:06,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:51:06,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:51:06,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:51:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:51:06,826 INFO L87 Difference]: Start difference. First operand 9415 states and 14191 transitions. Second operand 10 states. [2019-10-02 13:51:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:07,113 INFO L93 Difference]: Finished difference Result 9468 states and 14257 transitions. [2019-10-02 13:51:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:51:07,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2019-10-02 13:51:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:07,147 INFO L225 Difference]: With dead ends: 9468 [2019-10-02 13:51:07,147 INFO L226 Difference]: Without dead ends: 9385 [2019-10-02 13:51:07,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:51:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2019-10-02 13:51:07,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 9381. [2019-10-02 13:51:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9381 states. [2019-10-02 13:51:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 14121 transitions. [2019-10-02 13:51:07,559 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 14121 transitions. Word has length 205 [2019-10-02 13:51:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:07,560 INFO L475 AbstractCegarLoop]: Abstraction has 9381 states and 14121 transitions. [2019-10-02 13:51:07,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:51:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 14121 transitions. [2019-10-02 13:51:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:51:07,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:07,577 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:07,577 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:07,578 INFO L82 PathProgramCache]: Analyzing trace with hash -979270205, now seen corresponding path program 1 times [2019-10-02 13:51:07,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:07,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:07,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:07,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:07,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:07,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:07,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:51:07,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:51:07,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:51:07,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:51:07,710 INFO L87 Difference]: Start difference. First operand 9381 states and 14121 transitions. Second operand 5 states. [2019-10-02 13:51:07,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:07,914 INFO L93 Difference]: Finished difference Result 13693 states and 19771 transitions. [2019-10-02 13:51:07,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:51:07,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-02 13:51:07,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:07,953 INFO L225 Difference]: With dead ends: 13693 [2019-10-02 13:51:07,953 INFO L226 Difference]: Without dead ends: 9530 [2019-10-02 13:51:07,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:51:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9530 states. [2019-10-02 13:51:08,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9530 to 9463. [2019-10-02 13:51:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9463 states. [2019-10-02 13:51:08,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9463 states to 9463 states and 14226 transitions. [2019-10-02 13:51:08,985 INFO L78 Accepts]: Start accepts. Automaton has 9463 states and 14226 transitions. Word has length 210 [2019-10-02 13:51:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:08,985 INFO L475 AbstractCegarLoop]: Abstraction has 9463 states and 14226 transitions. [2019-10-02 13:51:08,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:51:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 9463 states and 14226 transitions. [2019-10-02 13:51:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:51:09,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:09,003 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:51:09,003 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:09,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash 181926907, now seen corresponding path program 1 times [2019-10-02 13:51:09,004 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:09,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:09,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:09,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:09,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:51:09,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:51:09,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:51:09,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:51:09,206 INFO L87 Difference]: Start difference. First operand 9463 states and 14226 transitions. Second operand 11 states. [2019-10-02 13:51:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:09,698 INFO L93 Difference]: Finished difference Result 13676 states and 19698 transitions. [2019-10-02 13:51:09,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:51:09,699 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2019-10-02 13:51:09,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:09,740 INFO L225 Difference]: With dead ends: 13676 [2019-10-02 13:51:09,740 INFO L226 Difference]: Without dead ends: 9461 [2019-10-02 13:51:09,755 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:51:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9461 states. [2019-10-02 13:51:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9461 to 9425. [2019-10-02 13:51:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9425 states. [2019-10-02 13:51:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9425 states to 9425 states and 14144 transitions. [2019-10-02 13:51:10,143 INFO L78 Accepts]: Start accepts. Automaton has 9425 states and 14144 transitions. Word has length 210 [2019-10-02 13:51:10,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:10,143 INFO L475 AbstractCegarLoop]: Abstraction has 9425 states and 14144 transitions. [2019-10-02 13:51:10,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:51:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 9425 states and 14144 transitions. [2019-10-02 13:51:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 13:51:10,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:10,162 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:10,163 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 370927849, now seen corresponding path program 1 times [2019-10-02 13:51:10,163 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:10,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:10,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:10,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:51:10,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:51:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:51:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:51:10,333 INFO L87 Difference]: Start difference. First operand 9425 states and 14144 transitions. Second operand 6 states. [2019-10-02 13:51:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:11,133 INFO L93 Difference]: Finished difference Result 23626 states and 35165 transitions. [2019-10-02 13:51:11,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:51:11,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-02 13:51:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:11,198 INFO L225 Difference]: With dead ends: 23626 [2019-10-02 13:51:11,199 INFO L226 Difference]: Without dead ends: 18833 [2019-10-02 13:51:11,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:51:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18833 states. [2019-10-02 13:51:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18833 to 18699. [2019-10-02 13:51:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18699 states. [2019-10-02 13:51:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18699 states to 18699 states and 28719 transitions. [2019-10-02 13:51:11,896 INFO L78 Accepts]: Start accepts. Automaton has 18699 states and 28719 transitions. Word has length 211 [2019-10-02 13:51:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:11,896 INFO L475 AbstractCegarLoop]: Abstraction has 18699 states and 28719 transitions. [2019-10-02 13:51:11,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:51:11,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18699 states and 28719 transitions. [2019-10-02 13:51:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:51:11,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:11,932 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:11,932 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1818811780, now seen corresponding path program 1 times [2019-10-02 13:51:11,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:11,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:11,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:51:12,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:12,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:51:12,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:51:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:51:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:51:12,282 INFO L87 Difference]: Start difference. First operand 18699 states and 28719 transitions. Second operand 8 states. [2019-10-02 13:51:17,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:17,117 INFO L93 Difference]: Finished difference Result 56711 states and 95359 transitions. [2019-10-02 13:51:17,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:51:17,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 247 [2019-10-02 13:51:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:17,257 INFO L225 Difference]: With dead ends: 56711 [2019-10-02 13:51:17,257 INFO L226 Difference]: Without dead ends: 38077 [2019-10-02 13:51:17,303 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:51:17,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38077 states. [2019-10-02 13:51:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38077 to 35225. [2019-10-02 13:51:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35225 states. [2019-10-02 13:51:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35225 states to 35225 states and 58831 transitions. [2019-10-02 13:51:18,967 INFO L78 Accepts]: Start accepts. Automaton has 35225 states and 58831 transitions. Word has length 247 [2019-10-02 13:51:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:18,968 INFO L475 AbstractCegarLoop]: Abstraction has 35225 states and 58831 transitions. [2019-10-02 13:51:18,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:51:18,968 INFO L276 IsEmpty]: Start isEmpty. Operand 35225 states and 58831 transitions. [2019-10-02 13:51:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 13:51:19,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:19,053 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:19,053 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1096770758, now seen corresponding path program 1 times [2019-10-02 13:51:19,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:19,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:19,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:51:19,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:19,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:51:19,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:51:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:51:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:51:19,287 INFO L87 Difference]: Start difference. First operand 35225 states and 58831 transitions. Second operand 8 states. [2019-10-02 13:51:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:25,556 INFO L93 Difference]: Finished difference Result 107093 states and 195211 transitions. [2019-10-02 13:51:25,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:51:25,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-10-02 13:51:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:25,928 INFO L225 Difference]: With dead ends: 107093 [2019-10-02 13:51:25,928 INFO L226 Difference]: Without dead ends: 71933 [2019-10-02 13:51:26,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:51:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71933 states. [2019-10-02 13:51:30,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71933 to 68457. [2019-10-02 13:51:30,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68457 states. [2019-10-02 13:51:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68457 states to 68457 states and 123387 transitions. [2019-10-02 13:51:31,168 INFO L78 Accepts]: Start accepts. Automaton has 68457 states and 123387 transitions. Word has length 248 [2019-10-02 13:51:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:31,168 INFO L475 AbstractCegarLoop]: Abstraction has 68457 states and 123387 transitions. [2019-10-02 13:51:31,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:51:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 68457 states and 123387 transitions. [2019-10-02 13:51:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 13:51:31,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:31,336 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:31,336 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash -211543872, now seen corresponding path program 1 times [2019-10-02 13:51:31,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:31,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:31,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:31,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:51:31,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:31,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:51:31,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:51:31,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:51:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:51:31,569 INFO L87 Difference]: Start difference. First operand 68457 states and 123387 transitions. Second operand 8 states. [2019-10-02 13:51:40,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:40,493 INFO L93 Difference]: Finished difference Result 208265 states and 407845 transitions. [2019-10-02 13:51:40,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:51:40,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-10-02 13:51:40,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:44,082 INFO L225 Difference]: With dead ends: 208265 [2019-10-02 13:51:44,082 INFO L226 Difference]: Without dead ends: 139873 [2019-10-02 13:51:44,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:51:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139873 states. [2019-10-02 13:51:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139873 to 133678. [2019-10-02 13:51:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133678 states. [2019-10-02 13:51:50,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133678 states to 133678 states and 259049 transitions. [2019-10-02 13:51:50,792 INFO L78 Accepts]: Start accepts. Automaton has 133678 states and 259049 transitions. Word has length 249 [2019-10-02 13:51:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:50,793 INFO L475 AbstractCegarLoop]: Abstraction has 133678 states and 259049 transitions. [2019-10-02 13:51:50,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:51:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 133678 states and 259049 transitions. [2019-10-02 13:51:51,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:51:51,151 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:51,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:51,151 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1888299869, now seen corresponding path program 1 times [2019-10-02 13:51:51,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:51,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:51,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:51,381 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:51:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:51:51,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:51:51,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:51:51,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:51:51,383 INFO L87 Difference]: Start difference. First operand 133678 states and 259049 transitions. Second operand 8 states. [2019-10-02 13:52:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:03,024 INFO L93 Difference]: Finished difference Result 340090 states and 622593 transitions. [2019-10-02 13:52:03,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:52:03,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-10-02 13:52:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:04,138 INFO L225 Difference]: With dead ends: 340090 [2019-10-02 13:52:04,139 INFO L226 Difference]: Without dead ends: 272662 [2019-10-02 13:52:04,296 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:52:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272662 states. [2019-10-02 13:52:22,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272662 to 258749. [2019-10-02 13:52:22,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258749 states. [2019-10-02 13:52:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258749 states to 258749 states and 511533 transitions. [2019-10-02 13:52:24,782 INFO L78 Accepts]: Start accepts. Automaton has 258749 states and 511533 transitions. Word has length 230 [2019-10-02 13:52:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:24,782 INFO L475 AbstractCegarLoop]: Abstraction has 258749 states and 511533 transitions. [2019-10-02 13:52:24,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:52:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 258749 states and 511533 transitions. [2019-10-02 13:52:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:52:25,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:25,601 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 13:52:25,601 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:25,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 243520521, now seen corresponding path program 1 times [2019-10-02 13:52:25,602 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:25,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:52:25,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:25,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:52:25,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:52:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:52:25,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:52:25,899 INFO L87 Difference]: Start difference. First operand 258749 states and 511533 transitions. Second operand 15 states. [2019-10-02 13:52:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:41,532 INFO L93 Difference]: Finished difference Result 362529 states and 648299 transitions. [2019-10-02 13:52:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:52:41,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2019-10-02 13:52:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:42,602 INFO L225 Difference]: With dead ends: 362529 [2019-10-02 13:52:42,603 INFO L226 Difference]: Without dead ends: 260589 [2019-10-02 13:52:42,813 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:52:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260589 states. [2019-10-02 13:53:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260589 to 251750. [2019-10-02 13:53:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251750 states. [2019-10-02 13:53:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251750 states to 251750 states and 501639 transitions. [2019-10-02 13:53:03,058 INFO L78 Accepts]: Start accepts. Automaton has 251750 states and 501639 transitions. Word has length 231 [2019-10-02 13:53:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:03,059 INFO L475 AbstractCegarLoop]: Abstraction has 251750 states and 501639 transitions. [2019-10-02 13:53:03,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:53:03,059 INFO L276 IsEmpty]: Start isEmpty. Operand 251750 states and 501639 transitions. [2019-10-02 13:53:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:53:03,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:03,954 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 13:53:03,955 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:03,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash -857177347, now seen corresponding path program 1 times [2019-10-02 13:53:03,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:03,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:03,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:03,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:03,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:53:04,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:04,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:53:04,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:53:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:53:04,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:04,149 INFO L87 Difference]: Start difference. First operand 251750 states and 501639 transitions. Second operand 7 states. [2019-10-02 13:53:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:44,209 INFO L93 Difference]: Finished difference Result 721568 states and 1476815 transitions. [2019-10-02 13:53:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:53:44,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-10-02 13:53:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:55,928 INFO L225 Difference]: With dead ends: 721568 [2019-10-02 13:53:55,928 INFO L226 Difference]: Without dead ends: 614098 [2019-10-02 13:53:56,260 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:53:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614098 states. [2019-10-02 13:54:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614098 to 468393. [2019-10-02 13:54:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468393 states. [2019-10-02 13:54:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468393 states to 468393 states and 971456 transitions. [2019-10-02 13:54:56,806 INFO L78 Accepts]: Start accepts. Automaton has 468393 states and 971456 transitions. Word has length 231 [2019-10-02 13:54:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:56,807 INFO L475 AbstractCegarLoop]: Abstraction has 468393 states and 971456 transitions. [2019-10-02 13:54:56,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:54:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 468393 states and 971456 transitions. [2019-10-02 13:55:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:55:00,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:00,490 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 13:55:00,490 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:00,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:00,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1959081, now seen corresponding path program 2 times [2019-10-02 13:55:00,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:00,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:00,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:00,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:00,691 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:55:00,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:00,691 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:55:00,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:55:01,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:55:01,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:55:01,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:55:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:55:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:01,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 13:55:01,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:55:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:55:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:55:01,597 INFO L87 Difference]: Start difference. First operand 468393 states and 971456 transitions. Second operand 18 states. [2019-10-02 13:55:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:42,436 INFO L93 Difference]: Finished difference Result 939602 states and 1947804 transitions. [2019-10-02 13:55:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:55:42,437 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2019-10-02 13:55:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:45,172 INFO L225 Difference]: With dead ends: 939602 [2019-10-02 13:55:45,172 INFO L226 Difference]: Without dead ends: 471261 [2019-10-02 13:55:47,596 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:55:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471261 states. [2019-10-02 13:56:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471261 to 404245. [2019-10-02 13:56:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404245 states. [2019-10-02 13:56:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404245 states to 404245 states and 886433 transitions. [2019-10-02 13:56:46,558 INFO L78 Accepts]: Start accepts. Automaton has 404245 states and 886433 transitions. Word has length 231 [2019-10-02 13:56:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:46,559 INFO L475 AbstractCegarLoop]: Abstraction has 404245 states and 886433 transitions. [2019-10-02 13:56:46,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:56:46,559 INFO L276 IsEmpty]: Start isEmpty. Operand 404245 states and 886433 transitions. [2019-10-02 13:57:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 13:57:02,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:02,068 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,068 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:02,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:02,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2011842377, now seen corresponding path program 1 times [2019-10-02 13:57:02,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:02,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:02,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:57:02,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:04,709 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2019-10-02 13:57:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 13:57:05,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:57:05,424 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:57:05,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:06,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 3101 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:57:06,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:57:06,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 13:57:06,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:57:06,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [52] total 56 [2019-10-02 13:57:06,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-02 13:57:06,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-02 13:57:06,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2956, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:57:06,291 INFO L87 Difference]: Start difference. First operand 404245 states and 886433 transitions. Second operand 56 states. [2019-10-02 13:57:12,932 WARN L191 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-10-02 13:58:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:33,777 INFO L93 Difference]: Finished difference Result 1146659 states and 2480479 transitions. [2019-10-02 13:58:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2019-10-02 13:58:33,777 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 254 [2019-10-02 13:58:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:38,600 INFO L225 Difference]: With dead ends: 1146659 [2019-10-02 13:58:38,600 INFO L226 Difference]: Without dead ends: 737051 [2019-10-02 13:58:54,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 275 SyntacticMatches, 1 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13381 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2016, Invalid=43566, Unknown=0, NotChecked=0, Total=45582 [2019-10-02 13:58:54,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737051 states.