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_spec4_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:30:27,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:30:27,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:30:27,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:30:27,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:30:27,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:30:27,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:30:27,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:30:27,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:30:27,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:30:27,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:30:27,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:30:27,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:30:27,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:30:27,757 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:30:27,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:30:27,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:30:27,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:30:27,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:30:27,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:30:27,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:30:27,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:30:27,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:30:27,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:30:27,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:30:27,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:30:27,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:30:27,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:30:27,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:30:27,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:30:27,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:30:27,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:30:27,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:30:27,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:30:27,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:30:27,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:30:27,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:30:27,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:30:27,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:30:27,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:30:27,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:30:27,796 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:30:27,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:30:27,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:30:27,811 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:30:27,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:30:27,812 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:30:27,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:30:27,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:30:27,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:30:27,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:30:27,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:30:27,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:30:27,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:30:27,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:30:27,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:30:27,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:30:27,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:30:27,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:30:27,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:30:27,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:30:27,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:30:27,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:30:27,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:30:27,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:30:27,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:30:27,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:30:27,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:30:27,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:30:27,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:30:27,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:30:27,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:30:27,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:30:27,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:30:27,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:30:27,889 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:30:27,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec4_product28.cil.c [2019-10-02 13:30:27,957 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76631fd65/859390c0fa7345dd891d9d3b05a54d77/FLAGc82a1ff31 [2019-10-02 13:30:28,565 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:30:28,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec4_product28.cil.c [2019-10-02 13:30:28,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76631fd65/859390c0fa7345dd891d9d3b05a54d77/FLAGc82a1ff31 [2019-10-02 13:30:28,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76631fd65/859390c0fa7345dd891d9d3b05a54d77 [2019-10-02 13:30:28,796 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:30:28,798 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:30:28,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:30:28,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:30:28,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:30:28,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:30:28" (1/1) ... [2019-10-02 13:30:28,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6885b406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:28, skipping insertion in model container [2019-10-02 13:30:28,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:30:28" (1/1) ... [2019-10-02 13:30:28,813 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:30:28,893 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:30:29,657 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:30:29,684 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:30:29,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:30:29,932 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:30:29,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29 WrapperNode [2019-10-02 13:30:29,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:30:29,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:30:29,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:30:29,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:30:29,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:29,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:29,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:29,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:30,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:30,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:30,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (1/1) ... [2019-10-02 13:30:30,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:30:30,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:30:30,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:30:30,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:30:30,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (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:30:30,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:30:30,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:30:30,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:30:30,166 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:30:30,166 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:30:30,166 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:30:30,167 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:30:30,167 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:30:30,167 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:30:30,167 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:30:30,168 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:30:30,168 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:30:30,168 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:30:30,168 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:30:30,168 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:30:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:30:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:30:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:30:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:30:30,169 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:30:30,170 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:30:30,170 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:30:30,170 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:30:30,170 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:30:30,171 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:30:30,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:30:30,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:30:30,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:30:30,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:30:30,172 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:30:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:30:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:30:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:30:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:30:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:30:30,173 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:30:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:30:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:30:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:30:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:30:30,174 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:30:30,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:30:30,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:30:30,175 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:30:30,175 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:30:30,175 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:30:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:30:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:30:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:30:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:30:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:30:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:30:30,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:30:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:30:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:30:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:30:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:30:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:30:30,178 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:30:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:30:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:30:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:30:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:30:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:30:30,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:30:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:30:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:30:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:30:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:30:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 13:30:30,180 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:30:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:30:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:30:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:30:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:30:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:30:30,181 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:30:30,182 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:30:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:30:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:30:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:30:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:30:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:30:30,183 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignForward_spec__1 [2019-10-02 13:30:30,184 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:30:30,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:30:30,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:30:30,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:30:30,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:30:30,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:30:30,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:30:30,185 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:30:30,186 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:30:30,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:30:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:30:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:30:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:30:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:30:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:30:30,188 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:30:30,189 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:30:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:30:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:30:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:30:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:30:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:30:30,190 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:30:30,191 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignForward_spec__1 [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:30:30,192 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:30:30,193 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:30:30,194 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:30:30,195 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:30:30,196 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:30:30,197 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:30:30,198 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:30:30,199 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:30:30,200 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:30:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:30:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:30:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:30:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:30:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:30:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:30:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:30:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:30:32,176 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:30:32,177 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:30:32,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:30:32 BoogieIcfgContainer [2019-10-02 13:30:32,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:30:32,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:30:32,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:30:32,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:30:32,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:30:28" (1/3) ... [2019-10-02 13:30:32,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fda0bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:30:32, skipping insertion in model container [2019-10-02 13:30:32,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:30:29" (2/3) ... [2019-10-02 13:30:32,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fda0bb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:30:32, skipping insertion in model container [2019-10-02 13:30:32,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:30:32" (3/3) ... [2019-10-02 13:30:32,190 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec4_product28.cil.c [2019-10-02 13:30:32,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:30:32,217 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:30:32,233 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:30:32,277 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:30:32,277 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:30:32,277 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:30:32,278 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:30:32,278 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:30:32,278 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:30:32,278 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:30:32,278 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:30:32,278 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:30:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states. [2019-10-02 13:30:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 13:30:32,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:32,328 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:32,331 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:32,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -153424119, now seen corresponding path program 1 times [2019-10-02 13:30:32,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:32,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:30:32,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:32,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:30:32,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:30:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:30:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:30:32,991 INFO L87 Difference]: Start difference. First operand 509 states. Second operand 2 states. [2019-10-02 13:30:33,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:33,105 INFO L93 Difference]: Finished difference Result 715 states and 948 transitions. [2019-10-02 13:30:33,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:30:33,107 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 164 [2019-10-02 13:30:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:33,192 INFO L225 Difference]: With dead ends: 715 [2019-10-02 13:30:33,193 INFO L226 Difference]: Without dead ends: 458 [2019-10-02 13:30:33,205 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:30:33,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-02 13:30:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2019-10-02 13:30:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2019-10-02 13:30:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 611 transitions. [2019-10-02 13:30:33,313 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 611 transitions. Word has length 164 [2019-10-02 13:30:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:33,315 INFO L475 AbstractCegarLoop]: Abstraction has 458 states and 611 transitions. [2019-10-02 13:30:33,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:30:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 611 transitions. [2019-10-02 13:30:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:30:33,321 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:33,322 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:33,322 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:33,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1934400744, now seen corresponding path program 1 times [2019-10-02 13:30:33,323 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:33,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:33,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:33,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:33,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:30:33,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:33,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:30:33,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:30:33,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:30:33,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:30:33,597 INFO L87 Difference]: Start difference. First operand 458 states and 611 transitions. Second operand 3 states. [2019-10-02 13:30:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:33,653 INFO L93 Difference]: Finished difference Result 698 states and 916 transitions. [2019-10-02 13:30:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:30:33,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 13:30:33,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:33,658 INFO L225 Difference]: With dead ends: 698 [2019-10-02 13:30:33,658 INFO L226 Difference]: Without dead ends: 461 [2019-10-02 13:30:33,660 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:30:33,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-10-02 13:30:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 460. [2019-10-02 13:30:33,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-02 13:30:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 613 transitions. [2019-10-02 13:30:33,685 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 613 transitions. Word has length 165 [2019-10-02 13:30:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:33,686 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 613 transitions. [2019-10-02 13:30:33,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:30:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 613 transitions. [2019-10-02 13:30:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 13:30:33,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:33,690 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:33,690 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:33,691 INFO L82 PathProgramCache]: Analyzing trace with hash -812491460, now seen corresponding path program 1 times [2019-10-02 13:30:33,691 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:33,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:33,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:33,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:30:33,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:33,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:30:33,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:30:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:30:33,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:30:33,842 INFO L87 Difference]: Start difference. First operand 460 states and 613 transitions. Second operand 3 states. [2019-10-02 13:30:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:33,876 INFO L93 Difference]: Finished difference Result 894 states and 1221 transitions. [2019-10-02 13:30:33,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:30:33,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 13:30:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:33,880 INFO L225 Difference]: With dead ends: 894 [2019-10-02 13:30:33,880 INFO L226 Difference]: Without dead ends: 499 [2019-10-02 13:30:33,918 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:30:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-02 13:30:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 498. [2019-10-02 13:30:33,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-10-02 13:30:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 679 transitions. [2019-10-02 13:30:33,940 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 679 transitions. Word has length 171 [2019-10-02 13:30:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:33,940 INFO L475 AbstractCegarLoop]: Abstraction has 498 states and 679 transitions. [2019-10-02 13:30:33,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:30:33,941 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 679 transitions. [2019-10-02 13:30:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 13:30:33,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:33,945 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:33,945 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -522530241, now seen corresponding path program 1 times [2019-10-02 13:30:33,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:33,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:33,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:33,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:33,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:30:34,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:34,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:30:34,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:30:34,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:30:34,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:30:34,148 INFO L87 Difference]: Start difference. First operand 498 states and 679 transitions. Second operand 7 states. [2019-10-02 13:30:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:36,635 INFO L93 Difference]: Finished difference Result 954 states and 1267 transitions. [2019-10-02 13:30:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:30:36,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-10-02 13:30:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:36,641 INFO L225 Difference]: With dead ends: 954 [2019-10-02 13:30:36,641 INFO L226 Difference]: Without dead ends: 733 [2019-10-02 13:30:36,642 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 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:30:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-02 13:30:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 724. [2019-10-02 13:30:36,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-02 13:30:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 971 transitions. [2019-10-02 13:30:36,746 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 971 transitions. Word has length 172 [2019-10-02 13:30:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:36,747 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 971 transitions. [2019-10-02 13:30:36,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:30:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 971 transitions. [2019-10-02 13:30:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 13:30:36,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:36,752 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:36,752 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash -853963851, now seen corresponding path program 1 times [2019-10-02 13:30:36,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:36,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:36,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:36,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:30:37,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:37,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:30:37,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:30:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:30:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:30:37,166 INFO L87 Difference]: Start difference. First operand 724 states and 971 transitions. Second operand 18 states. [2019-10-02 13:30:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:37,696 INFO L93 Difference]: Finished difference Result 1249 states and 1659 transitions. [2019-10-02 13:30:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:30:37,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-10-02 13:30:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:37,705 INFO L225 Difference]: With dead ends: 1249 [2019-10-02 13:30:37,705 INFO L226 Difference]: Without dead ends: 774 [2019-10-02 13:30:37,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:30:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-02 13:30:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 770. [2019-10-02 13:30:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-10-02 13:30:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1034 transitions. [2019-10-02 13:30:37,762 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1034 transitions. Word has length 173 [2019-10-02 13:30:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:37,763 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1034 transitions. [2019-10-02 13:30:37,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:30:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1034 transitions. [2019-10-02 13:30:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 13:30:37,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:37,770 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:37,770 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1446160850, now seen corresponding path program 1 times [2019-10-02 13:30:37,771 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:37,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:37,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:37,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:37,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:30:38,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:38,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:30:38,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:30:38,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:30:38,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:30:38,047 INFO L87 Difference]: Start difference. First operand 770 states and 1034 transitions. Second operand 8 states. [2019-10-02 13:30:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:38,943 INFO L93 Difference]: Finished difference Result 1455 states and 1940 transitions. [2019-10-02 13:30:38,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:30:38,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-10-02 13:30:38,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:38,952 INFO L225 Difference]: With dead ends: 1455 [2019-10-02 13:30:38,952 INFO L226 Difference]: Without dead ends: 1296 [2019-10-02 13:30:38,954 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:30:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2019-10-02 13:30:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1283. [2019-10-02 13:30:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-10-02 13:30:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1714 transitions. [2019-10-02 13:30:39,018 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1714 transitions. Word has length 182 [2019-10-02 13:30:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:39,019 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 1714 transitions. [2019-10-02 13:30:39,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:30:39,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1714 transitions. [2019-10-02 13:30:39,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 13:30:39,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:39,023 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:39,024 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:39,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:39,024 INFO L82 PathProgramCache]: Analyzing trace with hash 108551509, now seen corresponding path program 1 times [2019-10-02 13:30:39,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:39,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:39,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 13:30:39,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:39,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 13:30:39,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:30:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:30:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:30:39,331 INFO L87 Difference]: Start difference. First operand 1283 states and 1714 transitions. Second operand 17 states. [2019-10-02 13:30:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:40,306 INFO L93 Difference]: Finished difference Result 1748 states and 2313 transitions. [2019-10-02 13:30:40,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:30:40,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 183 [2019-10-02 13:30:40,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:40,314 INFO L225 Difference]: With dead ends: 1748 [2019-10-02 13:30:40,315 INFO L226 Difference]: Without dead ends: 1282 [2019-10-02 13:30:40,319 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:30:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2019-10-02 13:30:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1281. [2019-10-02 13:30:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1281 states. [2019-10-02 13:30:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1709 transitions. [2019-10-02 13:30:40,396 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1709 transitions. Word has length 183 [2019-10-02 13:30:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:40,398 INFO L475 AbstractCegarLoop]: Abstraction has 1281 states and 1709 transitions. [2019-10-02 13:30:40,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:30:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1709 transitions. [2019-10-02 13:30:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 13:30:40,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:40,403 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:40,403 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:40,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1143426979, now seen corresponding path program 2 times [2019-10-02 13:30:40,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:40,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:40,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 13:30:40,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:30:40,679 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:30:40,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:30:41,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 13:30:41,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:30:41,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:30:41,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:30:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:30:41,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:30:41,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-10-02 13:30:41,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 13:30:41,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 13:30:41,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:30:41,548 INFO L87 Difference]: Start difference. First operand 1281 states and 1709 transitions. Second operand 17 states. [2019-10-02 13:30:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:43,398 INFO L93 Difference]: Finished difference Result 2876 states and 3849 transitions. [2019-10-02 13:30:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:30:43,399 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 183 [2019-10-02 13:30:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:43,413 INFO L225 Difference]: With dead ends: 2876 [2019-10-02 13:30:43,413 INFO L226 Difference]: Without dead ends: 2190 [2019-10-02 13:30:43,417 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:30:43,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2019-10-02 13:30:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2171. [2019-10-02 13:30:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2171 states. [2019-10-02 13:30:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2926 transitions. [2019-10-02 13:30:43,558 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2926 transitions. Word has length 183 [2019-10-02 13:30:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:43,559 INFO L475 AbstractCegarLoop]: Abstraction has 2171 states and 2926 transitions. [2019-10-02 13:30:43,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 13:30:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2926 transitions. [2019-10-02 13:30:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:30:43,574 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:43,575 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:43,575 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash 510727547, now seen corresponding path program 1 times [2019-10-02 13:30:43,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:43,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:43,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:43,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:30:43,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 13:30:44,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:44,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:30:44,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:30:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:30:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:30:44,068 INFO L87 Difference]: Start difference. First operand 2171 states and 2926 transitions. Second operand 9 states. [2019-10-02 13:30:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:48,225 INFO L93 Difference]: Finished difference Result 6536 states and 8632 transitions. [2019-10-02 13:30:48,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:30:48,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 303 [2019-10-02 13:30:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:48,256 INFO L225 Difference]: With dead ends: 6536 [2019-10-02 13:30:48,256 INFO L226 Difference]: Without dead ends: 5275 [2019-10-02 13:30:48,262 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:30:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2019-10-02 13:30:48,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 4925. [2019-10-02 13:30:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4925 states. [2019-10-02 13:30:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6552 transitions. [2019-10-02 13:30:48,554 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6552 transitions. Word has length 303 [2019-10-02 13:30:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:48,556 INFO L475 AbstractCegarLoop]: Abstraction has 4925 states and 6552 transitions. [2019-10-02 13:30:48,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:30:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6552 transitions. [2019-10-02 13:30:48,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:30:48,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:48,584 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:30:48,585 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash 373340186, now seen corresponding path program 1 times [2019-10-02 13:30:48,585 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:48,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:48,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:30:49,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:49,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:30:49,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:30:49,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:30:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:30:49,232 INFO L87 Difference]: Start difference. First operand 4925 states and 6552 transitions. Second operand 24 states. [2019-10-02 13:30:50,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:50,141 INFO L93 Difference]: Finished difference Result 8324 states and 11064 transitions. [2019-10-02 13:30:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:30:50,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 303 [2019-10-02 13:30:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:50,165 INFO L225 Difference]: With dead ends: 8324 [2019-10-02 13:30:50,166 INFO L226 Difference]: Without dead ends: 4031 [2019-10-02 13:30:50,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:30:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4031 states. [2019-10-02 13:30:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4031 to 4029. [2019-10-02 13:30:50,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4029 states. [2019-10-02 13:30:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 5339 transitions. [2019-10-02 13:30:50,380 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 5339 transitions. Word has length 303 [2019-10-02 13:30:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:50,381 INFO L475 AbstractCegarLoop]: Abstraction has 4029 states and 5339 transitions. [2019-10-02 13:30:50,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:30:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 5339 transitions. [2019-10-02 13:30:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 13:30:50,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:50,399 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:50,399 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:50,400 INFO L82 PathProgramCache]: Analyzing trace with hash -560399925, now seen corresponding path program 1 times [2019-10-02 13:30:50,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:50,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:50,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:50,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:50,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:30:50,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:30:50,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:30:50,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:30:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:30:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:30:50,716 INFO L87 Difference]: Start difference. First operand 4029 states and 5339 transitions. Second operand 10 states. [2019-10-02 13:30:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:50,856 INFO L93 Difference]: Finished difference Result 5342 states and 7006 transitions. [2019-10-02 13:30:50,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:30:50,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 307 [2019-10-02 13:30:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:50,881 INFO L225 Difference]: With dead ends: 5342 [2019-10-02 13:30:50,881 INFO L226 Difference]: Without dead ends: 4029 [2019-10-02 13:30:50,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:30:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4029 states. [2019-10-02 13:30:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4029 to 4029. [2019-10-02 13:30:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4029 states. [2019-10-02 13:30:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 5333 transitions. [2019-10-02 13:30:51,079 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 5333 transitions. Word has length 307 [2019-10-02 13:30:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:51,079 INFO L475 AbstractCegarLoop]: Abstraction has 4029 states and 5333 transitions. [2019-10-02 13:30:51,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:30:51,079 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 5333 transitions. [2019-10-02 13:30:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-10-02 13:30:51,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:51,099 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:30:51,099 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:51,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:51,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1408916464, now seen corresponding path program 1 times [2019-10-02 13:30:51,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:51,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:30:51,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:30:51,320 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:30:51,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:51,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 3135 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:30:51,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:30:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:30:52,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:30:52,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 13:30:52,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:30:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:30:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:30:52,138 INFO L87 Difference]: Start difference. First operand 4029 states and 5333 transitions. Second operand 14 states. [2019-10-02 13:30:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:30:56,331 INFO L93 Difference]: Finished difference Result 15750 states and 20935 transitions. [2019-10-02 13:30:56,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 13:30:56,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 325 [2019-10-02 13:30:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:30:56,394 INFO L225 Difference]: With dead ends: 15750 [2019-10-02 13:30:56,394 INFO L226 Difference]: Without dead ends: 11757 [2019-10-02 13:30:56,412 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:30:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11757 states. [2019-10-02 13:30:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11757 to 11475. [2019-10-02 13:30:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-10-02 13:30:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 15191 transitions. [2019-10-02 13:30:56,908 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 15191 transitions. Word has length 325 [2019-10-02 13:30:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:30:56,908 INFO L475 AbstractCegarLoop]: Abstraction has 11475 states and 15191 transitions. [2019-10-02 13:30:56,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:30:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 15191 transitions. [2019-10-02 13:30:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 13:30:56,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:30:56,959 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:30:56,959 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:30:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:30:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1752949325, now seen corresponding path program 1 times [2019-10-02 13:30:56,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:30:56,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:30:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:56,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:56,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:30:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 13:30:57,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:30:57,322 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:30:57,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:30:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:30:57,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 3202 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:30:57,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:30:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-10-02 13:30:58,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:30:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 13:30:58,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:30:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:30:58,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:30:58,063 INFO L87 Difference]: Start difference. First operand 11475 states and 15191 transitions. Second operand 14 states. [2019-10-02 13:31:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:02,051 INFO L93 Difference]: Finished difference Result 24165 states and 32770 transitions. [2019-10-02 13:31:02,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 13:31:02,052 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 345 [2019-10-02 13:31:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:02,110 INFO L225 Difference]: With dead ends: 24165 [2019-10-02 13:31:02,110 INFO L226 Difference]: Without dead ends: 12621 [2019-10-02 13:31:02,149 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:31:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12621 states. [2019-10-02 13:31:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12621 to 12044. [2019-10-02 13:31:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12044 states. [2019-10-02 13:31:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12044 states to 12044 states and 15963 transitions. [2019-10-02 13:31:02,701 INFO L78 Accepts]: Start accepts. Automaton has 12044 states and 15963 transitions. Word has length 345 [2019-10-02 13:31:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:02,701 INFO L475 AbstractCegarLoop]: Abstraction has 12044 states and 15963 transitions. [2019-10-02 13:31:02,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:31:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 12044 states and 15963 transitions. [2019-10-02 13:31:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-02 13:31:02,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:02,749 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:02,749 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -924125438, now seen corresponding path program 1 times [2019-10-02 13:31:02,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:02,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:02,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:02,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 13:31:03,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:31:03,034 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:31:03,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:03,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 3206 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:31:03,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:31:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:31:03,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:31:03,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 13:31:03,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:31:03,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:31:03,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:31:03,758 INFO L87 Difference]: Start difference. First operand 12044 states and 15963 transitions. Second operand 12 states. [2019-10-02 13:31:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:05,200 INFO L93 Difference]: Finished difference Result 23552 states and 31103 transitions. [2019-10-02 13:31:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:31:05,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 349 [2019-10-02 13:31:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:05,243 INFO L225 Difference]: With dead ends: 23552 [2019-10-02 13:31:05,244 INFO L226 Difference]: Without dead ends: 11581 [2019-10-02 13:31:05,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:31:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11581 states. [2019-10-02 13:31:05,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11581 to 11569. [2019-10-02 13:31:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11569 states. [2019-10-02 13:31:05,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11569 states to 11569 states and 15208 transitions. [2019-10-02 13:31:05,793 INFO L78 Accepts]: Start accepts. Automaton has 11569 states and 15208 transitions. Word has length 349 [2019-10-02 13:31:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:05,793 INFO L475 AbstractCegarLoop]: Abstraction has 11569 states and 15208 transitions. [2019-10-02 13:31:05,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:31:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 11569 states and 15208 transitions. [2019-10-02 13:31:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 13:31:05,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:05,827 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:05,827 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash -472893640, now seen corresponding path program 1 times [2019-10-02 13:31:05,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:05,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:05,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:05,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 13:31:06,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:31:06,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:31:06,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:31:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:31:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:31:06,020 INFO L87 Difference]: Start difference. First operand 11569 states and 15208 transitions. Second operand 3 states. [2019-10-02 13:31:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:06,246 INFO L93 Difference]: Finished difference Result 23364 states and 30886 transitions. [2019-10-02 13:31:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:31:06,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-02 13:31:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:06,296 INFO L225 Difference]: With dead ends: 23364 [2019-10-02 13:31:06,296 INFO L226 Difference]: Without dead ends: 11881 [2019-10-02 13:31:06,322 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:31:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2019-10-02 13:31:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 11877. [2019-10-02 13:31:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11877 states. [2019-10-02 13:31:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11877 states to 11877 states and 15762 transitions. [2019-10-02 13:31:07,089 INFO L78 Accepts]: Start accepts. Automaton has 11877 states and 15762 transitions. Word has length 365 [2019-10-02 13:31:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:07,090 INFO L475 AbstractCegarLoop]: Abstraction has 11877 states and 15762 transitions. [2019-10-02 13:31:07,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:31:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 11877 states and 15762 transitions. [2019-10-02 13:31:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-10-02 13:31:07,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:07,116 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:07,117 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:07,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1487477079, now seen corresponding path program 1 times [2019-10-02 13:31:07,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:07,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:07,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:31:07,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:31:07,323 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:31:07,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:07,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 3213 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:31:07,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:31:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 13:31:08,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:31:08,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:31:08,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:31:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:31:08,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:31:08,069 INFO L87 Difference]: Start difference. First operand 11877 states and 15762 transitions. Second operand 12 states. [2019-10-02 13:31:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:12,009 INFO L93 Difference]: Finished difference Result 45253 states and 61039 transitions. [2019-10-02 13:31:12,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:31:12,010 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 347 [2019-10-02 13:31:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:12,158 INFO L225 Difference]: With dead ends: 45253 [2019-10-02 13:31:12,158 INFO L226 Difference]: Without dead ends: 33393 [2019-10-02 13:31:12,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:31:12,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33393 states. [2019-10-02 13:31:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33393 to 32601. [2019-10-02 13:31:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32601 states. [2019-10-02 13:31:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32601 states to 32601 states and 43414 transitions. [2019-10-02 13:31:13,613 INFO L78 Accepts]: Start accepts. Automaton has 32601 states and 43414 transitions. Word has length 347 [2019-10-02 13:31:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:13,614 INFO L475 AbstractCegarLoop]: Abstraction has 32601 states and 43414 transitions. [2019-10-02 13:31:13,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:31:13,614 INFO L276 IsEmpty]: Start isEmpty. Operand 32601 states and 43414 transitions. [2019-10-02 13:31:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 13:31:13,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:13,682 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:13,682 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1543314267, now seen corresponding path program 1 times [2019-10-02 13:31:13,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:13,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:13,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:13,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:13,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 13:31:13,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:31:13,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:31:13,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:31:13,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:31:13,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:31:13,871 INFO L87 Difference]: Start difference. First operand 32601 states and 43414 transitions. Second operand 3 states. [2019-10-02 13:31:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:14,794 INFO L93 Difference]: Finished difference Result 66266 states and 88941 transitions. [2019-10-02 13:31:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:31:14,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-10-02 13:31:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:14,919 INFO L225 Difference]: With dead ends: 66266 [2019-10-02 13:31:14,919 INFO L226 Difference]: Without dead ends: 33761 [2019-10-02 13:31:14,978 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:31:15,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33761 states. [2019-10-02 13:31:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33761 to 33753. [2019-10-02 13:31:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33753 states. [2019-10-02 13:31:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33753 states to 33753 states and 45594 transitions. [2019-10-02 13:31:18,041 INFO L78 Accepts]: Start accepts. Automaton has 33753 states and 45594 transitions. Word has length 374 [2019-10-02 13:31:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:18,042 INFO L475 AbstractCegarLoop]: Abstraction has 33753 states and 45594 transitions. [2019-10-02 13:31:18,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:31:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 33753 states and 45594 transitions. [2019-10-02 13:31:18,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 13:31:18,110 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:18,111 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:18,111 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1736080370, now seen corresponding path program 1 times [2019-10-02 13:31:18,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:18,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:18,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 13:31:18,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:31:18,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:31:18,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:31:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:31:18,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:31:18,372 INFO L87 Difference]: Start difference. First operand 33753 states and 45594 transitions. Second operand 8 states. [2019-10-02 13:31:23,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:23,312 INFO L93 Difference]: Finished difference Result 102059 states and 140840 transitions. [2019-10-02 13:31:23,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:31:23,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 375 [2019-10-02 13:31:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:23,601 INFO L225 Difference]: With dead ends: 102059 [2019-10-02 13:31:23,601 INFO L226 Difference]: Without dead ends: 68402 [2019-10-02 13:31:23,683 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:31:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68402 states. [2019-10-02 13:31:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68402 to 37953. [2019-10-02 13:31:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37953 states. [2019-10-02 13:31:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37953 states to 37953 states and 54238 transitions. [2019-10-02 13:31:27,368 INFO L78 Accepts]: Start accepts. Automaton has 37953 states and 54238 transitions. Word has length 375 [2019-10-02 13:31:27,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:27,369 INFO L475 AbstractCegarLoop]: Abstraction has 37953 states and 54238 transitions. [2019-10-02 13:31:27,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:31:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 37953 states and 54238 transitions. [2019-10-02 13:31:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 13:31:27,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:27,434 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:27,435 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:27,435 INFO L82 PathProgramCache]: Analyzing trace with hash 862614354, now seen corresponding path program 1 times [2019-10-02 13:31:27,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:27,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:27,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:27,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:27,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 13:31:27,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:31:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:31:27,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:31:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:31:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:31:27,673 INFO L87 Difference]: Start difference. First operand 37953 states and 54238 transitions. Second operand 8 states. [2019-10-02 13:31:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:36,734 INFO L93 Difference]: Finished difference Result 115699 states and 171236 transitions. [2019-10-02 13:31:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:31:36,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 370 [2019-10-02 13:31:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:36,952 INFO L225 Difference]: With dead ends: 115699 [2019-10-02 13:31:36,953 INFO L226 Difference]: Without dead ends: 77842 [2019-10-02 13:31:37,020 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:31:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77842 states. [2019-10-02 13:31:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77842 to 46593. [2019-10-02 13:31:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46593 states. [2019-10-02 13:31:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46593 states to 46593 states and 73206 transitions. [2019-10-02 13:31:39,614 INFO L78 Accepts]: Start accepts. Automaton has 46593 states and 73206 transitions. Word has length 370 [2019-10-02 13:31:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:39,615 INFO L475 AbstractCegarLoop]: Abstraction has 46593 states and 73206 transitions. [2019-10-02 13:31:39,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:31:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 46593 states and 73206 transitions. [2019-10-02 13:31:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-02 13:31:39,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:39,747 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:39,747 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1211563091, now seen corresponding path program 1 times [2019-10-02 13:31:39,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:39,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:39,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:39,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 13:31:39,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:31:39,974 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:31:40,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:40,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 3102 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:31:40,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:31:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 13:31:40,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:31:40,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 13:31:40,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:31:40,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:31:40,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:31:40,744 INFO L87 Difference]: Start difference. First operand 46593 states and 73206 transitions. Second operand 18 states. [2019-10-02 13:31:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:43,957 INFO L93 Difference]: Finished difference Result 94441 states and 148300 transitions. [2019-10-02 13:31:43,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:31:43,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 316 [2019-10-02 13:31:43,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:44,096 INFO L225 Difference]: With dead ends: 94441 [2019-10-02 13:31:44,096 INFO L226 Difference]: Without dead ends: 46421 [2019-10-02 13:31:44,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:31:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46421 states. [2019-10-02 13:31:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46421 to 45245. [2019-10-02 13:31:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45245 states. [2019-10-02 13:31:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45245 states to 45245 states and 71261 transitions. [2019-10-02 13:31:48,207 INFO L78 Accepts]: Start accepts. Automaton has 45245 states and 71261 transitions. Word has length 316 [2019-10-02 13:31:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:48,207 INFO L475 AbstractCegarLoop]: Abstraction has 45245 states and 71261 transitions. [2019-10-02 13:31:48,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:31:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 45245 states and 71261 transitions. [2019-10-02 13:31:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 13:31:48,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:48,306 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:48,306 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2038041319, now seen corresponding path program 1 times [2019-10-02 13:31:48,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:48,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:31:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:31:48,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:31:48,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:31:48,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:31:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:31:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:31:48,528 INFO L87 Difference]: Start difference. First operand 45245 states and 71261 transitions. Second operand 8 states. [2019-10-02 13:31:54,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:31:54,624 INFO L93 Difference]: Finished difference Result 139575 states and 231251 transitions. [2019-10-02 13:31:54,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:31:54,625 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 353 [2019-10-02 13:31:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:31:55,009 INFO L225 Difference]: With dead ends: 139575 [2019-10-02 13:31:55,009 INFO L226 Difference]: Without dead ends: 94426 [2019-10-02 13:31:55,111 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:31:55,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94426 states. [2019-10-02 13:31:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94426 to 62813. [2019-10-02 13:31:58,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62813 states. [2019-10-02 13:31:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62813 states to 62813 states and 112317 transitions. [2019-10-02 13:31:58,635 INFO L78 Accepts]: Start accepts. Automaton has 62813 states and 112317 transitions. Word has length 353 [2019-10-02 13:31:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:31:58,635 INFO L475 AbstractCegarLoop]: Abstraction has 62813 states and 112317 transitions. [2019-10-02 13:31:58,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:31:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 62813 states and 112317 transitions. [2019-10-02 13:31:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-10-02 13:31:58,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:31:58,882 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:31:58,883 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:31:58,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:31:58,883 INFO L82 PathProgramCache]: Analyzing trace with hash 711297742, now seen corresponding path program 1 times [2019-10-02 13:31:58,883 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:31:58,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:31:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:31:58,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:31:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:32:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:32:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-02 13:32:01,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:32:01,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:32:01,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:32:01,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:32:01,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:32:01,358 INFO L87 Difference]: Start difference. First operand 62813 states and 112317 transitions. Second operand 10 states. [2019-10-02 13:32:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:32:03,590 INFO L93 Difference]: Finished difference Result 67889 states and 118367 transitions. [2019-10-02 13:32:03,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:32:03,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 380 [2019-10-02 13:32:03,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:32:03,599 INFO L225 Difference]: With dead ends: 67889 [2019-10-02 13:32:03,599 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 13:32:03,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:32:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 13:32:03,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 13:32:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 13:32:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 13:32:03,804 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 380 [2019-10-02 13:32:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:32:03,805 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 13:32:03,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:32:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 13:32:03,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 13:32:03,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 13:32:05,019 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2019-10-02 13:32:05,611 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 404 DAG size of output: 261 [2019-10-02 13:32:05,887 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 406 DAG size of output: 267 [2019-10-02 13:32:06,092 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 174 [2019-10-02 13:32:12,768 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:13,595 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:15,311 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:15,631 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:15,957 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:23,305 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 562 DAG size of output: 21 [2019-10-02 13:32:23,625 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:24,293 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:26,145 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:26,641 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:29,207 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:39,416 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-10-02 13:32:41,843 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:44,299 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:45,661 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 37 [2019-10-02 13:32:47,208 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:51,958 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-10-02 13:32:57,126 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:32:57,455 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:33:01,888 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 559 DAG size of output: 21 [2019-10-02 13:33:19,802 WARN L191 SmtUtils]: Spent 17.74 s on a formula simplification. DAG size of input: 1432 DAG size of output: 39 [2019-10-02 13:33:22,510 WARN L191 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 685 DAG size of output: 30 [2019-10-02 13:33:23,046 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 30 [2019-10-02 13:33:37,299 WARN L191 SmtUtils]: Spent 14.22 s on a formula simplification. DAG size of input: 1339 DAG size of output: 51 [2019-10-02 13:33:55,567 WARN L191 SmtUtils]: Spent 18.24 s on a formula simplification. DAG size of input: 1431 DAG size of output: 49 [2019-10-02 13:34:11,483 WARN L191 SmtUtils]: Spent 15.89 s on a formula simplification. DAG size of input: 1196 DAG size of output: 54 [2019-10-02 13:34:12,113 WARN L191 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 55 [2019-10-02 13:34:27,861 WARN L191 SmtUtils]: Spent 15.73 s on a formula simplification. DAG size of input: 1604 DAG size of output: 1 [2019-10-02 13:34:48,252 WARN L191 SmtUtils]: Spent 20.37 s on a formula simplification. DAG size of input: 1481 DAG size of output: 50 [2019-10-02 13:35:10,326 WARN L191 SmtUtils]: Spent 22.05 s on a formula simplification. DAG size of input: 1538 DAG size of output: 40 [2019-10-02 13:35:23,537 WARN L191 SmtUtils]: Spent 13.19 s on a formula simplification. DAG size of input: 1346 DAG size of output: 42 [2019-10-02 13:35:23,863 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 1 [2019-10-02 13:35:38,772 WARN L191 SmtUtils]: Spent 14.87 s on a formula simplification. DAG size of input: 1460 DAG size of output: 41 [2019-10-02 13:35:38,952 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:35:39,403 WARN L191 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 31 [2019-10-02 13:35:52,532 WARN L191 SmtUtils]: Spent 13.01 s on a formula simplification. DAG size of input: 1315 DAG size of output: 44 [2019-10-02 13:35:52,637 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:35:53,084 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 48 [2019-10-02 13:36:05,782 WARN L191 SmtUtils]: Spent 12.68 s on a formula simplification. DAG size of input: 1371 DAG size of output: 38 [2019-10-02 13:36:06,206 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 18 [2019-10-02 13:36:06,309 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:36:06,586 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:36:07,420 WARN L191 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 33 [2019-10-02 13:36:22,979 WARN L191 SmtUtils]: Spent 15.44 s on a formula simplification. DAG size of input: 1517 DAG size of output: 1 [2019-10-02 13:36:48,690 WARN L191 SmtUtils]: Spent 25.59 s on a formula simplification. DAG size of input: 2071 DAG size of output: 1 [2019-10-02 13:36:49,111 WARN L191 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 48 [2019-10-02 13:37:02,005 WARN L191 SmtUtils]: Spent 12.87 s on a formula simplification. DAG size of input: 1366 DAG size of output: 1 [2019-10-02 13:37:18,405 WARN L191 SmtUtils]: Spent 16.38 s on a formula simplification. DAG size of input: 1628 DAG size of output: 1 [2019-10-02 13:37:18,681 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 25 [2019-10-02 13:37:32,126 WARN L191 SmtUtils]: Spent 13.42 s on a formula simplification. DAG size of input: 1484 DAG size of output: 1 [2019-10-02 13:37:32,423 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 33 [2019-10-02 13:37:34,187 WARN L191 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 398 DAG size of output: 39 [2019-10-02 13:37:50,355 WARN L191 SmtUtils]: Spent 16.15 s on a formula simplification. DAG size of input: 1616 DAG size of output: 1 [2019-10-02 13:37:50,991 WARN L191 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 39 [2019-10-02 13:37:51,502 WARN L191 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 48 [2019-10-02 13:38:01,251 WARN L191 SmtUtils]: Spent 9.73 s on a formula simplification. DAG size of input: 1064 DAG size of output: 44 [2019-10-02 13:38:01,681 WARN L191 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 44 [2019-10-02 13:38:04,978 WARN L191 SmtUtils]: Spent 3.26 s on a formula simplification. DAG size of input: 223 DAG size of output: 50 [2019-10-02 13:38:07,436 WARN L191 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 485 DAG size of output: 57 [2019-10-02 13:38:23,865 WARN L191 SmtUtils]: Spent 16.40 s on a formula simplification. DAG size of input: 1628 DAG size of output: 1 [2019-10-02 13:38:23,968 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:38:24,070 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:38:26,490 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 485 DAG size of output: 57 [2019-10-02 13:38:26,592 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:38:27,482 WARN L191 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 488 DAG size of output: 1 [2019-10-02 13:38:29,166 WARN L191 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 172 DAG size of output: 42 [2019-10-02 13:38:29,267 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:38:30,008 WARN L191 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 37 [2019-10-02 13:38:30,117 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:38:50,513 WARN L191 SmtUtils]: Spent 20.37 s on a formula simplification. DAG size of input: 1481 DAG size of output: 50 [2019-10-02 13:39:20,747 WARN L191 SmtUtils]: Spent 30.20 s on a formula simplification. DAG size of input: 2257 DAG size of output: 1 [2019-10-02 13:39:33,351 WARN L191 SmtUtils]: Spent 12.59 s on a formula simplification. DAG size of input: 1332 DAG size of output: 42 [2019-10-02 13:39:33,466 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-10-02 13:39:34,355 WARN L191 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 488 DAG size of output: 1 [2019-10-02 13:39:35,138 WARN L191 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 1 [2019-10-02 13:39:35,344 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-02 13:39:37,222 WARN L191 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 392 DAG size of output: 44 [2019-10-02 13:39:52,006 WARN L191 SmtUtils]: Spent 14.76 s on a formula simplification. DAG size of input: 1429 DAG size of output: 16 [2019-10-02 13:39:53,560 WARN L191 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 172 DAG size of output: 42 [2019-10-02 13:40:07,398 WARN L191 SmtUtils]: Spent 13.74 s on a formula simplification. DAG size of input: 1422 DAG size of output: 34 [2019-10-02 13:40:10,627 WARN L191 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 223 DAG size of output: 50 [2019-10-02 13:40:12,235 WARN L191 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 491 DAG size of output: 30 [2019-10-02 13:40:32,747 WARN L191 SmtUtils]: Spent 20.49 s on a formula simplification. DAG size of input: 1481 DAG size of output: 50 [2019-10-02 13:40:33,017 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 25 [2019-10-02 13:40:33,360 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 33 [2019-10-02 13:40:51,792 WARN L191 SmtUtils]: Spent 18.33 s on a formula simplification. DAG size of input: 1431 DAG size of output: 49 [2019-10-02 13:40:52,210 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 48 [2019-10-02 13:41:05,409 WARN L191 SmtUtils]: Spent 13.12 s on a formula simplification. DAG size of input: 1442 DAG size of output: 1 [2019-10-02 13:41:19,697 WARN L191 SmtUtils]: Spent 14.27 s on a formula simplification. DAG size of input: 1339 DAG size of output: 51 [2019-10-02 13:41:19,970 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 29 [2019-10-02 13:41:33,189 WARN L191 SmtUtils]: Spent 13.20 s on a formula simplification. DAG size of input: 1393 DAG size of output: 42 [2019-10-02 13:41:44,713 WARN L191 SmtUtils]: Spent 11.44 s on a formula simplification. DAG size of input: 1368 DAG size of output: 1 [2019-10-02 13:41:45,120 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 48 [2019-10-02 13:42:01,241 WARN L191 SmtUtils]: Spent 15.97 s on a formula simplification. DAG size of input: 1397 DAG size of output: 32 [2019-10-02 13:42:01,565 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 1 [2019-10-02 13:42:02,100 WARN L191 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 36 [2019-10-02 13:42:15,432 WARN L191 SmtUtils]: Spent 13.31 s on a formula simplification. DAG size of input: 1346 DAG size of output: 42 [2019-10-02 13:42:29,589 WARN L191 SmtUtils]: Spent 14.14 s on a formula simplification. DAG size of input: 1449 DAG size of output: 33 [2019-10-02 13:42:47,377 WARN L191 SmtUtils]: Spent 17.77 s on a formula simplification. DAG size of input: 1552 DAG size of output: 37 [2019-10-02 13:43:05,346 WARN L191 SmtUtils]: Spent 17.95 s on a formula simplification. DAG size of input: 1584 DAG size of output: 37 [2019-10-02 13:43:18,193 WARN L191 SmtUtils]: Spent 12.83 s on a formula simplification. DAG size of input: 1465 DAG size of output: 1 [2019-10-02 13:43:18,748 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 38 [2019-10-02 13:43:18,849 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-10-02 13:43:31,996 WARN L191 SmtUtils]: Spent 13.12 s on a formula simplification. DAG size of input: 1442 DAG size of output: 1 [2019-10-02 13:43:32,255 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 29 [2019-10-02 13:43:46,695 WARN L191 SmtUtils]: Spent 14.41 s on a formula simplification. DAG size of input: 1339 DAG size of output: 51