java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:52:43,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:52:43,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:52:43,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:52:43,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:52:43,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:52:43,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:52:43,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:52:43,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:52:43,586 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:52:43,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:52:43,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:52:43,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:52:43,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:52:43,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:52:43,603 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:52:43,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:52:43,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:52:43,612 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:52:43,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:52:43,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:52:43,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:52:43,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:52:43,623 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:52:43,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:52:43,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:52:43,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:52:43,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:52:43,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:52:43,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:52:43,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:52:43,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:52:43,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:52:43,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:52:43,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:52:43,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:52:43,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:52:43,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:52:43,632 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:52:43,633 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:52:43,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:52:43,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:52:43,649 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:52:43,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:52:43,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:52:43,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:52:43,651 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:52:43,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:52:43,652 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:52:43,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:52:43,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:52:43,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:52:43,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:52:43,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:52:43,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:52:43,653 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:52:43,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:52:43,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:52:43,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:52:43,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:52:43,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:52:43,654 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:52:43,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:52:43,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:52:43,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:52:43,655 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:52:43,655 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:52:43,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:52:43,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:52:43,656 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:52:43,656 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:52:43,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:52:43,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:52:43,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:52:43,706 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:52:43,707 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:52:43,708 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c [2019-10-02 13:52:43,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df169deb5/d7c1ddb68c9c4492962e6d77b0dd2404/FLAG5241478f0 [2019-10-02 13:52:44,427 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:52:44,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product34.cil.c [2019-10-02 13:52:44,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df169deb5/d7c1ddb68c9c4492962e6d77b0dd2404/FLAG5241478f0 [2019-10-02 13:52:44,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df169deb5/d7c1ddb68c9c4492962e6d77b0dd2404 [2019-10-02 13:52:44,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:52:44,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:52:44,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:52:44,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:52:44,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:52:44,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:52:44" (1/1) ... [2019-10-02 13:52:44,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ea4a5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:44, skipping insertion in model container [2019-10-02 13:52:44,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:52:44" (1/1) ... [2019-10-02 13:52:44,610 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:52:44,691 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:52:45,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:52:45,487 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:52:45,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:52:45,815 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:52:45,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45 WrapperNode [2019-10-02 13:52:45,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:52:45,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:52:45,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:52:45,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:52:45,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:45,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:45,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:45,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:45,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:45,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:46,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... [2019-10-02 13:52:46,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:52:46,057 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:52:46,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:52:46,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:52:46,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:52:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:52:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:52:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:52:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:52:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:52:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:52:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:52:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:52:46,148 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:52:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:52:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:52:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:52:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:52:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:52:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:52:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:52:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:52:46,150 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:52:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:52:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:52:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:52:46,151 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:52:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:52:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:52:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:52:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 13:52:46,152 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:52:46,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:52:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:52:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:52:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:52:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:52:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:52:46,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:52:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:52:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:52:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:52:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:52:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:52:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:52:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:52:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:52:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:52:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:52:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:52:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:52:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:52:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:52:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:52:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:52:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:52:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:52:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:52:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:52:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:52:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:52:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:52:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:52:46,159 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:52:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:52:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:52:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:52:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:52:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:52:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:52:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:52:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:52:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:52:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:52:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:52:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:52:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:52:46,163 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:52:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:52:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:52:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:52:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:52:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:52:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:52:46,165 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:52:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:52:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:52:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:52:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:52:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:52:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:52:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:52:46,167 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:52:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:52:46,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:52:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:52:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:52:46,169 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:52:46,170 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:52:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:52:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:52:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:52:46,172 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:52:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:52:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:52:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:52:46,173 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:52:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:52:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:52:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:52:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:52:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:52:46,174 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:52:46,175 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:52:46,176 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:52:46,179 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:52:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:52:46,180 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:52:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:52:46,188 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:52:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:52:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:52:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:52:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:52:46,189 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:52:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:52:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:52:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:52:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:52:46,190 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:52:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:52:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:52:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:52:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:52:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:52:46,191 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:52:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:52:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:52:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:52:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:52:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:52:46,192 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:52:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:52:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:52:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:52:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:52:46,193 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:52:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:52:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:52:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:52:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:52:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:52:46,194 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:52:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:52:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:52:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 13:52:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:52:46,195 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:52:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:52:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:52:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:52:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:52:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:52:46,196 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:52:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:52:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:52:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:52:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:52:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:52:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:52:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:52:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:52:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:52:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:52:46,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:52:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:52:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:52:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:52:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:52:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:52:46,199 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:52:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:52:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:52:46,200 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:52:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:52:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:52:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:52:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:52:46,202 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:52:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:52:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:52:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:52:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:52:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:52:46,203 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:52:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:52:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:52:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:52:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:52:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:52:46,204 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:52:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:52:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:52:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:52:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:52:46,205 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:52:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:52:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:52:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:52:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:52:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:52:46,206 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:52:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:52:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:52:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:52:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:52:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:52:46,207 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:52:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:52:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 13:52:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:52:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:52:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:52:46,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:52:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:52:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:52:48,551 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:52:48,551 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:52:48,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:52:48 BoogieIcfgContainer [2019-10-02 13:52:48,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:52:48,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:52:48,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:52:48,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:52:48,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:52:44" (1/3) ... [2019-10-02 13:52:48,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7ede2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:52:48, skipping insertion in model container [2019-10-02 13:52:48,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:52:45" (2/3) ... [2019-10-02 13:52:48,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7ede2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:52:48, skipping insertion in model container [2019-10-02 13:52:48,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:52:48" (3/3) ... [2019-10-02 13:52:48,564 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product34.cil.c [2019-10-02 13:52:48,575 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:52:48,586 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:52:48,605 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:52:48,660 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:52:48,661 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:52:48,661 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:52:48,661 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:52:48,662 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:52:48,664 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:52:48,664 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:52:48,665 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:52:48,665 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:52:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states. [2019-10-02 13:52:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:52:48,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:48,752 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:48,756 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2043582156, now seen corresponding path program 1 times [2019-10-02 13:52:48,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:48,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:48,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:52:49,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:49,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:52:49,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:52:49,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:52:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:52:49,539 INFO L87 Difference]: Start difference. First operand 647 states. Second operand 2 states. [2019-10-02 13:52:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:49,625 INFO L93 Difference]: Finished difference Result 980 states and 1322 transitions. [2019-10-02 13:52:49,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:52:49,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-10-02 13:52:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:49,669 INFO L225 Difference]: With dead ends: 980 [2019-10-02 13:52:49,669 INFO L226 Difference]: Without dead ends: 618 [2019-10-02 13:52:49,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:52:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-10-02 13:52:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-10-02 13:52:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 13:52:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 838 transitions. [2019-10-02 13:52:49,843 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 838 transitions. Word has length 191 [2019-10-02 13:52:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:49,846 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 838 transitions. [2019-10-02 13:52:49,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:52:49,846 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 838 transitions. [2019-10-02 13:52:49,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:52:49,859 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:49,860 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:49,860 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:49,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1146061920, now seen corresponding path program 1 times [2019-10-02 13:52:49,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:49,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:52:50,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:50,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:52:50,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:52:50,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:52:50,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:52:50,193 INFO L87 Difference]: Start difference. First operand 618 states and 838 transitions. Second operand 3 states. [2019-10-02 13:52:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:50,269 INFO L93 Difference]: Finished difference Result 963 states and 1284 transitions. [2019-10-02 13:52:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:52:50,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 13:52:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:50,281 INFO L225 Difference]: With dead ends: 963 [2019-10-02 13:52:50,281 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 13:52:50,295 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:52:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 13:52:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-10-02 13:52:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 13:52:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 840 transitions. [2019-10-02 13:52:50,337 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 840 transitions. Word has length 192 [2019-10-02 13:52:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:50,338 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 840 transitions. [2019-10-02 13:52:50,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:52:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 840 transitions. [2019-10-02 13:52:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:52:50,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:50,345 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:50,345 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:50,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1233594516, now seen corresponding path program 1 times [2019-10-02 13:52:50,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:50,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:50,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:50,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:50,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:50,570 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:52:50,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:50,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:52:50,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:52:50,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:52:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:52:50,572 INFO L87 Difference]: Start difference. First operand 620 states and 840 transitions. Second operand 3 states. [2019-10-02 13:52:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:50,603 INFO L93 Difference]: Finished difference Result 1218 states and 1681 transitions. [2019-10-02 13:52:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:52:50,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 13:52:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:50,608 INFO L225 Difference]: With dead ends: 1218 [2019-10-02 13:52:50,609 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 13:52:50,611 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:52:50,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 13:52:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 662. [2019-10-02 13:52:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-10-02 13:52:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 912 transitions. [2019-10-02 13:52:50,636 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 912 transitions. Word has length 198 [2019-10-02 13:52:50,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:50,636 INFO L475 AbstractCegarLoop]: Abstraction has 662 states and 912 transitions. [2019-10-02 13:52:50,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:52:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 912 transitions. [2019-10-02 13:52:50,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:52:50,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:50,641 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:50,641 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:50,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1272697570, now seen corresponding path program 1 times [2019-10-02 13:52:50,642 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:50,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:50,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:50,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:52:51,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:51,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:52:51,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:52:51,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:52:51,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:52:51,159 INFO L87 Difference]: Start difference. First operand 662 states and 912 transitions. Second operand 19 states. [2019-10-02 13:52:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:57,156 INFO L93 Difference]: Finished difference Result 2344 states and 3255 transitions. [2019-10-02 13:52:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 13:52:57,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-10-02 13:52:57,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:57,192 INFO L225 Difference]: With dead ends: 2344 [2019-10-02 13:52:57,193 INFO L226 Difference]: Without dead ends: 2015 [2019-10-02 13:52:57,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:52:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2019-10-02 13:52:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1978. [2019-10-02 13:52:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-10-02 13:52:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2751 transitions. [2019-10-02 13:52:57,325 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2751 transitions. Word has length 199 [2019-10-02 13:52:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:57,326 INFO L475 AbstractCegarLoop]: Abstraction has 1978 states and 2751 transitions. [2019-10-02 13:52:57,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:52:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2751 transitions. [2019-10-02 13:52:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:52:57,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:57,333 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:57,333 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:57,334 INFO L82 PathProgramCache]: Analyzing trace with hash -578893885, now seen corresponding path program 1 times [2019-10-02 13:52:57,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:57,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:57,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:52:57,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:57,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:52:57,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:52:57,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:52:57,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:52:57,652 INFO L87 Difference]: Start difference. First operand 1978 states and 2751 transitions. Second operand 13 states. [2019-10-02 13:52:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:58,309 INFO L93 Difference]: Finished difference Result 3495 states and 4856 transitions. [2019-10-02 13:52:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:52:58,310 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 200 [2019-10-02 13:52:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:58,327 INFO L225 Difference]: With dead ends: 3495 [2019-10-02 13:52:58,327 INFO L226 Difference]: Without dead ends: 2112 [2019-10-02 13:52:58,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:52:58,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2019-10-02 13:52:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2019-10-02 13:52:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2112 states. [2019-10-02 13:52:58,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2968 transitions. [2019-10-02 13:52:58,481 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2968 transitions. Word has length 200 [2019-10-02 13:52:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:58,481 INFO L475 AbstractCegarLoop]: Abstraction has 2112 states and 2968 transitions. [2019-10-02 13:52:58,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:52:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2968 transitions. [2019-10-02 13:52:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:52:58,493 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:58,493 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:58,494 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:58,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1707911070, now seen corresponding path program 1 times [2019-10-02 13:52:58,494 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:52:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:52:58,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:52:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:52:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:52:58,876 INFO L87 Difference]: Start difference. First operand 2112 states and 2968 transitions. Second operand 15 states. [2019-10-02 13:53:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:03,520 INFO L93 Difference]: Finished difference Result 3667 states and 5151 transitions. [2019-10-02 13:53:03,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 13:53:03,520 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2019-10-02 13:53:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:03,538 INFO L225 Difference]: With dead ends: 3667 [2019-10-02 13:53:03,539 INFO L226 Difference]: Without dead ends: 2230 [2019-10-02 13:53:03,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 13:53:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-10-02 13:53:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2193. [2019-10-02 13:53:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-10-02 13:53:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3108 transitions. [2019-10-02 13:53:03,691 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3108 transitions. Word has length 200 [2019-10-02 13:53:03,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:03,692 INFO L475 AbstractCegarLoop]: Abstraction has 2193 states and 3108 transitions. [2019-10-02 13:53:03,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:53:03,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3108 transitions. [2019-10-02 13:53:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:53:03,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:03,700 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:03,700 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1247468478, now seen corresponding path program 1 times [2019-10-02 13:53:03,701 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:03,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:03,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:03,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:53:03,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:03,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:03,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:03,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:03,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:03,884 INFO L87 Difference]: Start difference. First operand 2193 states and 3108 transitions. Second operand 5 states. [2019-10-02 13:53:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:04,001 INFO L93 Difference]: Finished difference Result 3332 states and 4650 transitions. [2019-10-02 13:53:04,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:53:04,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-02 13:53:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:04,015 INFO L225 Difference]: With dead ends: 3332 [2019-10-02 13:53:04,016 INFO L226 Difference]: Without dead ends: 1767 [2019-10-02 13:53:04,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:53:04,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1767 states. [2019-10-02 13:53:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1767 to 1767. [2019-10-02 13:53:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2019-10-02 13:53:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2502 transitions. [2019-10-02 13:53:04,125 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2502 transitions. Word has length 203 [2019-10-02 13:53:04,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:04,126 INFO L475 AbstractCegarLoop]: Abstraction has 1767 states and 2502 transitions. [2019-10-02 13:53:04,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2502 transitions. [2019-10-02 13:53:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:53:04,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:04,133 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:04,133 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash -430417368, now seen corresponding path program 1 times [2019-10-02 13:53:04,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:04,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:04,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:04,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:53:04,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:04,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:53:04,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:53:04,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:53:04,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:53:04,630 INFO L87 Difference]: Start difference. First operand 1767 states and 2502 transitions. Second operand 18 states. [2019-10-02 13:53:05,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:05,186 INFO L93 Difference]: Finished difference Result 2936 states and 4113 transitions. [2019-10-02 13:53:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:53:05,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 200 [2019-10-02 13:53:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:05,200 INFO L225 Difference]: With dead ends: 2936 [2019-10-02 13:53:05,200 INFO L226 Difference]: Without dead ends: 1799 [2019-10-02 13:53:05,205 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:53:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-10-02 13:53:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1797. [2019-10-02 13:53:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1797 states. [2019-10-02 13:53:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2531 transitions. [2019-10-02 13:53:05,291 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2531 transitions. Word has length 200 [2019-10-02 13:53:05,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:05,292 INFO L475 AbstractCegarLoop]: Abstraction has 1797 states and 2531 transitions. [2019-10-02 13:53:05,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:53:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2531 transitions. [2019-10-02 13:53:05,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:53:05,299 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:05,300 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:05,300 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:05,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1294591828, now seen corresponding path program 1 times [2019-10-02 13:53:05,301 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:05,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:05,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:05,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:05,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:05,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:05,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:05,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:05,509 INFO L87 Difference]: Start difference. First operand 1797 states and 2531 transitions. Second operand 5 states. [2019-10-02 13:53:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:06,931 INFO L93 Difference]: Finished difference Result 4842 states and 6862 transitions. [2019-10-02 13:53:06,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:53:06,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-10-02 13:53:06,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:06,968 INFO L225 Difference]: With dead ends: 4842 [2019-10-02 13:53:06,968 INFO L226 Difference]: Without dead ends: 4045 [2019-10-02 13:53:06,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:06,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4045 states. [2019-10-02 13:53:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4045 to 4031. [2019-10-02 13:53:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-10-02 13:53:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 5704 transitions. [2019-10-02 13:53:07,268 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 5704 transitions. Word has length 200 [2019-10-02 13:53:07,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:07,272 INFO L475 AbstractCegarLoop]: Abstraction has 4031 states and 5704 transitions. [2019-10-02 13:53:07,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 5704 transitions. [2019-10-02 13:53:07,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 13:53:07,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:07,287 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:07,288 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:07,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:07,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1274254453, now seen corresponding path program 1 times [2019-10-02 13:53:07,288 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:07,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:07,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:07,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:07,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:07,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:53:07,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:53:07,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:53:07,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:07,566 INFO L87 Difference]: Start difference. First operand 4031 states and 5704 transitions. Second operand 7 states. [2019-10-02 13:53:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:10,630 INFO L93 Difference]: Finished difference Result 13480 states and 20830 transitions. [2019-10-02 13:53:10,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:53:10,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-02 13:53:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:10,721 INFO L225 Difference]: With dead ends: 13480 [2019-10-02 13:53:10,722 INFO L226 Difference]: Without dead ends: 10373 [2019-10-02 13:53:10,746 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:53:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10373 states. [2019-10-02 13:53:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10373 to 10363. [2019-10-02 13:53:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10363 states. [2019-10-02 13:53:11,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10363 states to 10363 states and 15752 transitions. [2019-10-02 13:53:11,367 INFO L78 Accepts]: Start accepts. Automaton has 10363 states and 15752 transitions. Word has length 200 [2019-10-02 13:53:11,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:11,367 INFO L475 AbstractCegarLoop]: Abstraction has 10363 states and 15752 transitions. [2019-10-02 13:53:11,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:53:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10363 states and 15752 transitions. [2019-10-02 13:53:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:53:11,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:11,379 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:11,380 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1884885610, now seen corresponding path program 1 times [2019-10-02 13:53:11,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:11,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:11,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:12,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:12,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-02 13:53:12,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 13:53:12,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 13:53:12,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:53:12,027 INFO L87 Difference]: Start difference. First operand 10363 states and 15752 transitions. Second operand 28 states. [2019-10-02 13:53:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:13,223 INFO L93 Difference]: Finished difference Result 20153 states and 31327 transitions. [2019-10-02 13:53:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:53:13,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 201 [2019-10-02 13:53:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:13,291 INFO L225 Difference]: With dead ends: 20153 [2019-10-02 13:53:13,291 INFO L226 Difference]: Without dead ends: 10714 [2019-10-02 13:53:13,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:53:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10714 states. [2019-10-02 13:53:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10714 to 10689. [2019-10-02 13:53:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10689 states. [2019-10-02 13:53:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10689 states to 10689 states and 16211 transitions. [2019-10-02 13:53:14,060 INFO L78 Accepts]: Start accepts. Automaton has 10689 states and 16211 transitions. Word has length 201 [2019-10-02 13:53:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:14,061 INFO L475 AbstractCegarLoop]: Abstraction has 10689 states and 16211 transitions. [2019-10-02 13:53:14,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 13:53:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10689 states and 16211 transitions. [2019-10-02 13:53:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:53:14,069 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:14,070 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:14,070 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1510972251, now seen corresponding path program 1 times [2019-10-02 13:53:14,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:14,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:14,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:14,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:14,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:14,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:53:14,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:53:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:53:14,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:53:14,278 INFO L87 Difference]: Start difference. First operand 10689 states and 16211 transitions. Second operand 10 states. [2019-10-02 13:53:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:14,467 INFO L93 Difference]: Finished difference Result 10788 states and 16397 transitions. [2019-10-02 13:53:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:53:14,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2019-10-02 13:53:14,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:14,530 INFO L225 Difference]: With dead ends: 10788 [2019-10-02 13:53:14,530 INFO L226 Difference]: Without dead ends: 10785 [2019-10-02 13:53:14,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:53:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10785 states. [2019-10-02 13:53:15,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10785 to 10785. [2019-10-02 13:53:15,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10785 states. [2019-10-02 13:53:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 16363 transitions. [2019-10-02 13:53:15,070 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 16363 transitions. Word has length 205 [2019-10-02 13:53:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:15,071 INFO L475 AbstractCegarLoop]: Abstraction has 10785 states and 16363 transitions. [2019-10-02 13:53:15,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:53:15,071 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 16363 transitions. [2019-10-02 13:53:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 13:53:15,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:15,082 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:15,083 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -125913428, now seen corresponding path program 1 times [2019-10-02 13:53:15,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:15,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:15,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:15,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:15,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:15,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:15,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:53:15,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:53:15,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:53:15,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:15,968 INFO L87 Difference]: Start difference. First operand 10785 states and 16363 transitions. Second operand 5 states. [2019-10-02 13:53:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:16,222 INFO L93 Difference]: Finished difference Result 20853 states and 32089 transitions. [2019-10-02 13:53:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:53:16,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-02 13:53:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:16,277 INFO L225 Difference]: With dead ends: 20853 [2019-10-02 13:53:16,278 INFO L226 Difference]: Without dead ends: 11040 [2019-10-02 13:53:16,314 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:53:16,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11040 states. [2019-10-02 13:53:16,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11040 to 10889. [2019-10-02 13:53:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10889 states. [2019-10-02 13:53:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10889 states to 10889 states and 16480 transitions. [2019-10-02 13:53:16,884 INFO L78 Accepts]: Start accepts. Automaton has 10889 states and 16480 transitions. Word has length 210 [2019-10-02 13:53:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:16,885 INFO L475 AbstractCegarLoop]: Abstraction has 10889 states and 16480 transitions. [2019-10-02 13:53:16,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:53:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 10889 states and 16480 transitions. [2019-10-02 13:53:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 13:53:16,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:16,898 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:16,898 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:16,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:16,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1745370427, now seen corresponding path program 1 times [2019-10-02 13:53:16,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:16,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:16,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:16,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:16,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:53:17,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:17,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:53:17,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:53:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:53:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:53:17,111 INFO L87 Difference]: Start difference. First operand 10889 states and 16480 transitions. Second operand 6 states. [2019-10-02 13:53:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:18,229 INFO L93 Difference]: Finished difference Result 31862 states and 48911 transitions. [2019-10-02 13:53:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:53:18,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-02 13:53:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:18,333 INFO L225 Difference]: With dead ends: 31862 [2019-10-02 13:53:18,333 INFO L226 Difference]: Without dead ends: 21897 [2019-10-02 13:53:18,369 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:53:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21897 states. [2019-10-02 13:53:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21897 to 21567. [2019-10-02 13:53:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21567 states. [2019-10-02 13:53:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21567 states to 21567 states and 32621 transitions. [2019-10-02 13:53:19,370 INFO L78 Accepts]: Start accepts. Automaton has 21567 states and 32621 transitions. Word has length 211 [2019-10-02 13:53:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:19,371 INFO L475 AbstractCegarLoop]: Abstraction has 21567 states and 32621 transitions. [2019-10-02 13:53:19,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:53:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 21567 states and 32621 transitions. [2019-10-02 13:53:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:53:19,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:19,390 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:19,390 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1076037564, now seen corresponding path program 1 times [2019-10-02 13:53:19,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:19,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:53:19,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:19,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:53:19,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:53:19,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:53:19,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:53:19,749 INFO L87 Difference]: Start difference. First operand 21567 states and 32621 transitions. Second operand 8 states. [2019-10-02 13:53:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:22,012 INFO L93 Difference]: Finished difference Result 64602 states and 100962 transitions. [2019-10-02 13:53:22,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:53:22,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-10-02 13:53:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:22,310 INFO L225 Difference]: With dead ends: 64602 [2019-10-02 13:53:22,310 INFO L226 Difference]: Without dead ends: 44734 [2019-10-02 13:53:22,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:53:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44734 states. [2019-10-02 13:53:25,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44734 to 44583. [2019-10-02 13:53:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44583 states. [2019-10-02 13:53:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44583 states to 44583 states and 68307 transitions. [2019-10-02 13:53:25,912 INFO L78 Accepts]: Start accepts. Automaton has 44583 states and 68307 transitions. Word has length 230 [2019-10-02 13:53:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:25,913 INFO L475 AbstractCegarLoop]: Abstraction has 44583 states and 68307 transitions. [2019-10-02 13:53:25,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:53:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 44583 states and 68307 transitions. [2019-10-02 13:53:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:53:25,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:25,949 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:25,950 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:25,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash 661126540, now seen corresponding path program 1 times [2019-10-02 13:53:25,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:25,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:25,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:25,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:53:26,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:53:26,141 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:53:26,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:26,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 3150 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:53:26,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:53:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:53:27,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:53:27,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 13:53:27,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:53:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:53:27,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:53:27,062 INFO L87 Difference]: Start difference. First operand 44583 states and 68307 transitions. Second operand 18 states. [2019-10-02 13:53:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:30,977 INFO L93 Difference]: Finished difference Result 89476 states and 137178 transitions. [2019-10-02 13:53:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:53:30,977 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 231 [2019-10-02 13:53:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:31,356 INFO L225 Difference]: With dead ends: 89476 [2019-10-02 13:53:31,356 INFO L226 Difference]: Without dead ends: 44937 [2019-10-02 13:53:31,668 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:53:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44937 states. [2019-10-02 13:53:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44937 to 44729. [2019-10-02 13:53:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44729 states. [2019-10-02 13:53:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44729 states to 44729 states and 68502 transitions. [2019-10-02 13:53:34,838 INFO L78 Accepts]: Start accepts. Automaton has 44729 states and 68502 transitions. Word has length 231 [2019-10-02 13:53:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:34,838 INFO L475 AbstractCegarLoop]: Abstraction has 44729 states and 68502 transitions. [2019-10-02 13:53:34,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:53:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 44729 states and 68502 transitions. [2019-10-02 13:53:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:53:34,899 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:34,899 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:34,900 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash -633515775, now seen corresponding path program 1 times [2019-10-02 13:53:34,900 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:34,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:34,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:34,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:53:35,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:35,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:53:35,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:53:35,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:53:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:53:35,162 INFO L87 Difference]: Start difference. First operand 44729 states and 68502 transitions. Second operand 15 states. [2019-10-02 13:53:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:40,881 INFO L93 Difference]: Finished difference Result 76125 states and 119841 transitions. [2019-10-02 13:53:40,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:53:40,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 232 [2019-10-02 13:53:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:41,112 INFO L225 Difference]: With dead ends: 76125 [2019-10-02 13:53:41,112 INFO L226 Difference]: Without dead ends: 44498 [2019-10-02 13:53:41,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:53:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44498 states. [2019-10-02 13:53:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44498 to 43824. [2019-10-02 13:53:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43824 states. [2019-10-02 13:53:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43824 states to 43824 states and 66391 transitions. [2019-10-02 13:53:42,957 INFO L78 Accepts]: Start accepts. Automaton has 43824 states and 66391 transitions. Word has length 232 [2019-10-02 13:53:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:42,958 INFO L475 AbstractCegarLoop]: Abstraction has 43824 states and 66391 transitions. [2019-10-02 13:53:42,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:53:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 43824 states and 66391 transitions. [2019-10-02 13:53:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:53:42,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:42,989 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:42,989 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:42,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:42,989 INFO L82 PathProgramCache]: Analyzing trace with hash 618843452, now seen corresponding path program 1 times [2019-10-02 13:53:42,989 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:42,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:42,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:42,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:53:43,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:43,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:53:43,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:53:43,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:53:43,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:43,183 INFO L87 Difference]: Start difference. First operand 43824 states and 66391 transitions. Second operand 7 states. [2019-10-02 13:53:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:51,108 INFO L93 Difference]: Finished difference Result 129360 states and 199317 transitions. [2019-10-02 13:53:51,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:53:51,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-10-02 13:53:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:51,605 INFO L225 Difference]: With dead ends: 129360 [2019-10-02 13:53:51,605 INFO L226 Difference]: Without dead ends: 89164 [2019-10-02 13:53:54,166 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:53:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89164 states. [2019-10-02 13:53:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89164 to 87541. [2019-10-02 13:53:56,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87541 states. [2019-10-02 13:53:57,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87541 states to 87541 states and 132201 transitions. [2019-10-02 13:53:57,301 INFO L78 Accepts]: Start accepts. Automaton has 87541 states and 132201 transitions. Word has length 232 [2019-10-02 13:53:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:57,302 INFO L475 AbstractCegarLoop]: Abstraction has 87541 states and 132201 transitions. [2019-10-02 13:53:57,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:53:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 87541 states and 132201 transitions. [2019-10-02 13:53:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:53:57,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:57,352 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:53:57,353 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash -146252718, now seen corresponding path program 1 times [2019-10-02 13:53:57,353 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:57,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:57,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:53:57,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:57,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:53:57,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:53:57,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:53:57,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:53:57,552 INFO L87 Difference]: Start difference. First operand 87541 states and 132201 transitions. Second operand 7 states. [2019-10-02 13:54:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:08,696 INFO L93 Difference]: Finished difference Result 256929 states and 393226 transitions. [2019-10-02 13:54:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:54:08,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 233 [2019-10-02 13:54:08,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:09,776 INFO L225 Difference]: With dead ends: 256929 [2019-10-02 13:54:09,777 INFO L226 Difference]: Without dead ends: 176791 [2019-10-02 13:54:10,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:54:10,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176791 states. [2019-10-02 13:54:19,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176791 to 173153. [2019-10-02 13:54:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173153 states. [2019-10-02 13:54:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173153 states to 173153 states and 260185 transitions. [2019-10-02 13:54:20,075 INFO L78 Accepts]: Start accepts. Automaton has 173153 states and 260185 transitions. Word has length 233 [2019-10-02 13:54:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:20,076 INFO L475 AbstractCegarLoop]: Abstraction has 173153 states and 260185 transitions. [2019-10-02 13:54:20,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:54:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 173153 states and 260185 transitions. [2019-10-02 13:54:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:54:20,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:20,191 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:20,191 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1653334693, now seen corresponding path program 1 times [2019-10-02 13:54:20,191 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:20,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:20,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:24,275 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:54:24,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:54:24,276 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:54:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:24,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 3152 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:54:24,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:54:25,003 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:54:25,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:54:25,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:54:25,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:54:25,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:54:25,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:54:25,024 INFO L87 Difference]: Start difference. First operand 173153 states and 260185 transitions. Second operand 11 states. [2019-10-02 13:54:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:33,502 INFO L93 Difference]: Finished difference Result 389701 states and 589121 transitions. [2019-10-02 13:54:33,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:54:33,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 233 [2019-10-02 13:54:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:34,411 INFO L225 Difference]: With dead ends: 389701 [2019-10-02 13:54:34,411 INFO L226 Difference]: Without dead ends: 223456 [2019-10-02 13:54:34,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:54:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223456 states. [2019-10-02 13:54:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223456 to 219621. [2019-10-02 13:54:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219621 states. [2019-10-02 13:54:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219621 states to 219621 states and 323741 transitions. [2019-10-02 13:54:48,553 INFO L78 Accepts]: Start accepts. Automaton has 219621 states and 323741 transitions. Word has length 233 [2019-10-02 13:54:48,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:48,554 INFO L475 AbstractCegarLoop]: Abstraction has 219621 states and 323741 transitions. [2019-10-02 13:54:48,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:54:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 219621 states and 323741 transitions. [2019-10-02 13:54:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 13:54:48,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:48,627 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-10-02 13:54:48,627 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:48,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash 383157141, now seen corresponding path program 1 times [2019-10-02 13:54:48,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:48,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:48,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:48,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:54:48,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:48,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:48,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:48,771 INFO L87 Difference]: Start difference. First operand 219621 states and 323741 transitions. Second operand 3 states. [2019-10-02 13:55:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:00,925 INFO L93 Difference]: Finished difference Result 443059 states and 655681 transitions. [2019-10-02 13:55:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:00,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-02 13:55:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:01,761 INFO L225 Difference]: With dead ends: 443059 [2019-10-02 13:55:01,762 INFO L226 Difference]: Without dead ends: 223749 [2019-10-02 13:55:02,674 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:55:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223749 states. [2019-10-02 13:55:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223749 to 223701. [2019-10-02 13:55:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223701 states. [2019-10-02 13:55:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223701 states to 223701 states and 332189 transitions. [2019-10-02 13:55:16,125 INFO L78 Accepts]: Start accepts. Automaton has 223701 states and 332189 transitions. Word has length 260 [2019-10-02 13:55:16,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:16,126 INFO L475 AbstractCegarLoop]: Abstraction has 223701 states and 332189 transitions. [2019-10-02 13:55:16,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:16,126 INFO L276 IsEmpty]: Start isEmpty. Operand 223701 states and 332189 transitions. [2019-10-02 13:55:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 13:55:16,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:16,224 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:16,225 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash 965610398, now seen corresponding path program 1 times [2019-10-02 13:55:16,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:16,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:16,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:55:17,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:17,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:55:17,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:55:17,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:55:17,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:55:17,342 INFO L87 Difference]: Start difference. First operand 223701 states and 332189 transitions. Second operand 3 states. [2019-10-02 13:55:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:32,132 INFO L93 Difference]: Finished difference Result 454819 states and 679873 transitions. [2019-10-02 13:55:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:55:32,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-02 13:55:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:33,059 INFO L225 Difference]: With dead ends: 454819 [2019-10-02 13:55:33,059 INFO L226 Difference]: Without dead ends: 231429 [2019-10-02 13:55:33,464 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:55:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231429 states. [2019-10-02 13:55:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231429 to 231381. [2019-10-02 13:55:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231381 states. [2019-10-02 13:55:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231381 states to 231381 states and 347837 transitions. [2019-10-02 13:55:43,719 INFO L78 Accepts]: Start accepts. Automaton has 231381 states and 347837 transitions. Word has length 248 [2019-10-02 13:55:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:43,719 INFO L475 AbstractCegarLoop]: Abstraction has 231381 states and 347837 transitions. [2019-10-02 13:55:43,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:55:43,719 INFO L276 IsEmpty]: Start isEmpty. Operand 231381 states and 347837 transitions. [2019-10-02 13:55:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:55:43,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:43,850 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:43,850 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:43,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:43,851 INFO L82 PathProgramCache]: Analyzing trace with hash -533317648, now seen corresponding path program 1 times [2019-10-02 13:55:43,851 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:43,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:43,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:43,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:55:44,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:44,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:55:44,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:55:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:55:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:55:44,037 INFO L87 Difference]: Start difference. First operand 231381 states and 347837 transitions. Second operand 8 states. [2019-10-02 13:56:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:07,651 INFO L93 Difference]: Finished difference Result 699473 states and 1073733 transitions. [2019-10-02 13:56:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:56:07,651 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-10-02 13:56:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:17,810 INFO L225 Difference]: With dead ends: 699473 [2019-10-02 13:56:17,811 INFO L226 Difference]: Without dead ends: 468403 [2019-10-02 13:56:18,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:56:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468403 states. [2019-10-02 13:56:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468403 to 308362. [2019-10-02 13:56:34,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308362 states. [2019-10-02 13:56:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308362 states to 308362 states and 479866 transitions. [2019-10-02 13:56:46,215 INFO L78 Accepts]: Start accepts. Automaton has 308362 states and 479866 transitions. Word has length 243 [2019-10-02 13:56:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:46,215 INFO L475 AbstractCegarLoop]: Abstraction has 308362 states and 479866 transitions. [2019-10-02 13:56:46,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:56:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 308362 states and 479866 transitions. [2019-10-02 13:56:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-02 13:56:46,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:56:46,558 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:56:46,558 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:56:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:56:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash 37915707, now seen corresponding path program 1 times [2019-10-02 13:56:46,558 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:56:46,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:56:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:46,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:56:46,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:56:46,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:56:46,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:56:46,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:56:46,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:56:46,766 INFO L87 Difference]: Start difference. First operand 308362 states and 479866 transitions. Second operand 8 states. [2019-10-02 13:57:33,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:33,411 INFO L93 Difference]: Finished difference Result 936848 states and 1502172 transitions. [2019-10-02 13:57:33,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:57:33,412 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 250 [2019-10-02 13:57:33,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:37,658 INFO L225 Difference]: With dead ends: 936848 [2019-10-02 13:57:37,658 INFO L226 Difference]: Without dead ends: 628797 [2019-10-02 13:57:38,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:57:38,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628797 states. [2019-10-02 13:58:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628797 to 465086. [2019-10-02 13:58:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465086 states. [2019-10-02 13:58:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465086 states to 465086 states and 759507 transitions. [2019-10-02 13:58:30,561 INFO L78 Accepts]: Start accepts. Automaton has 465086 states and 759507 transitions. Word has length 250 [2019-10-02 13:58:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:30,562 INFO L475 AbstractCegarLoop]: Abstraction has 465086 states and 759507 transitions. [2019-10-02 13:58:30,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:58:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 465086 states and 759507 transitions. [2019-10-02 13:58:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 13:58:32,613 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:32,613 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:32,613 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:32,614 INFO L82 PathProgramCache]: Analyzing trace with hash -253596084, now seen corresponding path program 1 times [2019-10-02 13:58:32,614 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:32,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:32,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:32,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:58:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:32,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:58:32,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:58:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:58:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:58:32,808 INFO L87 Difference]: Start difference. First operand 465086 states and 759507 transitions. Second operand 8 states. [2019-10-02 13:59:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:51,474 INFO L93 Difference]: Finished difference Result 1418828 states and 2405271 transitions. [2019-10-02 13:59:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:59:51,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 245 [2019-10-02 13:59:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:57,079 INFO L225 Difference]: With dead ends: 1418828 [2019-10-02 13:59:57,079 INFO L226 Difference]: Without dead ends: 954053 [2019-10-02 13:59:59,207 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:59:59,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954053 states.