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_spec1_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:53:30,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:53:30,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:53:30,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:53:30,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:53:30,566 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:53:30,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:53:30,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:53:30,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:53:30,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:53:30,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:53:30,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:53:30,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:53:30,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:53:30,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:53:30,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:53:30,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:53:30,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:53:30,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:53:30,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:53:30,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:53:30,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:53:30,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:53:30,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:53:30,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:53:30,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:53:30,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:53:30,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:53:30,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:53:30,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:53:30,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:53:30,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:53:30,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:53:30,628 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:53:30,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:53:30,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:53:30,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:53:30,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:53:30,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:53:30,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:53:30,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:53:30,637 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 12:53:30,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:53:30,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:53:30,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:53:30,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:53:30,664 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:53:30,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:53:30,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:53:30,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:53:30,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:53:30,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:53:30,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:53:30,667 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:53:30,667 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:53:30,668 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:53:30,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:53:30,668 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:53:30,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:53:30,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:53:30,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:53:30,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:53:30,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:53:30,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:53:30,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:53:30,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:53:30,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:53:30,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:53:30,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:53:30,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:53:30,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:53:30,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:53:30,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:53:30,755 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:53:30,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:53:30,758 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:53:30,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product22.cil.c [2019-10-02 12:53:30,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09ca9ef2/ac7f2dcecb8841609846da154b7b0dfa/FLAGe05cfbf9d [2019-10-02 12:53:31,462 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:53:31,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product22.cil.c [2019-10-02 12:53:31,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09ca9ef2/ac7f2dcecb8841609846da154b7b0dfa/FLAGe05cfbf9d [2019-10-02 12:53:31,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c09ca9ef2/ac7f2dcecb8841609846da154b7b0dfa [2019-10-02 12:53:31,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:53:31,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:53:31,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:53:31,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:53:31,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:53:31,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:53:31" (1/1) ... [2019-10-02 12:53:31,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24178ca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:31, skipping insertion in model container [2019-10-02 12:53:31,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:53:31" (1/1) ... [2019-10-02 12:53:31,692 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:53:31,786 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:53:32,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:53:32,661 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:53:32,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:53:32,862 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:53:32,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32 WrapperNode [2019-10-02 12:53:32,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:53:32,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:53:32,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:53:32,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:53:32,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:32,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:32,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:32,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:33,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:33,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:33,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (1/1) ... [2019-10-02 12:53:33,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:53:33,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:53:33,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:53:33,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:53:33,103 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (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 12:53:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:53:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:53:33,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:53:33,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:53:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:53:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:53:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:53:33,190 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:53:33,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:53:33,191 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:53:33,191 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:53:33,191 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:53:33,192 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:53:33,192 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:53:33,193 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:53:33,193 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:53:33,196 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:53:33,196 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:53:33,196 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:53:33,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:53:33,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:53:33,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:53:33,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:53:33,197 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:53:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:53:33,198 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:53:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:53:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:53:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:53:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:53:33,199 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:53:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:53:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:53:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:53:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:53:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:53:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:53:33,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:53:33,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:53:33,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:53:33,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:53:33,202 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:53:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:53:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:53:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:53:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:53:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:53:33,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:53:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:53:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:53:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:53:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:53:33,204 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:53:33,205 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:53:33,205 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:53:33,205 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:53:33,205 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:53:33,205 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:53:33,206 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:53:33,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:53:33,206 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:53:33,206 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:53:33,206 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:53:33,207 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:53:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:53:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:53:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:53:33,208 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:53:33,209 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:53:33,209 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:53:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:53:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:53:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:53:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:53:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:53:33,210 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:53:33,211 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:53:33,211 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:53:33,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:53:33,212 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:53:33,212 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:53:33,212 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:53:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:53:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:53:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:53:33,213 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:53:33,214 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:53:33,214 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:53:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:53:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:53:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:53:33,215 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:53:33,216 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:53:33,216 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:53:33,216 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-10-02 12:53:33,216 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:53:33,216 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:53:33,216 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:53:33,217 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:53:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:53:33,218 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:53:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:53:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:53:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:53:33,218 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:53:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:53:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:53:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:53:33,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:53:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:53:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:53:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:53:33,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:53:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:53:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:53:33,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:53:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:53:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:53:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:53:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:53:33,222 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:53:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:53:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:53:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:53:33,223 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:53:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:53:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:53:33,224 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:53:33,225 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:53:33,228 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:53:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:53:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:53:33,229 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:53:33,235 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:53:33,235 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:53:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:53:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:53:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:53:33,236 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:53:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:53:33,237 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:53:33,238 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:53:33,239 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:53:33,240 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:53:33,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:53:33,242 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:53:33,243 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:53:33,244 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:53:33,245 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:53:33,246 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:53:33,247 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-10-02 12:53:33,248 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:53:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:53:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:53:33,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:53:35,232 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:53:35,232 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:53:35,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:53:35 BoogieIcfgContainer [2019-10-02 12:53:35,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:53:35,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:53:35,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:53:35,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:53:35,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:53:31" (1/3) ... [2019-10-02 12:53:35,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15132f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:53:35, skipping insertion in model container [2019-10-02 12:53:35,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:53:32" (2/3) ... [2019-10-02 12:53:35,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15132f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:53:35, skipping insertion in model container [2019-10-02 12:53:35,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:53:35" (3/3) ... [2019-10-02 12:53:35,244 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product22.cil.c [2019-10-02 12:53:35,256 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:53:35,272 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:53:35,291 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:53:35,342 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:53:35,343 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:53:35,343 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:53:35,343 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:53:35,343 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:53:35,343 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:53:35,343 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:53:35,344 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:53:35,344 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:53:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states. [2019-10-02 12:53:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:53:35,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:35,428 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:35,432 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:35,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:35,439 INFO L82 PathProgramCache]: Analyzing trace with hash -262488185, now seen corresponding path program 1 times [2019-10-02 12:53:35,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:35,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:36,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:36,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:36,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:53:36,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:53:36,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:53:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:53:36,165 INFO L87 Difference]: Start difference. First operand 508 states. Second operand 2 states. [2019-10-02 12:53:36,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:36,285 INFO L93 Difference]: Finished difference Result 747 states and 983 transitions. [2019-10-02 12:53:36,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:53:36,287 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-10-02 12:53:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:36,327 INFO L225 Difference]: With dead ends: 747 [2019-10-02 12:53:36,327 INFO L226 Difference]: Without dead ends: 485 [2019-10-02 12:53:36,339 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 12:53:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-02 12:53:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-10-02 12:53:36,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-02 12:53:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 643 transitions. [2019-10-02 12:53:36,522 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 643 transitions. Word has length 145 [2019-10-02 12:53:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:36,525 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 643 transitions. [2019-10-02 12:53:36,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:53:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 643 transitions. [2019-10-02 12:53:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:53:36,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:36,539 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:36,540 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1163189320, now seen corresponding path program 1 times [2019-10-02 12:53:36,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:36,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:36,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:36,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:36,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:36,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:36,899 INFO L87 Difference]: Start difference. First operand 485 states and 643 transitions. Second operand 3 states. [2019-10-02 12:53:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:36,981 INFO L93 Difference]: Finished difference Result 730 states and 952 transitions. [2019-10-02 12:53:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:36,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-02 12:53:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:36,990 INFO L225 Difference]: With dead ends: 730 [2019-10-02 12:53:36,990 INFO L226 Difference]: Without dead ends: 488 [2019-10-02 12:53:36,998 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 12:53:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-10-02 12:53:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 487. [2019-10-02 12:53:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-10-02 12:53:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 645 transitions. [2019-10-02 12:53:37,034 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 645 transitions. Word has length 146 [2019-10-02 12:53:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:37,035 INFO L475 AbstractCegarLoop]: Abstraction has 487 states and 645 transitions. [2019-10-02 12:53:37,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 645 transitions. [2019-10-02 12:53:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:53:37,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:37,041 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:37,041 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:37,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash -180533913, now seen corresponding path program 1 times [2019-10-02 12:53:37,042 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:37,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:37,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:37,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:37,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:37,265 INFO L87 Difference]: Start difference. First operand 487 states and 645 transitions. Second operand 3 states. [2019-10-02 12:53:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:37,304 INFO L93 Difference]: Finished difference Result 952 states and 1291 transitions. [2019-10-02 12:53:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:37,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-10-02 12:53:37,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:37,313 INFO L225 Difference]: With dead ends: 952 [2019-10-02 12:53:37,313 INFO L226 Difference]: Without dead ends: 530 [2019-10-02 12:53:37,315 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 12:53:37,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-02 12:53:37,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2019-10-02 12:53:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-10-02 12:53:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 717 transitions. [2019-10-02 12:53:37,349 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 717 transitions. Word has length 158 [2019-10-02 12:53:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:37,350 INFO L475 AbstractCegarLoop]: Abstraction has 529 states and 717 transitions. [2019-10-02 12:53:37,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 717 transitions. [2019-10-02 12:53:37,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:53:37,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:37,358 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:37,358 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:37,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 541479896, now seen corresponding path program 1 times [2019-10-02 12:53:37,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:37,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:37,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:37,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:37,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:37,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:37,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:37,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:37,579 INFO L87 Difference]: Start difference. First operand 529 states and 717 transitions. Second operand 3 states. [2019-10-02 12:53:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:37,616 INFO L93 Difference]: Finished difference Result 1075 states and 1502 transitions. [2019-10-02 12:53:37,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:37,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 12:53:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:37,622 INFO L225 Difference]: With dead ends: 1075 [2019-10-02 12:53:37,622 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:53:37,624 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 12:53:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:53:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 610. [2019-10-02 12:53:37,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 12:53:37,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 855 transitions. [2019-10-02 12:53:37,671 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 855 transitions. Word has length 159 [2019-10-02 12:53:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:37,671 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 855 transitions. [2019-10-02 12:53:37,671 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 855 transitions. [2019-10-02 12:53:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:53:37,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:37,676 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:37,676 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1088431641, now seen corresponding path program 1 times [2019-10-02 12:53:37,677 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:37,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:37,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:37,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:37,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:37,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:37,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:37,808 INFO L87 Difference]: Start difference. First operand 610 states and 855 transitions. Second operand 3 states. [2019-10-02 12:53:37,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:37,858 INFO L93 Difference]: Finished difference Result 1312 states and 1906 transitions. [2019-10-02 12:53:37,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:37,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-10-02 12:53:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:37,864 INFO L225 Difference]: With dead ends: 1312 [2019-10-02 12:53:37,864 INFO L226 Difference]: Without dead ends: 767 [2019-10-02 12:53:37,867 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 12:53:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-10-02 12:53:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 766. [2019-10-02 12:53:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-02 12:53:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1119 transitions. [2019-10-02 12:53:37,903 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1119 transitions. Word has length 160 [2019-10-02 12:53:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:37,903 INFO L475 AbstractCegarLoop]: Abstraction has 766 states and 1119 transitions. [2019-10-02 12:53:37,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1119 transitions. [2019-10-02 12:53:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:53:37,908 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:37,908 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:37,908 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1690260276, now seen corresponding path program 1 times [2019-10-02 12:53:37,909 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:37,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:53:39,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:39,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2019-10-02 12:53:39,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 12:53:39,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 12:53:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1105, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:53:39,209 INFO L87 Difference]: Start difference. First operand 766 states and 1119 transitions. Second operand 35 states. [2019-10-02 12:53:44,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:44,815 INFO L93 Difference]: Finished difference Result 2240 states and 3350 transitions. [2019-10-02 12:53:44,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 12:53:44,815 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2019-10-02 12:53:44,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:44,830 INFO L225 Difference]: With dead ends: 2240 [2019-10-02 12:53:44,830 INFO L226 Difference]: Without dead ends: 1506 [2019-10-02 12:53:44,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=298, Invalid=4124, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 12:53:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2019-10-02 12:53:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1239. [2019-10-02 12:53:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-10-02 12:53:44,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1916 transitions. [2019-10-02 12:53:44,928 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1916 transitions. Word has length 162 [2019-10-02 12:53:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:44,931 INFO L475 AbstractCegarLoop]: Abstraction has 1239 states and 1916 transitions. [2019-10-02 12:53:44,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 12:53:44,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1916 transitions. [2019-10-02 12:53:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:53:44,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:44,940 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:53:44,940 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:44,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:44,941 INFO L82 PathProgramCache]: Analyzing trace with hash 490161090, now seen corresponding path program 1 times [2019-10-02 12:53:44,941 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:44,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:44,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:44,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:44,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:53:45,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:45,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:45,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:45,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:45,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:45,150 INFO L87 Difference]: Start difference. First operand 1239 states and 1916 transitions. Second operand 3 states. [2019-10-02 12:53:45,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:45,236 INFO L93 Difference]: Finished difference Result 3000 states and 4794 transitions. [2019-10-02 12:53:45,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:45,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-02 12:53:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:45,249 INFO L225 Difference]: With dead ends: 3000 [2019-10-02 12:53:45,249 INFO L226 Difference]: Without dead ends: 1840 [2019-10-02 12:53:45,254 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 12:53:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2019-10-02 12:53:45,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1839. [2019-10-02 12:53:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1839 states. [2019-10-02 12:53:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2952 transitions. [2019-10-02 12:53:45,356 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2952 transitions. Word has length 162 [2019-10-02 12:53:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:45,357 INFO L475 AbstractCegarLoop]: Abstraction has 1839 states and 2952 transitions. [2019-10-02 12:53:45,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2952 transitions. [2019-10-02 12:53:45,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:53:45,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:45,368 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 12:53:45,368 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:45,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash -449351993, now seen corresponding path program 1 times [2019-10-02 12:53:45,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:45,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:45,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:46,097 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:53:46,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:53:46,097 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 12:53:46,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:46,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:53:46,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:53:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 12:53:46,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:53:46,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [31] total 35 [2019-10-02 12:53:46,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 12:53:46,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 12:53:46,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1102, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:53:46,934 INFO L87 Difference]: Start difference. First operand 1839 states and 2952 transitions. Second operand 35 states. [2019-10-02 12:53:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:52,258 INFO L93 Difference]: Finished difference Result 3900 states and 6211 transitions. [2019-10-02 12:53:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-02 12:53:52,264 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 164 [2019-10-02 12:53:52,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:52,281 INFO L225 Difference]: With dead ends: 3900 [2019-10-02 12:53:52,281 INFO L226 Difference]: Without dead ends: 2112 [2019-10-02 12:53:52,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=295, Invalid=3865, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 12:53:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2019-10-02 12:53:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1843. [2019-10-02 12:53:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-10-02 12:53:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2957 transitions. [2019-10-02 12:53:52,473 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2957 transitions. Word has length 164 [2019-10-02 12:53:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:52,474 INFO L475 AbstractCegarLoop]: Abstraction has 1843 states and 2957 transitions. [2019-10-02 12:53:52,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 12:53:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2957 transitions. [2019-10-02 12:53:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:53:52,485 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:52,485 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:53:52,486 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:52,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:52,486 INFO L82 PathProgramCache]: Analyzing trace with hash 925448506, now seen corresponding path program 1 times [2019-10-02 12:53:52,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:52,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:53,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:53:53,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:53,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:53:53,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:53:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:53:53,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:53:53,261 INFO L87 Difference]: Start difference. First operand 1843 states and 2957 transitions. Second operand 26 states. [2019-10-02 12:54:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:01,746 INFO L93 Difference]: Finished difference Result 4632 states and 7133 transitions. [2019-10-02 12:54:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:54:01,746 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 165 [2019-10-02 12:54:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:01,775 INFO L225 Difference]: With dead ends: 4632 [2019-10-02 12:54:01,776 INFO L226 Difference]: Without dead ends: 4399 [2019-10-02 12:54:01,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:54:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4399 states. [2019-10-02 12:54:02,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4399 to 3874. [2019-10-02 12:54:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3874 states. [2019-10-02 12:54:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 6175 transitions. [2019-10-02 12:54:02,032 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 6175 transitions. Word has length 165 [2019-10-02 12:54:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:02,033 INFO L475 AbstractCegarLoop]: Abstraction has 3874 states and 6175 transitions. [2019-10-02 12:54:02,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:54:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 6175 transitions. [2019-10-02 12:54:02,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:54:02,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:02,055 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:02,055 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:02,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1359879993, now seen corresponding path program 1 times [2019-10-02 12:54:02,056 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:02,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:02,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:02,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:02,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:54:02,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:54:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:54:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:54:02,298 INFO L87 Difference]: Start difference. First operand 3874 states and 6175 transitions. Second operand 10 states. [2019-10-02 12:54:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:02,613 INFO L93 Difference]: Finished difference Result 4609 states and 7133 transitions. [2019-10-02 12:54:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:54:02,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2019-10-02 12:54:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:02,643 INFO L225 Difference]: With dead ends: 4609 [2019-10-02 12:54:02,643 INFO L226 Difference]: Without dead ends: 3905 [2019-10-02 12:54:02,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:54:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3905 states. [2019-10-02 12:54:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3905 to 3900. [2019-10-02 12:54:02,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3900 states. [2019-10-02 12:54:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 6214 transitions. [2019-10-02 12:54:02,961 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 6214 transitions. Word has length 166 [2019-10-02 12:54:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:02,961 INFO L475 AbstractCegarLoop]: Abstraction has 3900 states and 6214 transitions. [2019-10-02 12:54:02,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:54:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 6214 transitions. [2019-10-02 12:54:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:54:02,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:02,980 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:02,980 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:02,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:02,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1756664070, now seen corresponding path program 1 times [2019-10-02 12:54:02,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:02,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:02,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:03,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:03,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:54:03,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:54:03,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:54:03,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:54:03,267 INFO L87 Difference]: Start difference. First operand 3900 states and 6214 transitions. Second operand 9 states. [2019-10-02 12:54:03,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:03,589 INFO L93 Difference]: Finished difference Result 4616 states and 7144 transitions. [2019-10-02 12:54:03,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:54:03,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-10-02 12:54:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:03,614 INFO L225 Difference]: With dead ends: 4616 [2019-10-02 12:54:03,614 INFO L226 Difference]: Without dead ends: 3906 [2019-10-02 12:54:03,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:54:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-10-02 12:54:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3906. [2019-10-02 12:54:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3906 states. [2019-10-02 12:54:03,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 6221 transitions. [2019-10-02 12:54:03,833 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 6221 transitions. Word has length 166 [2019-10-02 12:54:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:03,834 INFO L475 AbstractCegarLoop]: Abstraction has 3906 states and 6221 transitions. [2019-10-02 12:54:03,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:54:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 6221 transitions. [2019-10-02 12:54:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:54:03,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:03,851 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:03,851 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:03,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1089317603, now seen corresponding path program 1 times [2019-10-02 12:54:03,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:03,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:03,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:03,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:03,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:54:03,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:54:03,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:54:03,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:03,989 INFO L87 Difference]: Start difference. First operand 3906 states and 6221 transitions. Second operand 5 states. [2019-10-02 12:54:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:05,382 INFO L93 Difference]: Finished difference Result 7631 states and 11850 transitions. [2019-10-02 12:54:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:54:05,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 166 [2019-10-02 12:54:05,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:05,442 INFO L225 Difference]: With dead ends: 7631 [2019-10-02 12:54:05,442 INFO L226 Difference]: Without dead ends: 6915 [2019-10-02 12:54:05,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:54:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6915 states. [2019-10-02 12:54:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6915 to 6132. [2019-10-02 12:54:05,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2019-10-02 12:54:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 9503 transitions. [2019-10-02 12:54:05,780 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 9503 transitions. Word has length 166 [2019-10-02 12:54:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:05,782 INFO L475 AbstractCegarLoop]: Abstraction has 6132 states and 9503 transitions. [2019-10-02 12:54:05,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:54:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 9503 transitions. [2019-10-02 12:54:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:54:05,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:05,805 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:05,805 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -920786238, now seen corresponding path program 1 times [2019-10-02 12:54:05,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:05,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:05,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:05,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:54:05,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:05,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:54:05,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:54:05,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:54:05,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:54:05,966 INFO L87 Difference]: Start difference. First operand 6132 states and 9503 transitions. Second operand 9 states. [2019-10-02 12:54:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:06,375 INFO L93 Difference]: Finished difference Result 6622 states and 10130 transitions. [2019-10-02 12:54:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:54:06,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 166 [2019-10-02 12:54:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:06,392 INFO L225 Difference]: With dead ends: 6622 [2019-10-02 12:54:06,392 INFO L226 Difference]: Without dead ends: 2353 [2019-10-02 12:54:06,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-10-02 12:54:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2351. [2019-10-02 12:54:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-10-02 12:54:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3610 transitions. [2019-10-02 12:54:06,525 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3610 transitions. Word has length 166 [2019-10-02 12:54:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:06,526 INFO L475 AbstractCegarLoop]: Abstraction has 2351 states and 3610 transitions. [2019-10-02 12:54:06,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:54:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3610 transitions. [2019-10-02 12:54:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:54:06,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:06,535 INFO L411 BasicCegarLoop]: trace histogram [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 12:54:06,535 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1797759892, now seen corresponding path program 2 times [2019-10-02 12:54:06,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:06,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:07,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:07,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:54:07,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:54:07,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:54:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:54:07,106 INFO L87 Difference]: Start difference. First operand 2351 states and 3610 transitions. Second operand 24 states. [2019-10-02 12:54:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:15,595 INFO L93 Difference]: Finished difference Result 8605 states and 13088 transitions. [2019-10-02 12:54:15,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:54:15,596 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 166 [2019-10-02 12:54:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:15,628 INFO L225 Difference]: With dead ends: 8605 [2019-10-02 12:54:15,629 INFO L226 Difference]: Without dead ends: 7941 [2019-10-02 12:54:15,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:54:15,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2019-10-02 12:54:16,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 6127. [2019-10-02 12:54:16,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6127 states. [2019-10-02 12:54:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 9495 transitions. [2019-10-02 12:54:16,107 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 9495 transitions. Word has length 166 [2019-10-02 12:54:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:16,107 INFO L475 AbstractCegarLoop]: Abstraction has 6127 states and 9495 transitions. [2019-10-02 12:54:16,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:54:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 9495 transitions. [2019-10-02 12:54:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:54:16,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:16,128 INFO L411 BasicCegarLoop]: trace histogram [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 12:54:16,128 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash 559099344, now seen corresponding path program 2 times [2019-10-02 12:54:16,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:16,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:16,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:54:16,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:54:16,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:54:16,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:54:16,265 INFO L87 Difference]: Start difference. First operand 6127 states and 9495 transitions. Second operand 7 states. [2019-10-02 12:54:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:16,558 INFO L93 Difference]: Finished difference Result 6617 states and 10122 transitions. [2019-10-02 12:54:16,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:54:16,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2019-10-02 12:54:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:16,567 INFO L225 Difference]: With dead ends: 6617 [2019-10-02 12:54:16,567 INFO L226 Difference]: Without dead ends: 2353 [2019-10-02 12:54:16,584 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:54:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-10-02 12:54:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2351. [2019-10-02 12:54:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-10-02 12:54:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3609 transitions. [2019-10-02 12:54:16,714 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3609 transitions. Word has length 167 [2019-10-02 12:54:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:16,715 INFO L475 AbstractCegarLoop]: Abstraction has 2351 states and 3609 transitions. [2019-10-02 12:54:16,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:54:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3609 transitions. [2019-10-02 12:54:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:54:16,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:16,726 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:16,727 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1752424443, now seen corresponding path program 3 times [2019-10-02 12:54:16,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:16,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:16,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:16,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:17,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:17,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:54:17,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:54:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:54:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:54:17,306 INFO L87 Difference]: Start difference. First operand 2351 states and 3609 transitions. Second operand 26 states. [2019-10-02 12:54:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:25,341 INFO L93 Difference]: Finished difference Result 8612 states and 13095 transitions. [2019-10-02 12:54:25,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:54:25,341 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 167 [2019-10-02 12:54:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:25,367 INFO L225 Difference]: With dead ends: 8612 [2019-10-02 12:54:25,367 INFO L226 Difference]: Without dead ends: 7948 [2019-10-02 12:54:25,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:54:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7948 states. [2019-10-02 12:54:25,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7948 to 6132. [2019-10-02 12:54:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6132 states. [2019-10-02 12:54:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6132 states to 6132 states and 9500 transitions. [2019-10-02 12:54:25,792 INFO L78 Accepts]: Start accepts. Automaton has 6132 states and 9500 transitions. Word has length 167 [2019-10-02 12:54:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:25,792 INFO L475 AbstractCegarLoop]: Abstraction has 6132 states and 9500 transitions. [2019-10-02 12:54:25,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:54:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 6132 states and 9500 transitions. [2019-10-02 12:54:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:54:25,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:25,820 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:25,820 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:25,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:25,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1054335967, now seen corresponding path program 3 times [2019-10-02 12:54:25,821 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:25,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:25,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:25,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:25,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:25,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:25,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:54:25,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:54:25,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:54:25,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:54:25,970 INFO L87 Difference]: Start difference. First operand 6132 states and 9500 transitions. Second operand 9 states. [2019-10-02 12:54:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:26,273 INFO L93 Difference]: Finished difference Result 6624 states and 10129 transitions. [2019-10-02 12:54:26,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:54:26,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2019-10-02 12:54:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:26,284 INFO L225 Difference]: With dead ends: 6624 [2019-10-02 12:54:26,284 INFO L226 Difference]: Without dead ends: 2355 [2019-10-02 12:54:26,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2355 states. [2019-10-02 12:54:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2355 to 2351. [2019-10-02 12:54:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-10-02 12:54:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 3608 transitions. [2019-10-02 12:54:26,448 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 3608 transitions. Word has length 168 [2019-10-02 12:54:26,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:26,448 INFO L475 AbstractCegarLoop]: Abstraction has 2351 states and 3608 transitions. [2019-10-02 12:54:26,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:54:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 3608 transitions. [2019-10-02 12:54:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:54:26,457 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:26,457 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:26,457 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:26,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1314471800, now seen corresponding path program 1 times [2019-10-02 12:54:26,458 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:26,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:26,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:54:26,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:26,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:26,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:54:26,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:54:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:54:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:54:26,921 INFO L87 Difference]: Start difference. First operand 2351 states and 3608 transitions. Second operand 24 states. [2019-10-02 12:54:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:35,342 INFO L93 Difference]: Finished difference Result 10217 states and 15795 transitions. [2019-10-02 12:54:35,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 12:54:35,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 168 [2019-10-02 12:54:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:35,374 INFO L225 Difference]: With dead ends: 10217 [2019-10-02 12:54:35,374 INFO L226 Difference]: Without dead ends: 7955 [2019-10-02 12:54:35,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 12:54:35,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7955 states. [2019-10-02 12:54:35,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7955 to 6129. [2019-10-02 12:54:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-10-02 12:54:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 9497 transitions. [2019-10-02 12:54:35,846 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 9497 transitions. Word has length 168 [2019-10-02 12:54:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:35,847 INFO L475 AbstractCegarLoop]: Abstraction has 6129 states and 9497 transitions. [2019-10-02 12:54:35,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:54:35,847 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 9497 transitions. [2019-10-02 12:54:35,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:54:35,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:35,860 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:35,861 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1638838988, now seen corresponding path program 1 times [2019-10-02 12:54:35,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:35,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:35,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:35,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:54:35,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:35,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:54:35,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:54:35,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:54:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:54:36,001 INFO L87 Difference]: Start difference. First operand 6129 states and 9497 transitions. Second operand 7 states. [2019-10-02 12:54:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:36,261 INFO L93 Difference]: Finished difference Result 6623 states and 10129 transitions. [2019-10-02 12:54:36,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:54:36,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 169 [2019-10-02 12:54:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:36,269 INFO L225 Difference]: With dead ends: 6623 [2019-10-02 12:54:36,270 INFO L226 Difference]: Without dead ends: 2359 [2019-10-02 12:54:36,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:54:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-10-02 12:54:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2353. [2019-10-02 12:54:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2353 states. [2019-10-02 12:54:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 3611 transitions. [2019-10-02 12:54:36,418 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 3611 transitions. Word has length 169 [2019-10-02 12:54:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:36,418 INFO L475 AbstractCegarLoop]: Abstraction has 2353 states and 3611 transitions. [2019-10-02 12:54:36,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:54:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 3611 transitions. [2019-10-02 12:54:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:54:36,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:36,425 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:36,425 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:36,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:36,426 INFO L82 PathProgramCache]: Analyzing trace with hash -516764614, now seen corresponding path program 1 times [2019-10-02 12:54:36,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:36,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:36,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:36,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:36,738 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 12:54:36,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:36,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:54:36,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:54:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:54:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:54:36,739 INFO L87 Difference]: Start difference. First operand 2353 states and 3611 transitions. Second operand 18 states. [2019-10-02 12:54:41,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:41,119 INFO L93 Difference]: Finished difference Result 5052 states and 7516 transitions. [2019-10-02 12:54:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:54:41,120 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 169 [2019-10-02 12:54:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:41,132 INFO L225 Difference]: With dead ends: 5052 [2019-10-02 12:54:41,133 INFO L226 Difference]: Without dead ends: 4388 [2019-10-02 12:54:41,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:54:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4388 states. [2019-10-02 12:54:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4388 to 4346. [2019-10-02 12:54:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4346 states. [2019-10-02 12:54:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4346 states to 4346 states and 6605 transitions. [2019-10-02 12:54:41,464 INFO L78 Accepts]: Start accepts. Automaton has 4346 states and 6605 transitions. Word has length 169 [2019-10-02 12:54:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:41,465 INFO L475 AbstractCegarLoop]: Abstraction has 4346 states and 6605 transitions. [2019-10-02 12:54:41,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:54:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4346 states and 6605 transitions. [2019-10-02 12:54:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:54:41,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:41,474 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:54:41,476 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1615247298, now seen corresponding path program 1 times [2019-10-02 12:54:41,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:41,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:41,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:41,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:41,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:54:41,596 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 12:54:41,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:42,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 2451 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:54:42,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:54:42,119 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:42,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:54:42,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:54:42,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:54:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:54:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:42,128 INFO L87 Difference]: Start difference. First operand 4346 states and 6605 transitions. Second operand 5 states. [2019-10-02 12:54:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:42,363 INFO L93 Difference]: Finished difference Result 6405 states and 9300 transitions. [2019-10-02 12:54:42,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:54:42,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-10-02 12:54:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:42,376 INFO L225 Difference]: With dead ends: 6405 [2019-10-02 12:54:42,377 INFO L226 Difference]: Without dead ends: 4433 [2019-10-02 12:54:42,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:54:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2019-10-02 12:54:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4421. [2019-10-02 12:54:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4421 states. [2019-10-02 12:54:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4421 states to 4421 states and 6718 transitions. [2019-10-02 12:54:42,707 INFO L78 Accepts]: Start accepts. Automaton has 4421 states and 6718 transitions. Word has length 170 [2019-10-02 12:54:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:42,708 INFO L475 AbstractCegarLoop]: Abstraction has 4421 states and 6718 transitions. [2019-10-02 12:54:42,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:54:42,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4421 states and 6718 transitions. [2019-10-02 12:54:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:54:42,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:42,717 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:42,718 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:42,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:42,718 INFO L82 PathProgramCache]: Analyzing trace with hash 470355602, now seen corresponding path program 1 times [2019-10-02 12:54:42,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:42,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:42,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:42,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:42,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:42,819 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:42,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:42,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:42,821 INFO L87 Difference]: Start difference. First operand 4421 states and 6718 transitions. Second operand 3 states. [2019-10-02 12:54:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:43,188 INFO L93 Difference]: Finished difference Result 10447 states and 16356 transitions. [2019-10-02 12:54:43,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:43,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 12:54:43,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:43,205 INFO L225 Difference]: With dead ends: 10447 [2019-10-02 12:54:43,205 INFO L226 Difference]: Without dead ends: 6158 [2019-10-02 12:54:43,217 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 12:54:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2019-10-02 12:54:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6155. [2019-10-02 12:54:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6155 states. [2019-10-02 12:54:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6155 states to 6155 states and 9747 transitions. [2019-10-02 12:54:43,504 INFO L78 Accepts]: Start accepts. Automaton has 6155 states and 9747 transitions. Word has length 169 [2019-10-02 12:54:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:43,504 INFO L475 AbstractCegarLoop]: Abstraction has 6155 states and 9747 transitions. [2019-10-02 12:54:43,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6155 states and 9747 transitions. [2019-10-02 12:54:43,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:54:43,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:43,516 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:43,516 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:43,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:43,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1020288295, now seen corresponding path program 1 times [2019-10-02 12:54:43,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:43,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:43,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:43,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:43,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:43,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:43,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:43,654 INFO L87 Difference]: Start difference. First operand 6155 states and 9747 transitions. Second operand 3 states. [2019-10-02 12:54:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:44,015 INFO L93 Difference]: Finished difference Result 15485 states and 25230 transitions. [2019-10-02 12:54:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:44,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 12:54:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:44,039 INFO L225 Difference]: With dead ends: 15485 [2019-10-02 12:54:44,039 INFO L226 Difference]: Without dead ends: 9472 [2019-10-02 12:54:44,050 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 12:54:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9472 states. [2019-10-02 12:54:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9472 to 9469. [2019-10-02 12:54:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9469 states. [2019-10-02 12:54:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9469 states to 9469 states and 15556 transitions. [2019-10-02 12:54:44,599 INFO L78 Accepts]: Start accepts. Automaton has 9469 states and 15556 transitions. Word has length 170 [2019-10-02 12:54:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:44,599 INFO L475 AbstractCegarLoop]: Abstraction has 9469 states and 15556 transitions. [2019-10-02 12:54:44,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 9469 states and 15556 transitions. [2019-10-02 12:54:44,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:54:44,616 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:44,616 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:54:44,616 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash -680610094, now seen corresponding path program 1 times [2019-10-02 12:54:44,617 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:44,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:44,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:44,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:44,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:44,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:44,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:44,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:44,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:44,733 INFO L87 Difference]: Start difference. First operand 9469 states and 15556 transitions. Second operand 3 states. [2019-10-02 12:54:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:45,392 INFO L93 Difference]: Finished difference Result 25131 states and 42168 transitions. [2019-10-02 12:54:45,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:45,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 12:54:45,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:45,435 INFO L225 Difference]: With dead ends: 25131 [2019-10-02 12:54:45,435 INFO L226 Difference]: Without dead ends: 15810 [2019-10-02 12:54:45,455 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 12:54:45,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15810 states. [2019-10-02 12:54:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15810 to 15807. [2019-10-02 12:54:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15807 states. [2019-10-02 12:54:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15807 states to 15807 states and 26597 transitions. [2019-10-02 12:54:47,176 INFO L78 Accepts]: Start accepts. Automaton has 15807 states and 26597 transitions. Word has length 171 [2019-10-02 12:54:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:47,176 INFO L475 AbstractCegarLoop]: Abstraction has 15807 states and 26597 transitions. [2019-10-02 12:54:47,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 15807 states and 26597 transitions. [2019-10-02 12:54:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:54:47,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:47,203 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:54:47,203 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 712935655, now seen corresponding path program 1 times [2019-10-02 12:54:47,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:47,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:47,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:47,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:47,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:47,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:47,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:47,327 INFO L87 Difference]: Start difference. First operand 15807 states and 26597 transitions. Second operand 3 states. [2019-10-02 12:54:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:48,468 INFO L93 Difference]: Finished difference Result 44331 states and 75477 transitions. [2019-10-02 12:54:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:48,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 12:54:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:48,575 INFO L225 Difference]: With dead ends: 44331 [2019-10-02 12:54:48,575 INFO L226 Difference]: Without dead ends: 28676 [2019-10-02 12:54:48,624 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 12:54:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28676 states. [2019-10-02 12:54:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28676 to 28673. [2019-10-02 12:54:50,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28673 states. [2019-10-02 12:54:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28673 states to 28673 states and 48678 transitions. [2019-10-02 12:54:50,110 INFO L78 Accepts]: Start accepts. Automaton has 28673 states and 48678 transitions. Word has length 172 [2019-10-02 12:54:50,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:50,110 INFO L475 AbstractCegarLoop]: Abstraction has 28673 states and 48678 transitions. [2019-10-02 12:54:50,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28673 states and 48678 transitions. [2019-10-02 12:54:50,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:54:50,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:50,138 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:50,138 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:50,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:50,138 INFO L82 PathProgramCache]: Analyzing trace with hash 907917074, now seen corresponding path program 1 times [2019-10-02 12:54:50,138 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:50,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:50,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:50,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:50,259 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:50,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:50,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:50,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:50,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:50,261 INFO L87 Difference]: Start difference. First operand 28673 states and 48678 transitions. Second operand 3 states. [2019-10-02 12:54:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:53,396 INFO L93 Difference]: Finished difference Result 81003 states and 137871 transitions. [2019-10-02 12:54:53,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:54:53,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-02 12:54:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:53,512 INFO L225 Difference]: With dead ends: 81003 [2019-10-02 12:54:53,513 INFO L226 Difference]: Without dead ends: 52490 [2019-10-02 12:54:53,559 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 12:54:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52490 states. [2019-10-02 12:54:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52490 to 52487. [2019-10-02 12:54:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52487 states. [2019-10-02 12:54:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52487 states to 52487 states and 88619 transitions. [2019-10-02 12:54:55,965 INFO L78 Accepts]: Start accepts. Automaton has 52487 states and 88619 transitions. Word has length 173 [2019-10-02 12:54:55,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:55,965 INFO L475 AbstractCegarLoop]: Abstraction has 52487 states and 88619 transitions. [2019-10-02 12:54:55,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:54:55,965 INFO L276 IsEmpty]: Start isEmpty. Operand 52487 states and 88619 transitions. [2019-10-02 12:54:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:54:55,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:55,997 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:54:55,997 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash -592560731, now seen corresponding path program 1 times [2019-10-02 12:54:55,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:55,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:56,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:56,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:54:56,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:54:56,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:54:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:54:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:54:56,093 INFO L87 Difference]: Start difference. First operand 52487 states and 88619 transitions. Second operand 3 states. [2019-10-02 12:55:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:00,128 INFO L93 Difference]: Finished difference Result 150121 states and 254601 transitions. [2019-10-02 12:55:00,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:00,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-02 12:55:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:00,445 INFO L225 Difference]: With dead ends: 150121 [2019-10-02 12:55:00,446 INFO L226 Difference]: Without dead ends: 97804 [2019-10-02 12:55:00,531 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 12:55:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97804 states. [2019-10-02 12:55:08,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97804 to 97801. [2019-10-02 12:55:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97801 states. [2019-10-02 12:55:08,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97801 states to 97801 states and 164652 transitions. [2019-10-02 12:55:08,281 INFO L78 Accepts]: Start accepts. Automaton has 97801 states and 164652 transitions. Word has length 174 [2019-10-02 12:55:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:08,282 INFO L475 AbstractCegarLoop]: Abstraction has 97801 states and 164652 transitions. [2019-10-02 12:55:08,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 97801 states and 164652 transitions. [2019-10-02 12:55:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:55:08,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:08,324 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:55:08,324 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash -399102190, now seen corresponding path program 1 times [2019-10-02 12:55:08,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:08,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:08,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:08,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:55:08,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:08,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:08,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:08,422 INFO L87 Difference]: Start difference. First operand 97801 states and 164652 transitions. Second operand 3 states. [2019-10-02 12:55:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:19,393 INFO L93 Difference]: Finished difference Result 185780 states and 310047 transitions. [2019-10-02 12:55:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:19,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 12:55:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:19,834 INFO L225 Difference]: With dead ends: 185780 [2019-10-02 12:55:19,834 INFO L226 Difference]: Without dead ends: 183808 [2019-10-02 12:55:19,878 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183808 states. [2019-10-02 12:55:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183808 to 183805. [2019-10-02 12:55:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183805 states. [2019-10-02 12:55:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183805 states to 183805 states and 304412 transitions. [2019-10-02 12:55:32,249 INFO L78 Accepts]: Start accepts. Automaton has 183805 states and 304412 transitions. Word has length 175 [2019-10-02 12:55:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:32,249 INFO L475 AbstractCegarLoop]: Abstraction has 183805 states and 304412 transitions. [2019-10-02 12:55:32,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 183805 states and 304412 transitions. [2019-10-02 12:55:32,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:55:32,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:55:32,295 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:55:32,295 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:55:32,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:55:32,296 INFO L82 PathProgramCache]: Analyzing trace with hash -515272283, now seen corresponding path program 1 times [2019-10-02 12:55:32,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:55:32,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:55:32,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:32,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:55:32,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:55:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:55:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:55:32,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:55:32,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:55:32,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:55:32,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:55:32,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:32,442 INFO L87 Difference]: Start difference. First operand 183805 states and 304412 transitions. Second operand 3 states. [2019-10-02 12:55:43,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:55:43,013 INFO L93 Difference]: Finished difference Result 186082 states and 307370 transitions. [2019-10-02 12:55:43,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:55:43,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-02 12:55:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:55:43,779 INFO L225 Difference]: With dead ends: 186082 [2019-10-02 12:55:43,779 INFO L226 Difference]: Without dead ends: 184160 [2019-10-02 12:55:43,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:55:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184160 states. [2019-10-02 12:55:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184160 to 184144. [2019-10-02 12:55:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184144 states. [2019-10-02 12:55:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184144 states to 184144 states and 304801 transitions. [2019-10-02 12:55:55,145 INFO L78 Accepts]: Start accepts. Automaton has 184144 states and 304801 transitions. Word has length 176 [2019-10-02 12:55:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:55:55,145 INFO L475 AbstractCegarLoop]: Abstraction has 184144 states and 304801 transitions. [2019-10-02 12:55:55,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:55:55,145 INFO L276 IsEmpty]: Start isEmpty. Operand 184144 states and 304801 transitions. [2019-10-02 12:56:00,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 12:56:00,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:00,401 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:00,401 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:00,402 INFO L82 PathProgramCache]: Analyzing trace with hash -369454768, now seen corresponding path program 1 times [2019-10-02 12:56:00,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:00,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:00,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:00,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:00,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:00,542 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 12:56:00,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:00,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:56:00,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:56:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:56:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:56:00,544 INFO L87 Difference]: Start difference. First operand 184144 states and 304801 transitions. Second operand 5 states. [2019-10-02 12:56:11,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:11,350 INFO L93 Difference]: Finished difference Result 185248 states and 306168 transitions. [2019-10-02 12:56:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:56:11,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2019-10-02 12:56:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:11,875 INFO L225 Difference]: With dead ends: 185248 [2019-10-02 12:56:11,876 INFO L226 Difference]: Without dead ends: 183808 [2019-10-02 12:56:11,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:56:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183808 states. [2019-10-02 12:56:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183808 to 183355. [2019-10-02 12:56:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183355 states. [2019-10-02 12:56:22,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183355 states to 183355 states and 303763 transitions. [2019-10-02 12:56:22,794 INFO L78 Accepts]: Start accepts. Automaton has 183355 states and 303763 transitions. Word has length 290 [2019-10-02 12:56:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:22,794 INFO L475 AbstractCegarLoop]: Abstraction has 183355 states and 303763 transitions. [2019-10-02 12:56:22,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:56:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 183355 states and 303763 transitions. [2019-10-02 12:56:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 12:56:23,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:23,448 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:23,448 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -441670640, now seen corresponding path program 1 times [2019-10-02 12:56:23,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:23,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:23,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:23,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:23,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 12:56:23,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:23,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:56:23,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:56:23,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:56:23,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:56:23,722 INFO L87 Difference]: Start difference. First operand 183355 states and 303763 transitions. Second operand 11 states. [2019-10-02 12:56:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:56:40,538 INFO L93 Difference]: Finished difference Result 184292 states and 304925 transitions. [2019-10-02 12:56:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:56:40,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 291 [2019-10-02 12:56:40,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:56:41,088 INFO L225 Difference]: With dead ends: 184292 [2019-10-02 12:56:41,089 INFO L226 Difference]: Without dead ends: 183831 [2019-10-02 12:56:41,136 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:56:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183831 states. [2019-10-02 12:56:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183831 to 183807. [2019-10-02 12:56:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183807 states. [2019-10-02 12:56:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183807 states to 183807 states and 304311 transitions. [2019-10-02 12:56:53,092 INFO L78 Accepts]: Start accepts. Automaton has 183807 states and 304311 transitions. Word has length 291 [2019-10-02 12:56:53,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:56:53,093 INFO L475 AbstractCegarLoop]: Abstraction has 183807 states and 304311 transitions. [2019-10-02 12:56:53,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:56:53,093 INFO L276 IsEmpty]: Start isEmpty. Operand 183807 states and 304311 transitions. [2019-10-02 12:56:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 12:56:53,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:56:53,835 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:56:53,835 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:56:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:56:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash 661304339, now seen corresponding path program 1 times [2019-10-02 12:56:53,836 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:56:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:56:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:53,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:56:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:56:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:56:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:56:54,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:56:54,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:56:54,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:56:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:56:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:56:54,035 INFO L87 Difference]: Start difference. First operand 183807 states and 304311 transitions. Second operand 7 states. [2019-10-02 12:57:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:06,883 INFO L93 Difference]: Finished difference Result 184900 states and 305668 transitions. [2019-10-02 12:57:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:57:06,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 309 [2019-10-02 12:57:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:07,506 INFO L225 Difference]: With dead ends: 184900 [2019-10-02 12:57:07,506 INFO L226 Difference]: Without dead ends: 183823 [2019-10-02 12:57:07,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:57:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183823 states. [2019-10-02 12:57:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183823 to 183823. [2019-10-02 12:57:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183823 states. [2019-10-02 12:57:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183823 states to 183823 states and 304327 transitions. [2019-10-02 12:57:25,191 INFO L78 Accepts]: Start accepts. Automaton has 183823 states and 304327 transitions. Word has length 309 [2019-10-02 12:57:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:25,192 INFO L475 AbstractCegarLoop]: Abstraction has 183823 states and 304327 transitions. [2019-10-02 12:57:25,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:57:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 183823 states and 304327 transitions. [2019-10-02 12:57:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:57:25,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:25,836 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:25,836 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:25,836 INFO L82 PathProgramCache]: Analyzing trace with hash -174961736, now seen corresponding path program 1 times [2019-10-02 12:57:25,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:25,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:25,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:25,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:57:26,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:26,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:57:26,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:57:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:57:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:57:26,034 INFO L87 Difference]: Start difference. First operand 183823 states and 304327 transitions. Second operand 11 states. [2019-10-02 12:57:37,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:37,670 INFO L93 Difference]: Finished difference Result 184490 states and 305192 transitions. [2019-10-02 12:57:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:57:37,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 310 [2019-10-02 12:57:37,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:38,213 INFO L225 Difference]: With dead ends: 184490 [2019-10-02 12:57:38,213 INFO L226 Difference]: Without dead ends: 183937 [2019-10-02 12:57:38,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:57:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183937 states. [2019-10-02 12:57:51,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183937 to 183925. [2019-10-02 12:57:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183925 states. [2019-10-02 12:57:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183925 states to 183925 states and 304483 transitions. [2019-10-02 12:57:51,781 INFO L78 Accepts]: Start accepts. Automaton has 183925 states and 304483 transitions. Word has length 310 [2019-10-02 12:57:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:51,782 INFO L475 AbstractCegarLoop]: Abstraction has 183925 states and 304483 transitions. [2019-10-02 12:57:51,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:57:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 183925 states and 304483 transitions. [2019-10-02 12:57:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:57:52,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:52,397 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:57:52,397 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1783768119, now seen corresponding path program 1 times [2019-10-02 12:57:52,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:52,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:52,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:52,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:52,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:52,560 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:57:52,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:52,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:57:52,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:57:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:57:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:57:52,561 INFO L87 Difference]: Start difference. First operand 183925 states and 304483 transitions. Second operand 7 states. [2019-10-02 12:58:16,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:16,054 INFO L93 Difference]: Finished difference Result 369828 states and 614530 transitions. [2019-10-02 12:58:16,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:16,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 311 [2019-10-02 12:58:16,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:17,268 INFO L225 Difference]: With dead ends: 369828 [2019-10-02 12:58:17,268 INFO L226 Difference]: Without dead ends: 368751 [2019-10-02 12:58:17,385 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368751 states. [2019-10-02 12:58:51,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368751 to 368739. [2019-10-02 12:58:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368739 states. [2019-10-02 12:58:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368739 states to 368739 states and 613178 transitions. [2019-10-02 12:58:52,863 INFO L78 Accepts]: Start accepts. Automaton has 368739 states and 613178 transitions. Word has length 311 [2019-10-02 12:58:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:52,864 INFO L475 AbstractCegarLoop]: Abstraction has 368739 states and 613178 transitions. [2019-10-02 12:58:52,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:58:52,864 INFO L276 IsEmpty]: Start isEmpty. Operand 368739 states and 613178 transitions. [2019-10-02 12:58:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-02 12:58:55,397 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:55,397 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:58:55,397 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash -179175874, now seen corresponding path program 1 times [2019-10-02 12:58:55,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:55,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:55,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:55,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 12:58:55,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:55,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:58:55,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:58:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:58:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:55,595 INFO L87 Difference]: Start difference. First operand 368739 states and 613178 transitions. Second operand 11 states. [2019-10-02 12:59:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:19,881 INFO L93 Difference]: Finished difference Result 370026 states and 614870 transitions. [2019-10-02 12:59:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:19,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 312 [2019-10-02 12:59:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:20,960 INFO L225 Difference]: With dead ends: 370026 [2019-10-02 12:59:20,960 INFO L226 Difference]: Without dead ends: 368925 [2019-10-02 12:59:21,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:59:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368925 states. [2019-10-02 12:59:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368925 to 368901. [2019-10-02 12:59:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368901 states. [2019-10-02 12:59:57,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368901 states to 368901 states and 613438 transitions. [2019-10-02 12:59:57,561 INFO L78 Accepts]: Start accepts. Automaton has 368901 states and 613438 transitions. Word has length 312 [2019-10-02 12:59:57,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:57,561 INFO L475 AbstractCegarLoop]: Abstraction has 368901 states and 613438 transitions. [2019-10-02 12:59:57,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:59:57,562 INFO L276 IsEmpty]: Start isEmpty. Operand 368901 states and 613438 transitions. [2019-10-02 13:00:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:00:00,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:00,163 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:00,163 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1467076589, now seen corresponding path program 1 times [2019-10-02 13:00:00,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:00,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:00,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:00,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:00,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:00:00,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:00,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:00:00,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:00:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:00:00,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:00:00,333 INFO L87 Difference]: Start difference. First operand 368901 states and 613438 transitions. Second operand 7 states. [2019-10-02 13:00:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:53,777 INFO L93 Difference]: Finished difference Result 741953 states and 1238257 transitions. [2019-10-02 13:00:53,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:00:53,778 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 313 [2019-10-02 13:00:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:56,107 INFO L225 Difference]: With dead ends: 741953 [2019-10-02 13:00:56,108 INFO L226 Difference]: Without dead ends: 739804 [2019-10-02 13:00:56,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:00:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739804 states. [2019-10-02 13:02:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739804 to 739792. [2019-10-02 13:02:11,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739792 states. [2019-10-02 13:02:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739792 states to 739792 states and 1235568 transitions. [2019-10-02 13:02:12,851 INFO L78 Accepts]: Start accepts. Automaton has 739792 states and 1235568 transitions. Word has length 313 [2019-10-02 13:02:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:12,852 INFO L475 AbstractCegarLoop]: Abstraction has 739792 states and 1235568 transitions. [2019-10-02 13:02:12,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:02:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 739792 states and 1235568 transitions. [2019-10-02 13:02:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-02 13:02:30,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:30,591 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:30,591 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:30,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:30,592 INFO L82 PathProgramCache]: Analyzing trace with hash -772429582, now seen corresponding path program 1 times [2019-10-02 13:02:30,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:30,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:30,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:02:30,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:30,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:02:30,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:02:30,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:02:30,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:02:30,794 INFO L87 Difference]: Start difference. First operand 739792 states and 1235568 transitions. Second operand 11 states. [2019-10-02 13:03:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:17,866 INFO L93 Difference]: Finished difference Result 743457 states and 1240418 transitions. [2019-10-02 13:03:17,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:03:17,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 313 [2019-10-02 13:03:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:19,876 INFO L225 Difference]: With dead ends: 743457 [2019-10-02 13:03:19,877 INFO L226 Difference]: Without dead ends: 740164 [2019-10-02 13:03:20,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:03:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740164 states.