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_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:11:14,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:11:14,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:11:14,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:11:14,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:11:14,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:11:14,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:11:14,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:11:14,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:11:14,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:11:14,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:11:14,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:11:14,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:11:14,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:11:14,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:11:14,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:11:14,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:11:14,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:11:14,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:11:14,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:11:14,191 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:11:14,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:11:14,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:11:14,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:11:14,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:11:14,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:11:14,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:11:14,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:11:14,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:11:14,201 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:11:14,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:11:14,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:11:14,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:11:14,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:11:14,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:11:14,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:11:14,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:11:14,206 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:11:14,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:11:14,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:11:14,207 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:11:14,208 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 14:11:14,227 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:11:14,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:11:14,228 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:11:14,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:11:14,229 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:11:14,229 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:11:14,229 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:11:14,229 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:11:14,230 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:11:14,230 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:11:14,230 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:11:14,230 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:11:14,230 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:11:14,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:11:14,231 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:11:14,231 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:11:14,231 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:11:14,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:11:14,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:11:14,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:11:14,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:11:14,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:11:14,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:11:14,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:11:14,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:11:14,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:11:14,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:11:14,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:11:14,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:11:14,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:11:14,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:11:14,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:11:14,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:11:14,283 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:11:14,285 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product29.cil.c [2019-10-02 14:11:14,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e3be0f4/d4596e8e90054a42a2106ce534148f41/FLAG661613a46 [2019-10-02 14:11:15,025 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:11:15,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product29.cil.c [2019-10-02 14:11:15,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e3be0f4/d4596e8e90054a42a2106ce534148f41/FLAG661613a46 [2019-10-02 14:11:15,239 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e3be0f4/d4596e8e90054a42a2106ce534148f41 [2019-10-02 14:11:15,248 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:11:15,250 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:11:15,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:11:15,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:11:15,254 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:11:15,255 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:11:15" (1/1) ... [2019-10-02 14:11:15,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98cb841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:15, skipping insertion in model container [2019-10-02 14:11:15,258 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:11:15" (1/1) ... [2019-10-02 14:11:15,265 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:11:15,349 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:11:16,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:11:16,207 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:11:16,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:11:16,451 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:11:16,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16 WrapperNode [2019-10-02 14:11:16,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:11:16,454 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:11:16,454 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:11:16,454 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:11:16,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,515 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (1/1) ... [2019-10-02 14:11:16,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:11:16,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:11:16,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:11:16,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:11:16,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (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 14:11:16,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:11:16,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:11:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 14:11:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 14:11:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 14:11:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 14:11:16,763 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 14:11:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 14:11:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 14:11:16,764 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 14:11:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 14:11:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 14:11:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 14:11:16,765 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 14:11:16,766 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 14:11:16,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:11:16,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:11:16,766 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 14:11:16,766 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 14:11:16,767 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 14:11:16,767 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 14:11:16,767 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 14:11:16,767 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 14:11:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 14:11:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 14:11:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 14:11:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 14:11:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 14:11:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 14:11:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 14:11:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 14:11:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 14:11:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 14:11:16,770 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 14:11:16,770 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 14:11:16,770 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 14:11:16,770 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 14:11:16,771 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 14:11:16,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 14:11:16,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 14:11:16,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 14:11:16,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 14:11:16,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 14:11:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 14:11:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 14:11:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 14:11:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 14:11:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 14:11:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 14:11:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 14:11:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 14:11:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 14:11:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 14:11:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 14:11:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 14:11:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 14:11:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 14:11:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 14:11:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 14:11:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 14:11:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 14:11:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 14:11:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 14:11:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 14:11:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 14:11:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 14:11:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 14:11:16,776 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 14:11:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 14:11:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 14:11:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 14:11:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 14:11:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 14:11:16,777 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 14:11:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 14:11:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 14:11:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 14:11:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 14:11:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 14:11:16,778 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 14:11:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 14:11:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 14:11:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 14:11:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 14:11:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 14:11:16,779 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 14:11:16,780 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 14:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 14:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 14:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 14:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 14:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 14:11:16,781 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:11:16,782 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 14:11:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 14:11:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 14:11:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 14:11:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 14:11:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 14:11:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 14:11:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 14:11:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 14:11:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 14:11:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 14:11:16,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:11:16,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:11:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 14:11:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 14:11:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 14:11:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 14:11:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 14:11:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 14:11:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 14:11:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 14:11:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 14:11:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 14:11:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 14:11:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 14:11:16,787 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 14:11:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 14:11:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:11:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 14:11:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 14:11:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 14:11:16,788 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 14:11:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 14:11:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-10-02 14:11:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-10-02 14:11:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 14:11:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 14:11:16,789 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 14:11:16,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 14:11:16,791 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 14:11:16,792 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 14:11:16,793 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 14:11:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 14:11:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 14:11:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 14:11:16,794 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 14:11:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 14:11:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 14:11:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 14:11:16,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 14:11:16,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:11:16,796 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 14:11:16,796 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 14:11:16,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:11:16,796 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 14:11:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 14:11:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:11:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 14:11:16,797 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 14:11:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 14:11:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 14:11:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 14:11:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 14:11:16,798 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 14:11:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 14:11:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 14:11:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 14:11:16,799 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 14:11:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 14:11:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 14:11:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 14:11:16,800 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 14:11:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 14:11:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 14:11:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 14:11:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 14:11:16,801 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 14:11:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 14:11:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 14:11:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 14:11:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 14:11:16,802 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 14:11:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 14:11:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 14:11:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 14:11:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 14:11:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 14:11:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 14:11:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 14:11:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 14:11:16,804 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 14:11:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 14:11:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 14:11:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 14:11:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 14:11:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 14:11:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 14:11:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 14:11:16,806 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 14:11:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 14:11:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 14:11:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 14:11:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 14:11:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:11:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 14:11:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 14:11:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 14:11:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 14:11:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 14:11:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:11:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 14:11:16,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:11:19,198 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:11:19,199 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 14:11:19,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:11:19 BoogieIcfgContainer [2019-10-02 14:11:19,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:11:19,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:11:19,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:11:19,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:11:19,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:11:15" (1/3) ... [2019-10-02 14:11:19,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6c87cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:11:19, skipping insertion in model container [2019-10-02 14:11:19,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:11:16" (2/3) ... [2019-10-02 14:11:19,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f6c87cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:11:19, skipping insertion in model container [2019-10-02 14:11:19,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:11:19" (3/3) ... [2019-10-02 14:11:19,212 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product29.cil.c [2019-10-02 14:11:19,223 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:11:19,236 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:11:19,256 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:11:19,299 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:11:19,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:11:19,300 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:11:19,300 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:11:19,300 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:11:19,304 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:11:19,304 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:11:19,305 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:11:19,305 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:11:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states. [2019-10-02 14:11:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 14:11:19,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:19,395 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:19,397 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash 584994227, now seen corresponding path program 1 times [2019-10-02 14:11:19,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:19,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:19,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:11:20,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:20,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:11:20,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:11:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:11:20,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:11:20,196 INFO L87 Difference]: Start difference. First operand 606 states. Second operand 2 states. [2019-10-02 14:11:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:20,317 INFO L93 Difference]: Finished difference Result 853 states and 1161 transitions. [2019-10-02 14:11:20,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:11:20,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-10-02 14:11:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:20,357 INFO L225 Difference]: With dead ends: 853 [2019-10-02 14:11:20,357 INFO L226 Difference]: Without dead ends: 549 [2019-10-02 14:11:20,369 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 14:11:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-02 14:11:20,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2019-10-02 14:11:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-10-02 14:11:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 752 transitions. [2019-10-02 14:11:20,489 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 752 transitions. Word has length 167 [2019-10-02 14:11:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:20,491 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 752 transitions. [2019-10-02 14:11:20,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:11:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 752 transitions. [2019-10-02 14:11:20,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 14:11:20,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:20,497 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:20,497 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:20,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:20,498 INFO L82 PathProgramCache]: Analyzing trace with hash 758057620, now seen corresponding path program 1 times [2019-10-02 14:11:20,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:20,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:20,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:11:20,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:20,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:11:20,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:11:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:11:20,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:11:20,716 INFO L87 Difference]: Start difference. First operand 549 states and 752 transitions. Second operand 3 states. [2019-10-02 14:11:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:20,779 INFO L93 Difference]: Finished difference Result 836 states and 1126 transitions. [2019-10-02 14:11:20,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:11:20,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 14:11:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:20,784 INFO L225 Difference]: With dead ends: 836 [2019-10-02 14:11:20,785 INFO L226 Difference]: Without dead ends: 552 [2019-10-02 14:11:20,787 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 14:11:20,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-02 14:11:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 551. [2019-10-02 14:11:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-10-02 14:11:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 754 transitions. [2019-10-02 14:11:20,830 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 754 transitions. Word has length 168 [2019-10-02 14:11:20,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:20,832 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 754 transitions. [2019-10-02 14:11:20,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:11:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 754 transitions. [2019-10-02 14:11:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 14:11:20,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:20,839 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:20,839 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1115975232, now seen corresponding path program 1 times [2019-10-02 14:11:20,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:20,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:20,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:20,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:21,075 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:11:21,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:21,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:11:21,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:11:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:11:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:11:21,080 INFO L87 Difference]: Start difference. First operand 551 states and 754 transitions. Second operand 3 states. [2019-10-02 14:11:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:21,136 INFO L93 Difference]: Finished difference Result 1078 states and 1506 transitions. [2019-10-02 14:11:21,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:11:21,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-02 14:11:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:21,144 INFO L225 Difference]: With dead ends: 1078 [2019-10-02 14:11:21,144 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 14:11:21,146 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 14:11:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 14:11:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 591. [2019-10-02 14:11:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-02 14:11:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 823 transitions. [2019-10-02 14:11:21,208 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 823 transitions. Word has length 174 [2019-10-02 14:11:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:21,209 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 823 transitions. [2019-10-02 14:11:21,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:11:21,210 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 823 transitions. [2019-10-02 14:11:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 14:11:21,221 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:21,222 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:21,222 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:21,223 INFO L82 PathProgramCache]: Analyzing trace with hash 866228765, now seen corresponding path program 1 times [2019-10-02 14:11:21,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:21,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:21,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:21,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:21,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 14:11:21,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:11:21,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:11:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:11:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:11:21,579 INFO L87 Difference]: Start difference. First operand 591 states and 823 transitions. Second operand 3 states. [2019-10-02 14:11:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:21,629 INFO L93 Difference]: Finished difference Result 1003 states and 1385 transitions. [2019-10-02 14:11:21,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:11:21,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 14:11:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:21,639 INFO L225 Difference]: With dead ends: 1003 [2019-10-02 14:11:21,639 INFO L226 Difference]: Without dead ends: 732 [2019-10-02 14:11:21,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 14:11:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2019-10-02 14:11:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 731. [2019-10-02 14:11:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-02 14:11:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1020 transitions. [2019-10-02 14:11:21,687 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1020 transitions. Word has length 175 [2019-10-02 14:11:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:21,688 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1020 transitions. [2019-10-02 14:11:21,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:11:21,689 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1020 transitions. [2019-10-02 14:11:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 14:11:21,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:21,696 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:11:21,697 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1738374254, now seen corresponding path program 1 times [2019-10-02 14:11:21,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:21,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:11:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:22,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 14:11:22,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:11:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:11:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:11:22,135 INFO L87 Difference]: Start difference. First operand 731 states and 1020 transitions. Second operand 6 states. [2019-10-02 14:11:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:22,852 INFO L93 Difference]: Finished difference Result 1786 states and 2489 transitions. [2019-10-02 14:11:22,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:11:22,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 309 [2019-10-02 14:11:22,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:22,862 INFO L225 Difference]: With dead ends: 1786 [2019-10-02 14:11:22,862 INFO L226 Difference]: Without dead ends: 1413 [2019-10-02 14:11:22,864 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 14:11:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-10-02 14:11:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1402. [2019-10-02 14:11:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-10-02 14:11:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1976 transitions. [2019-10-02 14:11:22,986 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1976 transitions. Word has length 309 [2019-10-02 14:11:22,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:22,987 INFO L475 AbstractCegarLoop]: Abstraction has 1402 states and 1976 transitions. [2019-10-02 14:11:22,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:11:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1976 transitions. [2019-10-02 14:11:22,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 14:11:22,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:22,996 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:11:22,997 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:22,997 INFO L82 PathProgramCache]: Analyzing trace with hash 807957841, now seen corresponding path program 1 times [2019-10-02 14:11:22,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:22,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:23,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-10-02 14:11:23,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:23,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 14:11:23,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:11:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:11:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:11:23,281 INFO L87 Difference]: Start difference. First operand 1402 states and 1976 transitions. Second operand 11 states. [2019-10-02 14:11:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:23,747 INFO L93 Difference]: Finished difference Result 2145 states and 2965 transitions. [2019-10-02 14:11:23,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:11:23,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 310 [2019-10-02 14:11:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:23,756 INFO L225 Difference]: With dead ends: 2145 [2019-10-02 14:11:23,756 INFO L226 Difference]: Without dead ends: 1376 [2019-10-02 14:11:23,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 14:11:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-10-02 14:11:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1372. [2019-10-02 14:11:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-02 14:11:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1925 transitions. [2019-10-02 14:11:23,826 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1925 transitions. Word has length 310 [2019-10-02 14:11:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:23,826 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1925 transitions. [2019-10-02 14:11:23,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:11:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1925 transitions. [2019-10-02 14:11:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2019-10-02 14:11:23,837 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:23,838 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:11:23,838 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash -494275136, now seen corresponding path program 1 times [2019-10-02 14:11:23,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:23,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:11:24,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:24,379 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 14:11:24,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:25,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 3512 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:11:25,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:25,458 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:11:25,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:25,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 28 [2019-10-02 14:11:25,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 14:11:25,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 14:11:25,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2019-10-02 14:11:25,483 INFO L87 Difference]: Start difference. First operand 1372 states and 1925 transitions. Second operand 28 states. [2019-10-02 14:11:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:47,718 INFO L93 Difference]: Finished difference Result 8554 states and 12153 transitions. [2019-10-02 14:11:47,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-10-02 14:11:47,719 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 318 [2019-10-02 14:11:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:47,763 INFO L225 Difference]: With dead ends: 8554 [2019-10-02 14:11:47,764 INFO L226 Difference]: Without dead ends: 7218 [2019-10-02 14:11:47,778 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6613 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1235, Invalid=19071, Unknown=0, NotChecked=0, Total=20306 [2019-10-02 14:11:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7218 states. [2019-10-02 14:11:48,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7218 to 7085. [2019-10-02 14:11:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7085 states. [2019-10-02 14:11:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7085 states to 7085 states and 9937 transitions. [2019-10-02 14:11:48,186 INFO L78 Accepts]: Start accepts. Automaton has 7085 states and 9937 transitions. Word has length 318 [2019-10-02 14:11:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:48,187 INFO L475 AbstractCegarLoop]: Abstraction has 7085 states and 9937 transitions. [2019-10-02 14:11:48,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 14:11:48,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7085 states and 9937 transitions. [2019-10-02 14:11:48,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 14:11:48,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:48,217 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:11:48,218 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:48,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1311126383, now seen corresponding path program 1 times [2019-10-02 14:11:48,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:48,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:48,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:48,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:48,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-10-02 14:11:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:11:48,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 14:11:48,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:11:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:11:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:11:48,648 INFO L87 Difference]: Start difference. First operand 7085 states and 9937 transitions. Second operand 5 states. [2019-10-02 14:11:48,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:48,916 INFO L93 Difference]: Finished difference Result 12617 states and 17521 transitions. [2019-10-02 14:11:48,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:11:48,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 323 [2019-10-02 14:11:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:48,982 INFO L225 Difference]: With dead ends: 12617 [2019-10-02 14:11:48,982 INFO L226 Difference]: Without dead ends: 6918 [2019-10-02 14:11:49,019 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 14:11:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6918 states. [2019-10-02 14:11:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6918 to 6918. [2019-10-02 14:11:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6918 states. [2019-10-02 14:11:49,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 9678 transitions. [2019-10-02 14:11:49,422 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 9678 transitions. Word has length 323 [2019-10-02 14:11:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:49,423 INFO L475 AbstractCegarLoop]: Abstraction has 6918 states and 9678 transitions. [2019-10-02 14:11:49,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:11:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 9678 transitions. [2019-10-02 14:11:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-10-02 14:11:49,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:49,445 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:49,445 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:49,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:49,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1554140369, now seen corresponding path program 1 times [2019-10-02 14:11:49,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:49,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:49,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-10-02 14:11:49,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:49,868 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 14:11:50,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:51,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 3514 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:11:51,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:11:51,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:51,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-10-02 14:11:51,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 14:11:51,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 14:11:51,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-10-02 14:11:51,434 INFO L87 Difference]: Start difference. First operand 6918 states and 9678 transitions. Second operand 23 states. [2019-10-02 14:11:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:11:54,790 INFO L93 Difference]: Finished difference Result 14517 states and 20776 transitions. [2019-10-02 14:11:54,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:11:54,791 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 320 [2019-10-02 14:11:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:11:54,896 INFO L225 Difference]: With dead ends: 14517 [2019-10-02 14:11:54,896 INFO L226 Difference]: Without dead ends: 7574 [2019-10-02 14:11:54,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 14:11:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2019-10-02 14:11:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 7546. [2019-10-02 14:11:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7546 states. [2019-10-02 14:11:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7546 states to 7546 states and 10649 transitions. [2019-10-02 14:11:55,204 INFO L78 Accepts]: Start accepts. Automaton has 7546 states and 10649 transitions. Word has length 320 [2019-10-02 14:11:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:11:55,207 INFO L475 AbstractCegarLoop]: Abstraction has 7546 states and 10649 transitions. [2019-10-02 14:11:55,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 14:11:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 7546 states and 10649 transitions. [2019-10-02 14:11:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-02 14:11:55,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:11:55,230 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:11:55,231 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:11:55,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:11:55,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1052309081, now seen corresponding path program 1 times [2019-10-02 14:11:55,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:11:55,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:11:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:55,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:55,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:11:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-02 14:11:55,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:11:55,643 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:11:55,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:11:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:11:56,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 3515 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:11:56,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:11:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:11:56,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:11:56,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2019-10-02 14:11:56,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:11:56,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:11:56,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:11:56,532 INFO L87 Difference]: Start difference. First operand 7546 states and 10649 transitions. Second operand 24 states. [2019-10-02 14:12:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:15,651 INFO L93 Difference]: Finished difference Result 21996 states and 31216 transitions. [2019-10-02 14:12:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-02 14:12:15,652 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 321 [2019-10-02 14:12:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:15,728 INFO L225 Difference]: With dead ends: 21996 [2019-10-02 14:12:15,728 INFO L226 Difference]: Without dead ends: 13344 [2019-10-02 14:12:15,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5929 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1143, Invalid=16947, Unknown=0, NotChecked=0, Total=18090 [2019-10-02 14:12:15,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13344 states. [2019-10-02 14:12:16,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13344 to 12607. [2019-10-02 14:12:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12607 states. [2019-10-02 14:12:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12607 states to 12607 states and 17708 transitions. [2019-10-02 14:12:16,505 INFO L78 Accepts]: Start accepts. Automaton has 12607 states and 17708 transitions. Word has length 321 [2019-10-02 14:12:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:16,506 INFO L475 AbstractCegarLoop]: Abstraction has 12607 states and 17708 transitions. [2019-10-02 14:12:16,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:12:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12607 states and 17708 transitions. [2019-10-02 14:12:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 14:12:16,531 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:16,532 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:16,532 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:16,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:16,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2017906586, now seen corresponding path program 1 times [2019-10-02 14:12:16,533 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:16,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 14:12:16,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:12:16,918 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:12:17,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:17,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 3517 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:12:17,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:12:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:12:17,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:12:17,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2019-10-02 14:12:17,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 14:12:17,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 14:12:17,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-10-02 14:12:17,857 INFO L87 Difference]: Start difference. First operand 12607 states and 17708 transitions. Second operand 24 states. [2019-10-02 14:12:23,424 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-10-02 14:12:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:36,928 INFO L93 Difference]: Finished difference Result 34089 states and 48301 transitions. [2019-10-02 14:12:36,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-02 14:12:36,928 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 323 [2019-10-02 14:12:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:37,013 INFO L225 Difference]: With dead ends: 34089 [2019-10-02 14:12:37,014 INFO L226 Difference]: Without dead ends: 19710 [2019-10-02 14:12:37,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5929 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1143, Invalid=16947, Unknown=0, NotChecked=0, Total=18090 [2019-10-02 14:12:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19710 states. [2019-10-02 14:12:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19710 to 18088. [2019-10-02 14:12:38,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18088 states. [2019-10-02 14:12:38,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18088 states to 18088 states and 25335 transitions. [2019-10-02 14:12:38,115 INFO L78 Accepts]: Start accepts. Automaton has 18088 states and 25335 transitions. Word has length 323 [2019-10-02 14:12:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:38,116 INFO L475 AbstractCegarLoop]: Abstraction has 18088 states and 25335 transitions. [2019-10-02 14:12:38,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 14:12:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 18088 states and 25335 transitions. [2019-10-02 14:12:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-10-02 14:12:38,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:38,149 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:38,149 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash -917307711, now seen corresponding path program 1 times [2019-10-02 14:12:38,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:38,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:38,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:38,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:38,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-10-02 14:12:38,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:12:38,428 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:12:38,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:39,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 3518 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:12:39,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:12:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:12:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:12:39,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 14:12:39,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:12:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:12:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:12:39,244 INFO L87 Difference]: Start difference. First operand 18088 states and 25335 transitions. Second operand 14 states. [2019-10-02 14:12:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:12:51,060 INFO L93 Difference]: Finished difference Result 78054 states and 122698 transitions. [2019-10-02 14:12:51,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:12:51,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 325 [2019-10-02 14:12:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:12:51,404 INFO L225 Difference]: With dead ends: 78054 [2019-10-02 14:12:51,404 INFO L226 Difference]: Without dead ends: 60046 [2019-10-02 14:12:51,502 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 14:12:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60046 states. [2019-10-02 14:12:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60046 to 57120. [2019-10-02 14:12:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57120 states. [2019-10-02 14:12:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57120 states to 57120 states and 89636 transitions. [2019-10-02 14:12:53,937 INFO L78 Accepts]: Start accepts. Automaton has 57120 states and 89636 transitions. Word has length 325 [2019-10-02 14:12:53,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:12:53,938 INFO L475 AbstractCegarLoop]: Abstraction has 57120 states and 89636 transitions. [2019-10-02 14:12:53,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:12:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57120 states and 89636 transitions. [2019-10-02 14:12:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-02 14:12:53,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:12:53,999 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:12:53,999 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:12:54,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:12:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1521729291, now seen corresponding path program 1 times [2019-10-02 14:12:54,000 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:12:54,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:12:54,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:54,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:12:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 14:12:54,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:12:54,495 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:12:54,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:12:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:12:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 3519 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:12:55,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:12:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 14:12:55,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:12:55,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-10-02 14:12:55,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 14:12:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 14:12:55,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-10-02 14:12:55,364 INFO L87 Difference]: Start difference. First operand 57120 states and 89636 transitions. Second operand 31 states. [2019-10-02 14:13:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:03,789 INFO L93 Difference]: Finished difference Result 129247 states and 230603 transitions. [2019-10-02 14:13:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 14:13:03,790 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 326 [2019-10-02 14:13:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:04,150 INFO L225 Difference]: With dead ends: 129247 [2019-10-02 14:13:04,150 INFO L226 Difference]: Without dead ends: 67456 [2019-10-02 14:13:04,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=3929, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 14:13:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67456 states. [2019-10-02 14:13:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67456 to 64580. [2019-10-02 14:13:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64580 states. [2019-10-02 14:13:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64580 states to 64580 states and 100946 transitions. [2019-10-02 14:13:09,854 INFO L78 Accepts]: Start accepts. Automaton has 64580 states and 100946 transitions. Word has length 326 [2019-10-02 14:13:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:09,854 INFO L475 AbstractCegarLoop]: Abstraction has 64580 states and 100946 transitions. [2019-10-02 14:13:09,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 14:13:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 64580 states and 100946 transitions. [2019-10-02 14:13:09,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 14:13:09,884 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:09,885 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:13:09,885 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:09,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1176447950, now seen corresponding path program 1 times [2019-10-02 14:13:09,885 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:09,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:09,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:09,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:09,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 14:13:10,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:10,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 14:13:10,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:13:10,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:13:10,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:13:10,130 INFO L87 Difference]: Start difference. First operand 64580 states and 100946 transitions. Second operand 10 states. [2019-10-02 14:13:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:14,674 INFO L93 Difference]: Finished difference Result 128831 states and 212779 transitions. [2019-10-02 14:13:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:13:14,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 331 [2019-10-02 14:13:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:14,911 INFO L225 Difference]: With dead ends: 128831 [2019-10-02 14:13:14,911 INFO L226 Difference]: Without dead ends: 67220 [2019-10-02 14:13:15,049 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:13:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67220 states. [2019-10-02 14:13:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67220 to 65108. [2019-10-02 14:13:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65108 states. [2019-10-02 14:13:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65108 states to 65108 states and 101562 transitions. [2019-10-02 14:13:17,859 INFO L78 Accepts]: Start accepts. Automaton has 65108 states and 101562 transitions. Word has length 331 [2019-10-02 14:13:17,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:17,859 INFO L475 AbstractCegarLoop]: Abstraction has 65108 states and 101562 transitions. [2019-10-02 14:13:17,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:13:17,859 INFO L276 IsEmpty]: Start isEmpty. Operand 65108 states and 101562 transitions. [2019-10-02 14:13:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 14:13:17,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:17,895 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:17,895 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:17,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:17,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1642938934, now seen corresponding path program 1 times [2019-10-02 14:13:17,896 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:17,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:17,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:17,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 14:13:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:18,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:18,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:18,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:18,084 INFO L87 Difference]: Start difference. First operand 65108 states and 101562 transitions. Second operand 3 states. [2019-10-02 14:13:19,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:19,762 INFO L93 Difference]: Finished difference Result 130455 states and 203609 transitions. [2019-10-02 14:13:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:19,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 351 [2019-10-02 14:13:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:20,007 INFO L225 Difference]: With dead ends: 130455 [2019-10-02 14:13:20,007 INFO L226 Difference]: Without dead ends: 65436 [2019-10-02 14:13:20,153 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 14:13:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65436 states. [2019-10-02 14:13:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65436 to 65432. [2019-10-02 14:13:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65432 states. [2019-10-02 14:13:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65432 states to 65432 states and 102136 transitions. [2019-10-02 14:13:23,106 INFO L78 Accepts]: Start accepts. Automaton has 65432 states and 102136 transitions. Word has length 351 [2019-10-02 14:13:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:23,107 INFO L475 AbstractCegarLoop]: Abstraction has 65432 states and 102136 transitions. [2019-10-02 14:13:23,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 65432 states and 102136 transitions. [2019-10-02 14:13:23,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 14:13:23,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:23,149 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:23,149 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:23,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:23,150 INFO L82 PathProgramCache]: Analyzing trace with hash -685280261, now seen corresponding path program 1 times [2019-10-02 14:13:23,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:23,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:23,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:23,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:23,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 14:13:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:23,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:23,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:23,329 INFO L87 Difference]: Start difference. First operand 65432 states and 102136 transitions. Second operand 3 states. [2019-10-02 14:13:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:26,718 INFO L93 Difference]: Finished difference Result 131387 states and 205267 transitions. [2019-10-02 14:13:26,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:26,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-10-02 14:13:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:26,969 INFO L225 Difference]: With dead ends: 131387 [2019-10-02 14:13:26,969 INFO L226 Difference]: Without dead ends: 66044 [2019-10-02 14:13:27,109 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 14:13:27,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66044 states. [2019-10-02 14:13:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66044 to 66040. [2019-10-02 14:13:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66040 states. [2019-10-02 14:13:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66040 states to 66040 states and 103212 transitions. [2019-10-02 14:13:29,587 INFO L78 Accepts]: Start accepts. Automaton has 66040 states and 103212 transitions. Word has length 352 [2019-10-02 14:13:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:29,587 INFO L475 AbstractCegarLoop]: Abstraction has 66040 states and 103212 transitions. [2019-10-02 14:13:29,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:29,588 INFO L276 IsEmpty]: Start isEmpty. Operand 66040 states and 103212 transitions. [2019-10-02 14:13:29,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-10-02 14:13:29,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:29,630 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:29,630 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:29,631 INFO L82 PathProgramCache]: Analyzing trace with hash 273481932, now seen corresponding path program 1 times [2019-10-02 14:13:29,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:29,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:29,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-10-02 14:13:29,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:29,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:29,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:29,813 INFO L87 Difference]: Start difference. First operand 66040 states and 103212 transitions. Second operand 3 states. [2019-10-02 14:13:33,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:33,431 INFO L93 Difference]: Finished difference Result 133163 states and 208399 transitions. [2019-10-02 14:13:33,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:33,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 353 [2019-10-02 14:13:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:33,707 INFO L225 Difference]: With dead ends: 133163 [2019-10-02 14:13:33,708 INFO L226 Difference]: Without dead ends: 67212 [2019-10-02 14:13:33,864 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 14:13:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67212 states. [2019-10-02 14:13:36,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67212 to 67208. [2019-10-02 14:13:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67208 states. [2019-10-02 14:13:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67208 states to 67208 states and 105252 transitions. [2019-10-02 14:13:36,568 INFO L78 Accepts]: Start accepts. Automaton has 67208 states and 105252 transitions. Word has length 353 [2019-10-02 14:13:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:36,569 INFO L475 AbstractCegarLoop]: Abstraction has 67208 states and 105252 transitions. [2019-10-02 14:13:36,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 67208 states and 105252 transitions. [2019-10-02 14:13:36,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-10-02 14:13:36,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:36,605 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:36,605 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:36,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:36,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1223853840, now seen corresponding path program 1 times [2019-10-02 14:13:36,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:36,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 14:13:36,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:36,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:36,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:36,809 INFO L87 Difference]: Start difference. First operand 67208 states and 105252 transitions. Second operand 3 states. [2019-10-02 14:13:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:39,239 INFO L93 Difference]: Finished difference Result 136571 states and 214343 transitions. [2019-10-02 14:13:39,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:39,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-10-02 14:13:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:39,512 INFO L225 Difference]: With dead ends: 136571 [2019-10-02 14:13:39,512 INFO L226 Difference]: Without dead ends: 69452 [2019-10-02 14:13:39,664 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 14:13:39,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69452 states. [2019-10-02 14:13:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69452 to 69448. [2019-10-02 14:13:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69448 states. [2019-10-02 14:13:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69448 states to 69448 states and 109124 transitions. [2019-10-02 14:13:45,386 INFO L78 Accepts]: Start accepts. Automaton has 69448 states and 109124 transitions. Word has length 372 [2019-10-02 14:13:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:45,386 INFO L475 AbstractCegarLoop]: Abstraction has 69448 states and 109124 transitions. [2019-10-02 14:13:45,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 69448 states and 109124 transitions. [2019-10-02 14:13:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-10-02 14:13:45,436 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:45,437 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:13:45,437 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:45,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527543, now seen corresponding path program 1 times [2019-10-02 14:13:45,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:45,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:45,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 14:13:45,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:13:45,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:13:45,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:13:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:13:45,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:13:45,644 INFO L87 Difference]: Start difference. First operand 69448 states and 109124 transitions. Second operand 3 states. [2019-10-02 14:13:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:13:48,045 INFO L93 Difference]: Finished difference Result 143355 states and 226055 transitions. [2019-10-02 14:13:48,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:13:48,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-10-02 14:13:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:13:48,342 INFO L225 Difference]: With dead ends: 143355 [2019-10-02 14:13:48,342 INFO L226 Difference]: Without dead ends: 73996 [2019-10-02 14:13:48,505 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 14:13:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73996 states. [2019-10-02 14:13:53,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73996 to 73992. [2019-10-02 14:13:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73992 states. [2019-10-02 14:13:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73992 states to 73992 states and 116900 transitions. [2019-10-02 14:13:54,279 INFO L78 Accepts]: Start accepts. Automaton has 73992 states and 116900 transitions. Word has length 373 [2019-10-02 14:13:54,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:13:54,279 INFO L475 AbstractCegarLoop]: Abstraction has 73992 states and 116900 transitions. [2019-10-02 14:13:54,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:13:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 73992 states and 116900 transitions. [2019-10-02 14:13:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 14:13:54,331 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:13:54,331 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:13:54,331 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:13:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:13:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1397188337, now seen corresponding path program 1 times [2019-10-02 14:13:54,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:13:54,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:13:54,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:54,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:54,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:13:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-02 14:13:54,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:13:54,514 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:13:55,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:13:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:13:55,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 3562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:13:55,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:13:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-02 14:13:55,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:13:55,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-02 14:13:55,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:13:55,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:13:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:13:55,733 INFO L87 Difference]: Start difference. First operand 73992 states and 116900 transitions. Second operand 9 states. [2019-10-02 14:14:03,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:03,017 INFO L93 Difference]: Finished difference Result 239197 states and 384258 transitions. [2019-10-02 14:14:03,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 14:14:03,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 336 [2019-10-02 14:14:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:03,645 INFO L225 Difference]: With dead ends: 239197 [2019-10-02 14:14:03,645 INFO L226 Difference]: Without dead ends: 174707 [2019-10-02 14:14:03,823 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:14:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174707 states. [2019-10-02 14:14:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174707 to 171141. [2019-10-02 14:14:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171141 states. [2019-10-02 14:14:15,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171141 states to 171141 states and 271963 transitions. [2019-10-02 14:14:15,374 INFO L78 Accepts]: Start accepts. Automaton has 171141 states and 271963 transitions. Word has length 336 [2019-10-02 14:14:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:15,375 INFO L475 AbstractCegarLoop]: Abstraction has 171141 states and 271963 transitions. [2019-10-02 14:14:15,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:14:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 171141 states and 271963 transitions. [2019-10-02 14:14:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 14:14:15,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:15,477 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:15,477 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:15,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 680683568, now seen corresponding path program 1 times [2019-10-02 14:14:15,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:15,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:15,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:15,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:15,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 14:14:15,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:15,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:14:15,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:14:15,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:14:15,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:14:15,662 INFO L87 Difference]: Start difference. First operand 171141 states and 271963 transitions. Second operand 3 states. [2019-10-02 14:14:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:28,643 INFO L93 Difference]: Finished difference Result 359035 states and 574405 transitions. [2019-10-02 14:14:28,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:14:28,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-10-02 14:14:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:29,278 INFO L225 Difference]: With dead ends: 359035 [2019-10-02 14:14:29,278 INFO L226 Difference]: Without dead ends: 188047 [2019-10-02 14:14:29,594 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 14:14:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188047 states. [2019-10-02 14:14:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188047 to 188039. [2019-10-02 14:14:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188039 states. [2019-10-02 14:14:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188039 states to 188039 states and 302108 transitions. [2019-10-02 14:14:37,407 INFO L78 Accepts]: Start accepts. Automaton has 188039 states and 302108 transitions. Word has length 374 [2019-10-02 14:14:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:14:37,407 INFO L475 AbstractCegarLoop]: Abstraction has 188039 states and 302108 transitions. [2019-10-02 14:14:37,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:14:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 188039 states and 302108 transitions. [2019-10-02 14:14:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-10-02 14:14:37,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:14:37,585 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:14:37,585 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:14:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:14:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1746256761, now seen corresponding path program 1 times [2019-10-02 14:14:37,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:14:37,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:14:37,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:37,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:14:37,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:14:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:14:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 14:14:37,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:14:37,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 14:14:37,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 14:14:37,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 14:14:37,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 14:14:37,777 INFO L87 Difference]: Start difference. First operand 188039 states and 302108 transitions. Second operand 7 states. [2019-10-02 14:14:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:14:48,961 INFO L93 Difference]: Finished difference Result 375968 states and 605648 transitions. [2019-10-02 14:14:48,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:14:48,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 375 [2019-10-02 14:14:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:14:49,657 INFO L225 Difference]: With dead ends: 375968 [2019-10-02 14:14:49,658 INFO L226 Difference]: Without dead ends: 188111 [2019-10-02 14:14:50,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:14:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188111 states. [2019-10-02 14:15:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188111 to 188111. [2019-10-02 14:15:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188111 states. [2019-10-02 14:15:02,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188111 states to 188111 states and 302196 transitions. [2019-10-02 14:15:02,794 INFO L78 Accepts]: Start accepts. Automaton has 188111 states and 302196 transitions. Word has length 375 [2019-10-02 14:15:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:02,795 INFO L475 AbstractCegarLoop]: Abstraction has 188111 states and 302196 transitions. [2019-10-02 14:15:02,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 14:15:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 188111 states and 302196 transitions. [2019-10-02 14:15:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-10-02 14:15:02,965 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:02,965 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:02,965 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash 653045845, now seen corresponding path program 1 times [2019-10-02 14:15:02,966 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:02,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:02,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:02,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 14:15:03,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:03,219 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:04,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 3754 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:15:04,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 14:15:04,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:15:04,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 14:15:04,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:15:04,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:15:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:15:04,819 INFO L87 Difference]: Start difference. First operand 188111 states and 302196 transitions. Second operand 10 states. [2019-10-02 14:15:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:19,575 INFO L93 Difference]: Finished difference Result 341055 states and 542968 transitions. [2019-10-02 14:15:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:15:19,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 364 [2019-10-02 14:15:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:20,368 INFO L225 Difference]: With dead ends: 341055 [2019-10-02 14:15:20,368 INFO L226 Difference]: Without dead ends: 189814 [2019-10-02 14:15:20,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:15:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189814 states. [2019-10-02 14:15:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189814 to 189690. [2019-10-02 14:15:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189690 states. [2019-10-02 14:15:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189690 states to 189690 states and 303149 transitions. [2019-10-02 14:15:28,506 INFO L78 Accepts]: Start accepts. Automaton has 189690 states and 303149 transitions. Word has length 364 [2019-10-02 14:15:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:28,506 INFO L475 AbstractCegarLoop]: Abstraction has 189690 states and 303149 transitions. [2019-10-02 14:15:28,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:15:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 189690 states and 303149 transitions. [2019-10-02 14:15:28,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-10-02 14:15:28,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:28,664 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:15:28,665 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -76305558, now seen corresponding path program 1 times [2019-10-02 14:15:28,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:28,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:29,556 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-02 14:15:29,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:15:29,557 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:15:29,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:30,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 3810 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:15:30,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:15:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-02 14:15:30,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:15:30,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-10-02 14:15:30,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 14:15:30,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 14:15:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-10-02 14:15:30,450 INFO L87 Difference]: Start difference. First operand 189690 states and 303149 transitions. Second operand 15 states. [2019-10-02 14:15:41,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:15:41,677 INFO L93 Difference]: Finished difference Result 348095 states and 551231 transitions. [2019-10-02 14:15:41,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 14:15:41,677 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 382 [2019-10-02 14:15:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:15:42,391 INFO L225 Difference]: With dead ends: 348095 [2019-10-02 14:15:42,392 INFO L226 Difference]: Without dead ends: 196390 [2019-10-02 14:15:42,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2019-10-02 14:15:42,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196390 states. [2019-10-02 14:15:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196390 to 195220. [2019-10-02 14:15:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195220 states. [2019-10-02 14:15:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195220 states to 195220 states and 312438 transitions. [2019-10-02 14:15:53,130 INFO L78 Accepts]: Start accepts. Automaton has 195220 states and 312438 transitions. Word has length 382 [2019-10-02 14:15:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:15:53,131 INFO L475 AbstractCegarLoop]: Abstraction has 195220 states and 312438 transitions. [2019-10-02 14:15:53,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 14:15:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 195220 states and 312438 transitions. [2019-10-02 14:15:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-10-02 14:15:53,325 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:15:53,325 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:15:53,326 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:15:53,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:15:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1608819564, now seen corresponding path program 1 times [2019-10-02 14:15:53,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:15:53,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:15:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:53,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:15:53,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:15:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:15:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 14:15:58,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:15:58,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:15:58,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:15:58,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:15:58,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:15:58,828 INFO L87 Difference]: Start difference. First operand 195220 states and 312438 transitions. Second operand 8 states. [2019-10-02 14:16:15,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:16:15,517 INFO L93 Difference]: Finished difference Result 585290 states and 973862 transitions. [2019-10-02 14:16:15,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:16:15,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 431 [2019-10-02 14:16:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:16:17,079 INFO L225 Difference]: With dead ends: 585290 [2019-10-02 14:16:17,079 INFO L226 Difference]: Without dead ends: 390751 [2019-10-02 14:16:17,530 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 14:16:17,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390751 states. [2019-10-02 14:16:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390751 to 351081. [2019-10-02 14:16:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351081 states. [2019-10-02 14:16:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351081 states to 351081 states and 582296 transitions. [2019-10-02 14:16:45,918 INFO L78 Accepts]: Start accepts. Automaton has 351081 states and 582296 transitions. Word has length 431 [2019-10-02 14:16:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:16:45,919 INFO L475 AbstractCegarLoop]: Abstraction has 351081 states and 582296 transitions. [2019-10-02 14:16:45,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:16:45,919 INFO L276 IsEmpty]: Start isEmpty. Operand 351081 states and 582296 transitions. [2019-10-02 14:16:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-10-02 14:16:46,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:16:46,424 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:16:46,424 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:16:46,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:16:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1175370473, now seen corresponding path program 1 times [2019-10-02 14:16:46,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:16:46,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:16:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:46,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:16:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:16:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:16:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-02 14:16:46,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:16:46,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 14:16:46,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:16:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:16:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:16:46,660 INFO L87 Difference]: Start difference. First operand 351081 states and 582296 transitions. Second operand 8 states. [2019-10-02 14:17:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:17:34,148 INFO L93 Difference]: Finished difference Result 1045785 states and 1804152 transitions. [2019-10-02 14:17:34,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:17:34,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 419 [2019-10-02 14:17:34,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:17:38,026 INFO L225 Difference]: With dead ends: 1045785 [2019-10-02 14:17:38,026 INFO L226 Difference]: Without dead ends: 699465 [2019-10-02 14:17:38,872 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 14:17:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699465 states. [2019-10-02 14:18:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699465 to 658963. [2019-10-02 14:18:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658963 states. [2019-10-02 14:18:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658963 states to 658963 states and 1131802 transitions. [2019-10-02 14:18:53,795 INFO L78 Accepts]: Start accepts. Automaton has 658963 states and 1131802 transitions. Word has length 419 [2019-10-02 14:18:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:18:53,795 INFO L475 AbstractCegarLoop]: Abstraction has 658963 states and 1131802 transitions. [2019-10-02 14:18:53,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:18:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 658963 states and 1131802 transitions. [2019-10-02 14:18:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-10-02 14:18:54,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:18:54,963 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:18:54,963 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:18:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:18:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2120269658, now seen corresponding path program 1 times [2019-10-02 14:18:54,963 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:18:54,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:18:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:54,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:18:54,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:18:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat