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_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:58:16,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:58:16,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:58:16,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:58:16,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:58:16,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:58:16,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:58:16,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:58:16,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:58:16,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:58:16,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:58:16,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:58:16,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:58:16,937 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:58:16,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:58:16,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:58:16,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:58:16,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:58:16,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:58:16,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:58:16,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:58:16,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:58:16,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:58:16,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:58:16,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:58:16,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:58:16,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:58:16,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:58:16,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:58:16,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:58:16,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:58:16,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:58:16,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:58:16,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:58:16,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:58:16,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:58:16,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:58:16,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:58:16,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:58:16,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:58:16,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:58:16,962 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:58:16,989 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:58:16,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:58:16,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:58:16,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:58:16,993 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:58:16,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:58:16,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:58:16,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:58:16,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:58:16,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:58:16,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:58:16,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:58:16,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:58:16,995 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:58:16,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:58:16,995 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:58:16,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:58:16,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:58:16,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:58:16,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:58:16,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:58:16,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:58:16,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:58:16,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:58:16,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:58:16,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:58:16,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:58:17,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:58:17,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:58:17,034 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:58:17,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:58:17,049 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:58:17,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:58:17,050 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:58:17,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product32.cil.c [2019-10-02 12:58:17,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a46d9cc/cc8027cafe6c4cec9ddc74836eccec0a/FLAG285e87acc [2019-10-02 12:58:17,791 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:58:17,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product32.cil.c [2019-10-02 12:58:17,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a46d9cc/cc8027cafe6c4cec9ddc74836eccec0a/FLAG285e87acc [2019-10-02 12:58:17,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59a46d9cc/cc8027cafe6c4cec9ddc74836eccec0a [2019-10-02 12:58:17,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:58:17,944 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:58:17,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:58:17,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:58:17,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:58:17,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:58:17" (1/1) ... [2019-10-02 12:58:17,953 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:58:17, skipping insertion in model container [2019-10-02 12:58:17,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:58:17" (1/1) ... [2019-10-02 12:58:17,962 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:58:18,051 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:58:18,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:58:18,745 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:58:18,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:58:19,021 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:58:19,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19 WrapperNode [2019-10-02 12:58:19,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:58:19,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:58:19,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:58:19,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:58:19,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (1/1) ... [2019-10-02 12:58:19,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:58:19,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:58:19,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:58:19,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:58:19,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (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:58:19,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:58:19,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:58:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:58:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:58:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:58:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:58:19,319 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:58:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:58:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:58:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:58:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:58:19,320 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 12:58:19,321 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:58:19,321 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:58:19,321 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:58:19,321 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:58:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:58:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:58:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:58:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:58:19,322 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:58:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:58:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:58:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:58:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:58:19,323 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:58:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:58:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:58:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:58:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:58:19,324 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:58:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:58:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:58:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:58:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:58:19,325 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:58:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:58:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:58:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:58:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:58:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:58:19,326 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:58:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:58:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:58:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:58:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:58:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:58:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:58:19,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:58:19,329 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:58:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:58:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:58:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:58:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:58:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:58:19,330 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:58:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:58:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:58:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:58:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:58:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:58:19,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:58:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:58:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:58:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:58:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:58:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:58:19,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:58:19,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:58:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:58:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:58:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 12:58:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 12:58:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:58:19,334 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:58:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:58:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:58:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:58:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:58:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:58:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:58:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:58:19,337 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:58:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:58:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:58:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:58:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:58:19,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:58:19,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:58:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:58:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:58:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:58:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:58:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:58:19,339 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:58:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:58:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:58:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:58:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:58:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:58:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:58:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:58:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:58:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:58:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:58:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:58:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:58:19,342 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:58:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:58:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:58:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:58:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:58:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:58:19,343 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:58:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:58:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:58:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:58:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:58:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:58:19,344 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:58:19,345 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:58:19,345 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:58:19,345 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:58:19,345 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:58:19,345 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:58:19,345 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:58:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:58:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:58:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:58:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:58:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:58:19,346 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:58:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:58:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:58:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:58:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:58:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:58:19,347 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:58:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:58:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:58:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:58:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:58:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:58:19,348 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:58:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 12:58:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:58:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:58:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:58:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:58:19,349 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:58:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:58:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:58:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:58:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:58:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:58:19,350 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:58:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:58:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:58:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:58:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:58:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:58:19,351 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:58:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:58:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:58:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:58:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:58:19,352 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:58:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:58:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:58:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:58:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:58:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:58:19,353 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:58:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:58:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:58:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:58:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:58:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:58:19,354 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:58:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:58:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:58:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:58:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:58:19,355 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:58:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:58:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:58:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:58:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:58:19,356 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:58:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:58:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:58:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:58:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:58:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:58:19,357 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:58:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:58:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:58:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:58:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 12:58:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 12:58:19,358 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:58:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:58:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:58:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:58:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:58:19,359 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:58:19,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:58:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:58:19,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:58:21,541 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:58:21,541 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:58:21,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:58:21 BoogieIcfgContainer [2019-10-02 12:58:21,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:58:21,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:58:21,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:58:21,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:58:21,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:58:17" (1/3) ... [2019-10-02 12:58:21,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58264660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:58:21, skipping insertion in model container [2019-10-02 12:58:21,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:58:19" (2/3) ... [2019-10-02 12:58:21,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58264660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:58:21, skipping insertion in model container [2019-10-02 12:58:21,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:58:21" (3/3) ... [2019-10-02 12:58:21,554 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product32.cil.c [2019-10-02 12:58:21,564 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:58:21,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:58:21,596 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:58:21,636 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:58:21,637 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:58:21,637 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:58:21,637 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:58:21,638 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:58:21,638 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:58:21,638 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:58:21,638 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:58:21,638 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:58:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states. [2019-10-02 12:58:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:58:21,705 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:21,706 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:21,708 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:21,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:21,713 INFO L82 PathProgramCache]: Analyzing trace with hash 759210105, now seen corresponding path program 1 times [2019-10-02 12:58:21,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:21,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:21,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:22,422 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:58:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:58:22,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:58:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:58:22,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:58:22,448 INFO L87 Difference]: Start difference. First operand 637 states. Second operand 2 states. [2019-10-02 12:58:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:22,574 INFO L93 Difference]: Finished difference Result 904 states and 1227 transitions. [2019-10-02 12:58:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:58:22,576 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-10-02 12:58:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:22,614 INFO L225 Difference]: With dead ends: 904 [2019-10-02 12:58:22,614 INFO L226 Difference]: Without dead ends: 580 [2019-10-02 12:58:22,626 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:58:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-02 12:58:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-02 12:58:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 12:58:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 792 transitions. [2019-10-02 12:58:22,728 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 792 transitions. Word has length 167 [2019-10-02 12:58:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:22,730 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 792 transitions. [2019-10-02 12:58:22,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:58:22,731 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 792 transitions. [2019-10-02 12:58:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:58:22,737 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:22,737 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:22,738 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:22,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash -425552683, now seen corresponding path program 1 times [2019-10-02 12:58:22,738 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:22,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:22,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:22,932 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:58:22,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:22,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:22,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:22,941 INFO L87 Difference]: Start difference. First operand 580 states and 792 transitions. Second operand 3 states. [2019-10-02 12:58:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:22,991 INFO L93 Difference]: Finished difference Result 887 states and 1192 transitions. [2019-10-02 12:58:22,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:22,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 12:58:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:23,002 INFO L225 Difference]: With dead ends: 887 [2019-10-02 12:58:23,002 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 12:58:23,018 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:58:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 12:58:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 582. [2019-10-02 12:58:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-02 12:58:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 794 transitions. [2019-10-02 12:58:23,077 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 794 transitions. Word has length 168 [2019-10-02 12:58:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:23,078 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 794 transitions. [2019-10-02 12:58:23,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 794 transitions. [2019-10-02 12:58:23,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:58:23,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:23,085 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:23,086 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash -102964987, now seen corresponding path program 1 times [2019-10-02 12:58:23,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:23,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:23,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:23,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:23,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:23,427 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:23,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:23,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:23,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:23,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:23,434 INFO L87 Difference]: Start difference. First operand 582 states and 794 transitions. Second operand 3 states. [2019-10-02 12:58:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:23,491 INFO L93 Difference]: Finished difference Result 1142 states and 1589 transitions. [2019-10-02 12:58:23,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:23,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-02 12:58:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:23,500 INFO L225 Difference]: With dead ends: 1142 [2019-10-02 12:58:23,500 INFO L226 Difference]: Without dead ends: 625 [2019-10-02 12:58:23,502 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:58:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-02 12:58:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 624. [2019-10-02 12:58:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-10-02 12:58:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 866 transitions. [2019-10-02 12:58:23,551 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 866 transitions. Word has length 178 [2019-10-02 12:58:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:23,553 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 866 transitions. [2019-10-02 12:58:23,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 866 transitions. [2019-10-02 12:58:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:58:23,558 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:23,559 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:23,559 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:23,560 INFO L82 PathProgramCache]: Analyzing trace with hash 739135623, now seen corresponding path program 1 times [2019-10-02 12:58:23,560 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:23,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:23,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:23,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:23,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:23,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:23,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:23,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:23,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:23,754 INFO L87 Difference]: Start difference. First operand 624 states and 866 transitions. Second operand 3 states. [2019-10-02 12:58:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:23,796 INFO L93 Difference]: Finished difference Result 1265 states and 1800 transitions. [2019-10-02 12:58:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:23,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-10-02 12:58:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:23,804 INFO L225 Difference]: With dead ends: 1265 [2019-10-02 12:58:23,804 INFO L226 Difference]: Without dead ends: 706 [2019-10-02 12:58:23,807 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:58:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2019-10-02 12:58:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 705. [2019-10-02 12:58:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-10-02 12:58:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1004 transitions. [2019-10-02 12:58:23,848 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1004 transitions. Word has length 179 [2019-10-02 12:58:23,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:23,848 INFO L475 AbstractCegarLoop]: Abstraction has 705 states and 1004 transitions. [2019-10-02 12:58:23,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1004 transitions. [2019-10-02 12:58:23,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:58:23,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:23,856 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:23,857 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:23,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:23,857 INFO L82 PathProgramCache]: Analyzing trace with hash -804739163, now seen corresponding path program 1 times [2019-10-02 12:58:23,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:23,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:23,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:23,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:24,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:24,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:24,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:24,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:24,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:24,134 INFO L87 Difference]: Start difference. First operand 705 states and 1004 transitions. Second operand 3 states. [2019-10-02 12:58:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:24,201 INFO L93 Difference]: Finished difference Result 1502 states and 2204 transitions. [2019-10-02 12:58:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:24,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-10-02 12:58:24,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:24,212 INFO L225 Difference]: With dead ends: 1502 [2019-10-02 12:58:24,213 INFO L226 Difference]: Without dead ends: 862 [2019-10-02 12:58:24,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:58:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-02 12:58:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 861. [2019-10-02 12:58:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-10-02 12:58:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1268 transitions. [2019-10-02 12:58:24,353 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1268 transitions. Word has length 180 [2019-10-02 12:58:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:24,354 INFO L475 AbstractCegarLoop]: Abstraction has 861 states and 1268 transitions. [2019-10-02 12:58:24,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1268 transitions. [2019-10-02 12:58:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:58:24,363 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:24,363 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:24,364 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 320279015, now seen corresponding path program 1 times [2019-10-02 12:58:24,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:24,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:24,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:24,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:24,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:24,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:24,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:24,610 INFO L87 Difference]: Start difference. First operand 861 states and 1268 transitions. Second operand 3 states. [2019-10-02 12:58:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:24,669 INFO L93 Difference]: Finished difference Result 1958 states and 2976 transitions. [2019-10-02 12:58:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:24,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-10-02 12:58:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:24,681 INFO L225 Difference]: With dead ends: 1958 [2019-10-02 12:58:24,681 INFO L226 Difference]: Without dead ends: 1162 [2019-10-02 12:58:24,686 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:58:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-02 12:58:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1161. [2019-10-02 12:58:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1161 states. [2019-10-02 12:58:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1772 transitions. [2019-10-02 12:58:24,757 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1772 transitions. Word has length 181 [2019-10-02 12:58:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:24,758 INFO L475 AbstractCegarLoop]: Abstraction has 1161 states and 1772 transitions. [2019-10-02 12:58:24,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1772 transitions. [2019-10-02 12:58:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:58:24,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:24,766 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:24,766 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1317079888, now seen corresponding path program 1 times [2019-10-02 12:58:24,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:24,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:24,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:24,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:24,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:58:26,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-02 12:58:26,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 12:58:26,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 12:58:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:58:26,349 INFO L87 Difference]: Start difference. First operand 1161 states and 1772 transitions. Second operand 43 states. [2019-10-02 12:58:44,914 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2019-10-02 12:59:01,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:01,979 INFO L93 Difference]: Finished difference Result 9805 states and 15223 transitions. [2019-10-02 12:59:01,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-10-02 12:59:01,980 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 184 [2019-10-02 12:59:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:02,034 INFO L225 Difference]: With dead ends: 9805 [2019-10-02 12:59:02,035 INFO L226 Difference]: Without dead ends: 8661 [2019-10-02 12:59:02,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17661 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2814, Invalid=49856, Unknown=0, NotChecked=0, Total=52670 [2019-10-02 12:59:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8661 states. [2019-10-02 12:59:02,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8661 to 8538. [2019-10-02 12:59:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8538 states. [2019-10-02 12:59:02,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8538 states to 8538 states and 13215 transitions. [2019-10-02 12:59:02,547 INFO L78 Accepts]: Start accepts. Automaton has 8538 states and 13215 transitions. Word has length 184 [2019-10-02 12:59:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:02,548 INFO L475 AbstractCegarLoop]: Abstraction has 8538 states and 13215 transitions. [2019-10-02 12:59:02,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 12:59:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8538 states and 13215 transitions. [2019-10-02 12:59:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:59:02,601 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:02,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:02,602 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:02,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1542792240, now seen corresponding path program 1 times [2019-10-02 12:59:02,603 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:02,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:02,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:02,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:02,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:59:02,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:02,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:02,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:02,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:02,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:02,827 INFO L87 Difference]: Start difference. First operand 8538 states and 13215 transitions. Second operand 3 states. [2019-10-02 12:59:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:03,778 INFO L93 Difference]: Finished difference Result 20414 states and 32448 transitions. [2019-10-02 12:59:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:03,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-10-02 12:59:03,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:03,854 INFO L225 Difference]: With dead ends: 20414 [2019-10-02 12:59:03,854 INFO L226 Difference]: Without dead ends: 12000 [2019-10-02 12:59:03,886 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:59:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12000 states. [2019-10-02 12:59:04,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12000 to 11994. [2019-10-02 12:59:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11994 states. [2019-10-02 12:59:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11994 states to 11994 states and 19279 transitions. [2019-10-02 12:59:04,568 INFO L78 Accepts]: Start accepts. Automaton has 11994 states and 19279 transitions. Word has length 184 [2019-10-02 12:59:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:04,568 INFO L475 AbstractCegarLoop]: Abstraction has 11994 states and 19279 transitions. [2019-10-02 12:59:04,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 11994 states and 19279 transitions. [2019-10-02 12:59:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:59:04,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:04,649 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, 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:59:04,650 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:04,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1719701868, now seen corresponding path program 1 times [2019-10-02 12:59:04,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:04,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:05,081 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:59:05,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:05,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 12:59:05,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:59:05,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:59:05,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:59:05,084 INFO L87 Difference]: Start difference. First operand 11994 states and 19279 transitions. Second operand 14 states. [2019-10-02 12:59:05,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:05,704 INFO L93 Difference]: Finished difference Result 15935 states and 24698 transitions. [2019-10-02 12:59:05,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:59:05,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 187 [2019-10-02 12:59:05,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:05,798 INFO L225 Difference]: With dead ends: 15935 [2019-10-02 12:59:05,798 INFO L226 Difference]: Without dead ends: 12339 [2019-10-02 12:59:05,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:59:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12339 states. [2019-10-02 12:59:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12339 to 12339. [2019-10-02 12:59:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12339 states. [2019-10-02 12:59:06,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12339 states to 12339 states and 19824 transitions. [2019-10-02 12:59:06,490 INFO L78 Accepts]: Start accepts. Automaton has 12339 states and 19824 transitions. Word has length 187 [2019-10-02 12:59:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:06,492 INFO L475 AbstractCegarLoop]: Abstraction has 12339 states and 19824 transitions. [2019-10-02 12:59:06,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:59:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12339 states and 19824 transitions. [2019-10-02 12:59:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:59:06,556 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:06,557 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, 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:59:06,557 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:06,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:06,558 INFO L82 PathProgramCache]: Analyzing trace with hash 88257102, now seen corresponding path program 1 times [2019-10-02 12:59:06,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:06,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:06,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:06,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:06,758 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:59:06,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:06,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:59:06,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:59:06,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:59:06,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:06,760 INFO L87 Difference]: Start difference. First operand 12339 states and 19824 transitions. Second operand 5 states. [2019-10-02 12:59:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:08,675 INFO L93 Difference]: Finished difference Result 24152 states and 38178 transitions. [2019-10-02 12:59:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:59:08,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-10-02 12:59:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:08,791 INFO L225 Difference]: With dead ends: 24152 [2019-10-02 12:59:08,792 INFO L226 Difference]: Without dead ends: 22264 [2019-10-02 12:59:08,810 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:59:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22264 states. [2019-10-02 12:59:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22264 to 22222. [2019-10-02 12:59:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22222 states. [2019-10-02 12:59:09,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22222 states to 22222 states and 35457 transitions. [2019-10-02 12:59:09,839 INFO L78 Accepts]: Start accepts. Automaton has 22222 states and 35457 transitions. Word has length 187 [2019-10-02 12:59:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:09,840 INFO L475 AbstractCegarLoop]: Abstraction has 22222 states and 35457 transitions. [2019-10-02 12:59:09,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:59:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 22222 states and 35457 transitions. [2019-10-02 12:59:09,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:59:09,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:09,919 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, 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:59:09,920 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1921846739, now seen corresponding path program 1 times [2019-10-02 12:59:09,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:09,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:09,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:09,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:10,393 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:59:10,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:10,394 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:59:10,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:11,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 2982 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:59:11,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:11,447 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:59:11,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:59:11,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 26 [2019-10-02 12:59:11,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:59:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:59:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:59:11,459 INFO L87 Difference]: Start difference. First operand 22222 states and 35457 transitions. Second operand 26 states. [2019-10-02 12:59:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:19,519 INFO L93 Difference]: Finished difference Result 37622 states and 59875 transitions. [2019-10-02 12:59:19,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:59:19,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 187 [2019-10-02 12:59:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:19,602 INFO L225 Difference]: With dead ends: 37622 [2019-10-02 12:59:19,602 INFO L226 Difference]: Without dead ends: 19661 [2019-10-02 12:59:19,688 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 12:59:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19661 states. [2019-10-02 12:59:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19661 to 19629. [2019-10-02 12:59:20,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19629 states. [2019-10-02 12:59:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19629 states to 19629 states and 31775 transitions. [2019-10-02 12:59:20,919 INFO L78 Accepts]: Start accepts. Automaton has 19629 states and 31775 transitions. Word has length 187 [2019-10-02 12:59:20,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:20,919 INFO L475 AbstractCegarLoop]: Abstraction has 19629 states and 31775 transitions. [2019-10-02 12:59:20,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:59:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19629 states and 31775 transitions. [2019-10-02 12:59:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:59:21,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:21,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:21,014 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash -132103661, now seen corresponding path program 1 times [2019-10-02 12:59:21,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:21,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:21,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:21,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:21,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:21,459 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:59:21,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:59:21,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:59:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:59:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:59:21,462 INFO L87 Difference]: Start difference. First operand 19629 states and 31775 transitions. Second operand 11 states. [2019-10-02 12:59:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:22,438 INFO L93 Difference]: Finished difference Result 24305 states and 38142 transitions. [2019-10-02 12:59:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:22,439 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-02 12:59:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:22,514 INFO L225 Difference]: With dead ends: 24305 [2019-10-02 12:59:22,514 INFO L226 Difference]: Without dead ends: 17508 [2019-10-02 12:59:22,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:59:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17508 states. [2019-10-02 12:59:23,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17508 to 17486. [2019-10-02 12:59:23,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17486 states. [2019-10-02 12:59:23,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17486 states to 17486 states and 28844 transitions. [2019-10-02 12:59:23,422 INFO L78 Accepts]: Start accepts. Automaton has 17486 states and 28844 transitions. Word has length 188 [2019-10-02 12:59:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:23,424 INFO L475 AbstractCegarLoop]: Abstraction has 17486 states and 28844 transitions. [2019-10-02 12:59:23,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:59:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 17486 states and 28844 transitions. [2019-10-02 12:59:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:59:23,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:23,483 INFO L411 BasicCegarLoop]: trace histogram [3, 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, 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:59:23,483 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:23,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:23,484 INFO L82 PathProgramCache]: Analyzing trace with hash -484372668, now seen corresponding path program 1 times [2019-10-02 12:59:23,484 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:23,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:23,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:23,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:23,622 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:59:23,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:23,622 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:59:24,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:24,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 2985 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:59:24,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 12:59:24,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:59:24,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 12:59:24,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:59:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:59:24,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:59:24,688 INFO L87 Difference]: Start difference. First operand 17486 states and 28844 transitions. Second operand 12 states. [2019-10-02 12:59:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:26,772 INFO L93 Difference]: Finished difference Result 30720 states and 50160 transitions. [2019-10-02 12:59:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:59:26,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 189 [2019-10-02 12:59:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:26,828 INFO L225 Difference]: With dead ends: 30720 [2019-10-02 12:59:26,828 INFO L226 Difference]: Without dead ends: 13300 [2019-10-02 12:59:26,870 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:59:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13300 states. [2019-10-02 12:59:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13300 to 13274. [2019-10-02 12:59:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13274 states. [2019-10-02 12:59:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13274 states to 13274 states and 21365 transitions. [2019-10-02 12:59:27,422 INFO L78 Accepts]: Start accepts. Automaton has 13274 states and 21365 transitions. Word has length 189 [2019-10-02 12:59:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:27,422 INFO L475 AbstractCegarLoop]: Abstraction has 13274 states and 21365 transitions. [2019-10-02 12:59:27,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:59:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13274 states and 21365 transitions. [2019-10-02 12:59:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:59:27,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:27,450 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, 1, 1, 1, 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:59:27,450 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:27,451 INFO L82 PathProgramCache]: Analyzing trace with hash 765954305, now seen corresponding path program 1 times [2019-10-02 12:59:27,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:27,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:27,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:27,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:27,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:28,231 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:59:28,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:28,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:59:28,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:59:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:59:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:59:28,234 INFO L87 Difference]: Start difference. First operand 13274 states and 21365 transitions. Second operand 26 states. [2019-10-02 12:59:37,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:37,758 INFO L93 Difference]: Finished difference Result 31534 states and 49714 transitions. [2019-10-02 12:59:37,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:59:37,758 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 197 [2019-10-02 12:59:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:37,898 INFO L225 Difference]: With dead ends: 31534 [2019-10-02 12:59:37,898 INFO L226 Difference]: Without dead ends: 28704 [2019-10-02 12:59:37,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 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:59:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28704 states. [2019-10-02 12:59:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28704 to 26597. [2019-10-02 12:59:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2019-10-02 12:59:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 42899 transitions. [2019-10-02 12:59:40,346 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 42899 transitions. Word has length 197 [2019-10-02 12:59:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:40,346 INFO L475 AbstractCegarLoop]: Abstraction has 26597 states and 42899 transitions. [2019-10-02 12:59:40,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:59:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 42899 transitions. [2019-10-02 12:59:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:59:40,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:40,391 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, 1, 1, 1, 1, 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:59:40,391 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash -296941052, now seen corresponding path program 1 times [2019-10-02 12:59:40,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:40,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:40,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:40,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:40,560 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:59:40,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:40,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:59:40,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:59:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:59:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:59:40,564 INFO L87 Difference]: Start difference. First operand 26597 states and 42899 transitions. Second operand 9 states. [2019-10-02 12:59:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:41,145 INFO L93 Difference]: Finished difference Result 28569 states and 45602 transitions. [2019-10-02 12:59:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:41,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-10-02 12:59:41,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:41,193 INFO L225 Difference]: With dead ends: 28569 [2019-10-02 12:59:41,193 INFO L226 Difference]: Without dead ends: 13286 [2019-10-02 12:59:41,233 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:59:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13286 states. [2019-10-02 12:59:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13286 to 13284. [2019-10-02 12:59:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13284 states. [2019-10-02 12:59:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13284 states to 13284 states and 21376 transitions. [2019-10-02 12:59:41,837 INFO L78 Accepts]: Start accepts. Automaton has 13284 states and 21376 transitions. Word has length 198 [2019-10-02 12:59:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:41,838 INFO L475 AbstractCegarLoop]: Abstraction has 13284 states and 21376 transitions. [2019-10-02 12:59:41,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:59:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 13284 states and 21376 transitions. [2019-10-02 12:59:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 12:59:41,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:41,863 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, 1, 1, 1, 1, 1, 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:59:41,864 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash 97659714, now seen corresponding path program 2 times [2019-10-02 12:59:41,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:41,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:41,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:41,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:42,273 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:59:42,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:42,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:59:42,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:59:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:59:42,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:59:42,275 INFO L87 Difference]: Start difference. First operand 13284 states and 21376 transitions. Second operand 24 states. [2019-10-02 12:59:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:52,119 INFO L93 Difference]: Finished difference Result 31523 states and 49700 transitions. [2019-10-02 12:59:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:59:52,120 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 198 [2019-10-02 12:59:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:52,226 INFO L225 Difference]: With dead ends: 31523 [2019-10-02 12:59:52,226 INFO L226 Difference]: Without dead ends: 28697 [2019-10-02 12:59:52,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:59:52,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28697 states. [2019-10-02 12:59:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28697 to 26592. [2019-10-02 12:59:53,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26592 states. [2019-10-02 12:59:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26592 states to 26592 states and 42891 transitions. [2019-10-02 12:59:53,605 INFO L78 Accepts]: Start accepts. Automaton has 26592 states and 42891 transitions. Word has length 198 [2019-10-02 12:59:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:53,606 INFO L475 AbstractCegarLoop]: Abstraction has 26592 states and 42891 transitions. [2019-10-02 12:59:53,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:59:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 26592 states and 42891 transitions. [2019-10-02 12:59:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:59:53,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:53,649 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, 1, 1, 1, 1, 1, 1, 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:59:53,649 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash 460763107, now seen corresponding path program 2 times [2019-10-02 12:59:53,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:53,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:53,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:53,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:53,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:53,795 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:59:53,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:53,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:59:53,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:59:53,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:59:53,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:59:53,797 INFO L87 Difference]: Start difference. First operand 26592 states and 42891 transitions. Second operand 7 states. [2019-10-02 12:59:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:54,316 INFO L93 Difference]: Finished difference Result 28562 states and 45592 transitions. [2019-10-02 12:59:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:59:54,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-10-02 12:59:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:54,348 INFO L225 Difference]: With dead ends: 28562 [2019-10-02 12:59:54,348 INFO L226 Difference]: Without dead ends: 13284 [2019-10-02 12:59:54,373 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:59:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2019-10-02 12:59:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 13284. [2019-10-02 12:59:56,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13284 states. [2019-10-02 12:59:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13284 states to 13284 states and 21375 transitions. [2019-10-02 12:59:56,034 INFO L78 Accepts]: Start accepts. Automaton has 13284 states and 21375 transitions. Word has length 199 [2019-10-02 12:59:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:56,034 INFO L475 AbstractCegarLoop]: Abstraction has 13284 states and 21375 transitions. [2019-10-02 12:59:56,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:59:56,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13284 states and 21375 transitions. [2019-10-02 12:59:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:59:56,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:56,054 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, 1, 1, 1, 1, 1, 1, 1, 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:59:56,054 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash -399398312, now seen corresponding path program 3 times [2019-10-02 12:59:56,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:56,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:56,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:56,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:56,551 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:59:56,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:56,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:59:56,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:59:56,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:59:56,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:59:56,552 INFO L87 Difference]: Start difference. First operand 13284 states and 21375 transitions. Second operand 26 states. [2019-10-02 13:00:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:06,322 INFO L93 Difference]: Finished difference Result 31532 states and 49709 transitions. [2019-10-02 13:00:06,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 13:00:06,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 199 [2019-10-02 13:00:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:06,386 INFO L225 Difference]: With dead ends: 31532 [2019-10-02 13:00:06,386 INFO L226 Difference]: Without dead ends: 28706 [2019-10-02 13:00:06,398 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 13:00:06,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-10-02 13:00:07,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 26597. [2019-10-02 13:00:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26597 states. [2019-10-02 13:00:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26597 states to 26597 states and 42896 transitions. [2019-10-02 13:00:07,257 INFO L78 Accepts]: Start accepts. Automaton has 26597 states and 42896 transitions. Word has length 199 [2019-10-02 13:00:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:07,258 INFO L475 AbstractCegarLoop]: Abstraction has 26597 states and 42896 transitions. [2019-10-02 13:00:07,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:00:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26597 states and 42896 transitions. [2019-10-02 13:00:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:00:07,305 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:07,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,305 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:07,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2063133811, now seen corresponding path program 3 times [2019-10-02 13:00:07,306 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:07,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:07,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:07,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:00:07,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:07,468 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 13:00:07,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:00:07,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:00:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:00:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:00:07,470 INFO L87 Difference]: Start difference. First operand 26597 states and 42896 transitions. Second operand 9 states. [2019-10-02 13:00:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:08,026 INFO L93 Difference]: Finished difference Result 28571 states and 45601 transitions. [2019-10-02 13:00:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:00:08,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-10-02 13:00:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:08,058 INFO L225 Difference]: With dead ends: 28571 [2019-10-02 13:00:08,059 INFO L226 Difference]: Without dead ends: 13288 [2019-10-02 13:00:08,083 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 13:00:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13288 states. [2019-10-02 13:00:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13288 to 13284. [2019-10-02 13:00:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13284 states. [2019-10-02 13:00:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13284 states to 13284 states and 21374 transitions. [2019-10-02 13:00:08,811 INFO L78 Accepts]: Start accepts. Automaton has 13284 states and 21374 transitions. Word has length 200 [2019-10-02 13:00:08,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:08,812 INFO L475 AbstractCegarLoop]: Abstraction has 13284 states and 21374 transitions. [2019-10-02 13:00:08,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:00:08,812 INFO L276 IsEmpty]: Start isEmpty. Operand 13284 states and 21374 transitions. [2019-10-02 13:00:08,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:00:08,843 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:08,843 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, 1, 1, 1, 1, 1, 1, 1, 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:08,843 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:08,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:08,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1958324684, now seen corresponding path program 1 times [2019-10-02 13:00:08,844 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:08,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:08,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:08,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:00:08,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:09,279 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 13:00:09,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:09,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:00:09,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:00:09,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:00:09,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:00:09,280 INFO L87 Difference]: Start difference. First operand 13284 states and 21374 transitions. Second operand 24 states. [2019-10-02 13:00:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:18,507 INFO L93 Difference]: Finished difference Result 41944 states and 67329 transitions. [2019-10-02 13:00:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 13:00:18,507 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 200 [2019-10-02 13:00:18,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:18,780 INFO L225 Difference]: With dead ends: 41944 [2019-10-02 13:00:18,780 INFO L226 Difference]: Without dead ends: 28735 [2019-10-02 13:00:18,803 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 13:00:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28735 states. [2019-10-02 13:00:19,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28735 to 26594. [2019-10-02 13:00:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26594 states. [2019-10-02 13:00:19,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26594 states to 26594 states and 42886 transitions. [2019-10-02 13:00:19,584 INFO L78 Accepts]: Start accepts. Automaton has 26594 states and 42886 transitions. Word has length 200 [2019-10-02 13:00:19,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:19,584 INFO L475 AbstractCegarLoop]: Abstraction has 26594 states and 42886 transitions. [2019-10-02 13:00:19,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:00:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 26594 states and 42886 transitions. [2019-10-02 13:00:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:00:19,626 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:19,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,627 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:19,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1149756209, now seen corresponding path program 1 times [2019-10-02 13:00:19,627 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:19,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:19,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:19,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:19,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:19,768 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 13:00:19,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:19,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:00:19,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:00:19,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:00:19,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:00:19,770 INFO L87 Difference]: Start difference. First operand 26594 states and 42886 transitions. Second operand 7 states. [2019-10-02 13:00:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:20,292 INFO L93 Difference]: Finished difference Result 28588 states and 45611 transitions. [2019-10-02 13:00:20,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:00:20,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-10-02 13:00:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:20,323 INFO L225 Difference]: With dead ends: 28588 [2019-10-02 13:00:20,323 INFO L226 Difference]: Without dead ends: 13310 [2019-10-02 13:00:20,346 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 13:00:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2019-10-02 13:00:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 13286. [2019-10-02 13:00:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13286 states. [2019-10-02 13:00:20,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13286 states to 13286 states and 21376 transitions. [2019-10-02 13:00:20,730 INFO L78 Accepts]: Start accepts. Automaton has 13286 states and 21376 transitions. Word has length 201 [2019-10-02 13:00:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:20,730 INFO L475 AbstractCegarLoop]: Abstraction has 13286 states and 21376 transitions. [2019-10-02 13:00:20,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:00:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 13286 states and 21376 transitions. [2019-10-02 13:00:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:00:20,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:20,750 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, 1, 1, 1, 1, 1, 1, 1, 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:20,750 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:20,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1637777791, now seen corresponding path program 1 times [2019-10-02 13:00:20,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:00:21,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:21,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:00:21,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:00:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:00:21,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:00:21,100 INFO L87 Difference]: Start difference. First operand 13286 states and 21376 transitions. Second operand 18 states. [2019-10-02 13:00:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:26,283 INFO L93 Difference]: Finished difference Result 18250 states and 28297 transitions. [2019-10-02 13:00:26,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:00:26,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 201 [2019-10-02 13:00:26,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:26,322 INFO L225 Difference]: With dead ends: 18250 [2019-10-02 13:00:26,323 INFO L226 Difference]: Without dead ends: 15424 [2019-10-02 13:00:26,332 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:00:26,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15424 states. [2019-10-02 13:00:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15424 to 15358. [2019-10-02 13:00:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15358 states. [2019-10-02 13:00:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15358 states to 15358 states and 24305 transitions. [2019-10-02 13:00:26,787 INFO L78 Accepts]: Start accepts. Automaton has 15358 states and 24305 transitions. Word has length 201 [2019-10-02 13:00:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:26,788 INFO L475 AbstractCegarLoop]: Abstraction has 15358 states and 24305 transitions. [2019-10-02 13:00:26,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:00:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 15358 states and 24305 transitions. [2019-10-02 13:00:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:00:26,809 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:26,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,809 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:26,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:26,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1798191996, now seen corresponding path program 1 times [2019-10-02 13:00:26,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:26,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:26,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:26,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:26,955 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 13:00:26,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:00:26,955 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:00:27,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:27,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 3030 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:00:27,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:00:27,657 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 13:00:27,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:00:27,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 13:00:27,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:00:27,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:00:27,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:00:27,666 INFO L87 Difference]: Start difference. First operand 15358 states and 24305 transitions. Second operand 5 states. [2019-10-02 13:00:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:28,091 INFO L93 Difference]: Finished difference Result 20433 states and 31328 transitions. [2019-10-02 13:00:28,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:00:28,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 202 [2019-10-02 13:00:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:28,132 INFO L225 Difference]: With dead ends: 20433 [2019-10-02 13:00:28,132 INFO L226 Difference]: Without dead ends: 15459 [2019-10-02 13:00:28,145 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 202 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 13:00:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15459 states. [2019-10-02 13:00:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15459 to 15443. [2019-10-02 13:00:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15443 states. [2019-10-02 13:00:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15443 states to 15443 states and 24429 transitions. [2019-10-02 13:00:28,647 INFO L78 Accepts]: Start accepts. Automaton has 15443 states and 24429 transitions. Word has length 202 [2019-10-02 13:00:28,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:28,647 INFO L475 AbstractCegarLoop]: Abstraction has 15443 states and 24429 transitions. [2019-10-02 13:00:28,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:00:28,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15443 states and 24429 transitions. [2019-10-02 13:00:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:00:28,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:28,673 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, 1, 1, 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:28,673 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash -321979033, now seen corresponding path program 1 times [2019-10-02 13:00:28,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:28,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:28,790 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 13:00:28,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:28,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:28,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:28,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:28,791 INFO L87 Difference]: Start difference. First operand 15443 states and 24429 transitions. Second operand 3 states. [2019-10-02 13:00:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:29,378 INFO L93 Difference]: Finished difference Result 37764 states and 61277 transitions. [2019-10-02 13:00:29,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:29,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-02 13:00:29,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:29,436 INFO L225 Difference]: With dead ends: 37764 [2019-10-02 13:00:29,436 INFO L226 Difference]: Without dead ends: 22459 [2019-10-02 13:00:29,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22459 states. [2019-10-02 13:00:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22459 to 22453. [2019-10-02 13:00:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22453 states. [2019-10-02 13:00:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22453 states to 22453 states and 36814 transitions. [2019-10-02 13:00:30,175 INFO L78 Accepts]: Start accepts. Automaton has 22453 states and 36814 transitions. Word has length 202 [2019-10-02 13:00:30,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:30,176 INFO L475 AbstractCegarLoop]: Abstraction has 22453 states and 36814 transitions. [2019-10-02 13:00:30,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22453 states and 36814 transitions. [2019-10-02 13:00:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:00:30,219 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:30,220 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, 1, 1, 1, 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:30,220 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -458583977, now seen corresponding path program 1 times [2019-10-02 13:00:30,220 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:30,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:30,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:30,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:30,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:30,334 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 13:00:30,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:30,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:30,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:30,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:30,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:30,336 INFO L87 Difference]: Start difference. First operand 22453 states and 36814 transitions. Second operand 3 states. [2019-10-02 13:00:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:31,356 INFO L93 Difference]: Finished difference Result 57827 states and 96695 transitions. [2019-10-02 13:00:31,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:31,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-10-02 13:00:31,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:31,463 INFO L225 Difference]: With dead ends: 57827 [2019-10-02 13:00:31,463 INFO L226 Difference]: Without dead ends: 35519 [2019-10-02 13:00:31,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35519 states. [2019-10-02 13:00:32,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35519 to 35513. [2019-10-02 13:00:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35513 states. [2019-10-02 13:00:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35513 states to 35513 states and 59665 transitions. [2019-10-02 13:00:32,974 INFO L78 Accepts]: Start accepts. Automaton has 35513 states and 59665 transitions. Word has length 203 [2019-10-02 13:00:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:32,975 INFO L475 AbstractCegarLoop]: Abstraction has 35513 states and 59665 transitions. [2019-10-02 13:00:32,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 35513 states and 59665 transitions. [2019-10-02 13:00:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 13:00:33,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:33,057 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, 1, 1, 1, 1, 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:33,057 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1927672645, now seen corresponding path program 1 times [2019-10-02 13:00:33,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:33,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:33,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:33,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:33,173 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 13:00:33,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:33,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:33,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:33,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:33,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:33,175 INFO L87 Difference]: Start difference. First operand 35513 states and 59665 transitions. Second operand 3 states. [2019-10-02 13:00:35,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:35,271 INFO L93 Difference]: Finished difference Result 95841 states and 163505 transitions. [2019-10-02 13:00:35,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:35,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-02 13:00:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:35,440 INFO L225 Difference]: With dead ends: 95841 [2019-10-02 13:00:35,440 INFO L226 Difference]: Without dead ends: 60481 [2019-10-02 13:00:35,499 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60481 states. [2019-10-02 13:00:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60481 to 60475. [2019-10-02 13:00:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60475 states. [2019-10-02 13:00:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60475 states to 60475 states and 103250 transitions. [2019-10-02 13:00:40,045 INFO L78 Accepts]: Start accepts. Automaton has 60475 states and 103250 transitions. Word has length 204 [2019-10-02 13:00:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:40,045 INFO L475 AbstractCegarLoop]: Abstraction has 60475 states and 103250 transitions. [2019-10-02 13:00:40,045 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 60475 states and 103250 transitions. [2019-10-02 13:00:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:00:40,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:40,164 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, 1, 1, 1, 1, 1, 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:40,164 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:40,164 INFO L82 PathProgramCache]: Analyzing trace with hash -982701129, now seen corresponding path program 1 times [2019-10-02 13:00:40,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:40,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:40,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:40,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:40,261 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 13:00:40,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:40,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:40,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:40,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:40,262 INFO L87 Difference]: Start difference. First operand 60475 states and 103250 transitions. Second operand 3 states. [2019-10-02 13:00:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:43,400 INFO L93 Difference]: Finished difference Result 168417 states and 288875 transitions. [2019-10-02 13:00:43,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:43,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-02 13:00:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:43,704 INFO L225 Difference]: With dead ends: 168417 [2019-10-02 13:00:43,704 INFO L226 Difference]: Without dead ends: 108103 [2019-10-02 13:00:43,815 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:43,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108103 states. [2019-10-02 13:00:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108103 to 108097. [2019-10-02 13:00:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108097 states. [2019-10-02 13:00:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108097 states to 108097 states and 184279 transitions. [2019-10-02 13:00:50,752 INFO L78 Accepts]: Start accepts. Automaton has 108097 states and 184279 transitions. Word has length 205 [2019-10-02 13:00:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:50,752 INFO L475 AbstractCegarLoop]: Abstraction has 108097 states and 184279 transitions. [2019-10-02 13:00:50,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 108097 states and 184279 transitions. [2019-10-02 13:00:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 13:00:50,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:50,935 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, 1, 1, 1, 1, 1, 1, 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:50,935 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash -303525915, now seen corresponding path program 1 times [2019-10-02 13:00:50,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:50,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:51,046 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 13:00:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:51,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:51,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:51,048 INFO L87 Difference]: Start difference. First operand 108097 states and 184279 transitions. Second operand 3 states. [2019-10-02 13:00:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:59,441 INFO L93 Difference]: Finished difference Result 306652 states and 524257 transitions. [2019-10-02 13:00:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:59,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-02 13:00:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:59,998 INFO L225 Difference]: With dead ends: 306652 [2019-10-02 13:00:59,998 INFO L226 Difference]: Without dead ends: 198729 [2019-10-02 13:01:00,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198729 states. [2019-10-02 13:01:11,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198729 to 198723. [2019-10-02 13:01:11,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198723 states. [2019-10-02 13:01:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198723 states to 198723 states and 337112 transitions. [2019-10-02 13:01:12,449 INFO L78 Accepts]: Start accepts. Automaton has 198723 states and 337112 transitions. Word has length 206 [2019-10-02 13:01:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:12,449 INFO L475 AbstractCegarLoop]: Abstraction has 198723 states and 337112 transitions. [2019-10-02 13:01:12,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:01:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 198723 states and 337112 transitions. [2019-10-02 13:01:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 13:01:12,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:12,753 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, 1, 1, 1, 1, 1, 1, 1, 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:01:12,753 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:12,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1948068073, now seen corresponding path program 1 times [2019-10-02 13:01:12,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:12,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:12,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:12,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:12,874 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 13:01:12,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:01:12,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:01:12,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:01:12,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:01:12,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:12,876 INFO L87 Difference]: Start difference. First operand 198723 states and 337112 transitions. Second operand 3 states. [2019-10-02 13:01:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:27,047 INFO L93 Difference]: Finished difference Result 374312 states and 629987 transitions. [2019-10-02 13:01:27,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:01:27,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 207 [2019-10-02 13:01:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:28,853 INFO L225 Difference]: With dead ends: 374312 [2019-10-02 13:01:28,853 INFO L226 Difference]: Without dead ends: 367293 [2019-10-02 13:01:28,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367293 states. [2019-10-02 13:01:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367293 to 367287. [2019-10-02 13:01:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367287 states. [2019-10-02 13:01:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367287 states to 367287 states and 614152 transitions. [2019-10-02 13:01:59,675 INFO L78 Accepts]: Start accepts. Automaton has 367287 states and 614152 transitions. Word has length 207 [2019-10-02 13:01:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:59,675 INFO L475 AbstractCegarLoop]: Abstraction has 367287 states and 614152 transitions. [2019-10-02 13:01:59,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:01:59,675 INFO L276 IsEmpty]: Start isEmpty. Operand 367287 states and 614152 transitions. [2019-10-02 13:02:00,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:02:00,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:00,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,037 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:00,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:00,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1013113723, now seen corresponding path program 1 times [2019-10-02 13:02:00,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:00,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:00,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:00,210 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 13:02:00,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:00,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:02:00,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:02:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:02:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:00,213 INFO L87 Difference]: Start difference. First operand 367287 states and 614152 transitions. Second operand 3 states. [2019-10-02 13:02:18,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:18,683 INFO L93 Difference]: Finished difference Result 375572 states and 625737 transitions. [2019-10-02 13:02:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:02:18,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-02 13:02:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:19,806 INFO L225 Difference]: With dead ends: 375572 [2019-10-02 13:02:19,806 INFO L226 Difference]: Without dead ends: 368817 [2019-10-02 13:02:19,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:02:20,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368817 states. [2019-10-02 13:02:49,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368817 to 366995. [2019-10-02 13:02:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366995 states. [2019-10-02 13:02:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366995 states to 366995 states and 613702 transitions. [2019-10-02 13:02:49,819 INFO L78 Accepts]: Start accepts. Automaton has 366995 states and 613702 transitions. Word has length 208 [2019-10-02 13:02:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:49,819 INFO L475 AbstractCegarLoop]: Abstraction has 366995 states and 613702 transitions. [2019-10-02 13:02:49,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:02:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 366995 states and 613702 transitions. [2019-10-02 13:02:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 13:02:58,420 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:58,421 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:02:58,421 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:58,421 INFO L82 PathProgramCache]: Analyzing trace with hash 443709034, now seen corresponding path program 1 times [2019-10-02 13:02:58,421 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:58,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:58,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:58,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:58,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:02:58,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:58,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:02:58,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:02:58,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:02:58,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:02:58,593 INFO L87 Difference]: Start difference. First operand 366995 states and 613702 transitions. Second operand 6 states. [2019-10-02 13:03:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:31,966 INFO L93 Difference]: Finished difference Result 728034 states and 1222310 transitions. [2019-10-02 13:03:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:03:31,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 350 [2019-10-02 13:03:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:34,778 INFO L225 Difference]: With dead ends: 728034 [2019-10-02 13:03:34,779 INFO L226 Difference]: Without dead ends: 721749 [2019-10-02 13:03:34,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:03:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721749 states. [2019-10-02 13:04:41,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721749 to 721628. [2019-10-02 13:04:41,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721628 states. [2019-10-02 13:04:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721628 states to 721628 states and 1213475 transitions. [2019-10-02 13:04:43,831 INFO L78 Accepts]: Start accepts. Automaton has 721628 states and 1213475 transitions. Word has length 350 [2019-10-02 13:04:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:43,831 INFO L475 AbstractCegarLoop]: Abstraction has 721628 states and 1213475 transitions. [2019-10-02 13:04:43,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:04:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 721628 states and 1213475 transitions. [2019-10-02 13:05:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 13:05:01,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:05:01,822 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:05:01,822 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:05:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:05:01,823 INFO L82 PathProgramCache]: Analyzing trace with hash 595975351, now seen corresponding path program 1 times [2019-10-02 13:05:01,823 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:05:01,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:05:01,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:01,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:05:01,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:05:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:05:02,044 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 13:05:02,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:05:02,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:05:02,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:05:02,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:05:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:05:02,045 INFO L87 Difference]: Start difference. First operand 721628 states and 1213475 transitions. Second operand 11 states. [2019-10-02 13:05:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:05:34,940 INFO L93 Difference]: Finished difference Result 733704 states and 1229940 transitions. [2019-10-02 13:05:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:05:34,941 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 351 [2019-10-02 13:05:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:05:37,041 INFO L225 Difference]: With dead ends: 733704 [2019-10-02 13:05:37,041 INFO L226 Difference]: Without dead ends: 720893 [2019-10-02 13:05:37,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:05:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720893 states. [2019-10-02 13:06:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720893 to 720807. [2019-10-02 13:06:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720807 states. [2019-10-02 13:06:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720807 states to 720807 states and 1212110 transitions. [2019-10-02 13:06:46,506 INFO L78 Accepts]: Start accepts. Automaton has 720807 states and 1212110 transitions. Word has length 351 [2019-10-02 13:06:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:06:46,506 INFO L475 AbstractCegarLoop]: Abstraction has 720807 states and 1212110 transitions. [2019-10-02 13:06:46,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:06:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 720807 states and 1212110 transitions. [2019-10-02 13:07:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-10-02 13:07:04,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:07:04,729 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:04,729 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:07:04,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:07:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash -654904501, now seen corresponding path program 1 times [2019-10-02 13:07:04,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:07:04,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:07:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:07:04,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:07:04,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:07:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:07:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 13:07:04,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:07:04,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:07:04,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:07:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:07:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:07:04,937 INFO L87 Difference]: Start difference. First operand 720807 states and 1212110 transitions. Second operand 7 states.