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_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:58:26,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:58:26,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:58:26,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:58:26,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:58:26,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:58:26,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:58:26,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:58:26,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:58:26,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:58:26,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:58:26,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:58:26,044 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:58:26,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:58:26,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:58:26,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:58:26,048 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:58:26,049 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:58:26,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:58:26,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:58:26,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:58:26,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:58:26,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:58:26,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:58:26,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:58:26,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:58:26,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:58:26,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:58:26,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:58:26,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:58:26,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:58:26,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:58:26,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:58:26,065 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:58:26,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:58:26,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:58:26,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:58:26,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:58:26,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:58:26,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:58:26,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:58:26,069 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-09-08 05:58:26,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:58:26,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:58:26,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:58:26,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:58:26,086 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:58:26,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:58:26,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:58:26,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:58:26,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:58:26,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:58:26,087 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:58:26,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:58:26,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:58:26,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:58:26,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:58:26,088 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:58:26,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:58:26,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:58:26,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:58:26,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:58:26,089 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:58:26,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:58:26,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:58:26,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:58:26,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:58:26,090 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:58:26,090 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:58:26,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:58:26,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:58:26,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:58:26,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:58:26,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:58:26,139 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:58:26,139 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:58:26,140 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec9_product32.cil.c [2019-09-08 05:58:26,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7404fc422/026e6f94e44842869d72fb8dc2b1615d/FLAGd280a2de5 [2019-09-08 05:58:26,827 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:58:26,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec9_product32.cil.c [2019-09-08 05:58:26,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7404fc422/026e6f94e44842869d72fb8dc2b1615d/FLAGd280a2de5 [2019-09-08 05:58:27,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7404fc422/026e6f94e44842869d72fb8dc2b1615d [2019-09-08 05:58:27,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:58:27,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:58:27,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:58:27,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:58:27,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:58:27,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:58:27" (1/1) ... [2019-09-08 05:58:27,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4dbc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:27, skipping insertion in model container [2019-09-08 05:58:27,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:58:27" (1/1) ... [2019-09-08 05:58:27,055 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:58:27,139 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:58:27,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:58:27,858 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:58:28,002 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:58:28,114 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:58:28,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28 WrapperNode [2019-09-08 05:58:28,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:58:28,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:58:28,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:58:28,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:58:28,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (1/1) ... [2019-09-08 05:58:28,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:58:28,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:58:28,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:58:28,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:58:28,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (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-09-08 05:58:28,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:58:28,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:58:28,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:58:28,380 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:58:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:58:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 05:58:28,381 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:58:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:58:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:58:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:58:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:58:28,382 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:58:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:58:28,383 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:58:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:58:28,384 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:58:28,386 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:58:28,386 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:58:28,386 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:58:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:58:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:58:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:58:28,389 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:58:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:58:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 05:58:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:58:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:58:28,390 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:58:28,391 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:58:28,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:58:28,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:58:28,392 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:58:28,392 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:58:28,392 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:58:28,393 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:58:28,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:58:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:58:28,396 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:58:28,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:58:28,396 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:58:28,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:58:28,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:58:28,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:58:28,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:58:28,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:58:28,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:58:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:58:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:58:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:58:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:58:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:58:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:58:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:58:28,399 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:58:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:58:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:58:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:58:28,400 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:58:28,401 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:58:28,401 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:58:28,402 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:58:28,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:58:28,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:58:28,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:58:28,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:58:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:58:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:58:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:58:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:58:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:58:28,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:58:28,405 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:58:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:58:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:58:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:58:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:58:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:58:28,406 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:58:28,407 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:58:28,407 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:58:28,407 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:58:28,407 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:58:28,408 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:58:28,408 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 05:58:28,408 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:58:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:58:28,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:58:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:58:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:58:28,409 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:58:28,410 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:58:28,410 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:58:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:58:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:58:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:58:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:58:28,411 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:58:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:58:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:58:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:58:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 05:58:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:58:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 05:58:28,419 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:58:28,426 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:58:28,426 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:58:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:58:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:58:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:58:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:58:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:58:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:58:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:58:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:58:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:58:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:58:28,431 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:58:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:58:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:58:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:58:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:58:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:58:28,432 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:58:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:58:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:58:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:58:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:58:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:58:28,433 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:58:28,434 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:58:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:58:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:58:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 05:58:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:58:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:58:28,435 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__2 [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:58:28,436 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:58:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptForward_spec__1 [2019-09-08 05:58:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:58:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:58:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:58:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:58:28,437 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:58:28,438 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:58:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:58:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:58:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:58:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:58:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:58:28,439 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:58:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:58:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:58:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:58:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:58:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:58:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:58:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:58:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:58:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:58:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:58:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:58:28,442 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:58:28,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:58:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:58:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:58:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:58:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:58:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:58:28,444 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:58:28,445 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:58:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:58:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:58:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:58:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:58:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:58:28,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:58:28,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:58:30,634 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:58:30,635 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:58:30,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:58:30 BoogieIcfgContainer [2019-09-08 05:58:30,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:58:30,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:58:30,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:58:30,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:58:30,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:58:27" (1/3) ... [2019-09-08 05:58:30,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fb261e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:58:30, skipping insertion in model container [2019-09-08 05:58:30,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:58:28" (2/3) ... [2019-09-08 05:58:30,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fb261e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:58:30, skipping insertion in model container [2019-09-08 05:58:30,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:58:30" (3/3) ... [2019-09-08 05:58:30,646 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec9_product32.cil.c [2019-09-08 05:58:30,659 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:58:30,677 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:58:30,695 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:58:30,743 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:58:30,744 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:58:30,744 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:58:30,746 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:58:30,747 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:58:30,747 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:58:30,747 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:58:30,747 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:58:30,748 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:58:30,791 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states. [2019-09-08 05:58:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 05:58:30,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:30,825 INFO L399 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-09-08 05:58:30,831 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1195808047, now seen corresponding path program 1 times [2019-09-08 05:58:30,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:58:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:31,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:58:31,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:58:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:58:31,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:58:31,596 INFO L87 Difference]: Start difference. First operand 641 states. Second operand 2 states. [2019-09-08 05:58:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:31,731 INFO L93 Difference]: Finished difference Result 912 states and 1235 transitions. [2019-09-08 05:58:31,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:58:31,733 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 167 [2019-09-08 05:58:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:31,769 INFO L225 Difference]: With dead ends: 912 [2019-09-08 05:58:31,769 INFO L226 Difference]: Without dead ends: 584 [2019-09-08 05:58:31,781 INFO L628 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-09-08 05:58:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2019-09-08 05:58:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2019-09-08 05:58:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-09-08 05:58:31,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 796 transitions. [2019-09-08 05:58:31,921 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 796 transitions. Word has length 167 [2019-09-08 05:58:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:31,924 INFO L475 AbstractCegarLoop]: Abstraction has 584 states and 796 transitions. [2019-09-08 05:58:31,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:58:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 796 transitions. [2019-09-08 05:58:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 05:58:31,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:31,929 INFO L399 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-09-08 05:58:31,929 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:31,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1792136893, now seen corresponding path program 1 times [2019-09-08 05:58:31,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:31,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:31,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:31,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:58:32,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:32,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:32,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:32,305 INFO L87 Difference]: Start difference. First operand 584 states and 796 transitions. Second operand 3 states. [2019-09-08 05:58:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:32,364 INFO L93 Difference]: Finished difference Result 895 states and 1200 transitions. [2019-09-08 05:58:32,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:32,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 05:58:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:32,377 INFO L225 Difference]: With dead ends: 895 [2019-09-08 05:58:32,377 INFO L226 Difference]: Without dead ends: 587 [2019-09-08 05:58:32,380 INFO L628 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-09-08 05:58:32,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-09-08 05:58:32,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 586. [2019-09-08 05:58:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-09-08 05:58:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 798 transitions. [2019-09-08 05:58:32,423 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 798 transitions. Word has length 168 [2019-09-08 05:58:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:32,425 INFO L475 AbstractCegarLoop]: Abstraction has 586 states and 798 transitions. [2019-09-08 05:58:32,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 798 transitions. [2019-09-08 05:58:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 05:58:32,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:32,434 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:32,434 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash -584126611, now seen corresponding path program 1 times [2019-09-08 05:58:32,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:32,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:32,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:32,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:32,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:58:32,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:32,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:32,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:32,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:32,745 INFO L87 Difference]: Start difference. First operand 586 states and 798 transitions. Second operand 3 states. [2019-09-08 05:58:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:32,800 INFO L93 Difference]: Finished difference Result 1150 states and 1597 transitions. [2019-09-08 05:58:32,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:32,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 05:58:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:32,811 INFO L225 Difference]: With dead ends: 1150 [2019-09-08 05:58:32,812 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 05:58:32,814 INFO L628 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-09-08 05:58:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 05:58:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 628. [2019-09-08 05:58:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 05:58:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 870 transitions. [2019-09-08 05:58:32,859 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 870 transitions. Word has length 178 [2019-09-08 05:58:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:32,862 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 870 transitions. [2019-09-08 05:58:32,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 870 transitions. [2019-09-08 05:58:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 05:58:32,872 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:32,872 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:32,872 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:32,873 INFO L82 PathProgramCache]: Analyzing trace with hash 571727363, now seen corresponding path program 1 times [2019-09-08 05:58:32,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:32,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:32,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:32,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:33,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:58:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:33,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:33,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:33,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:33,066 INFO L87 Difference]: Start difference. First operand 628 states and 870 transitions. Second operand 3 states. [2019-09-08 05:58:33,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:33,111 INFO L93 Difference]: Finished difference Result 1273 states and 1808 transitions. [2019-09-08 05:58:33,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:33,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 05:58:33,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:33,119 INFO L225 Difference]: With dead ends: 1273 [2019-09-08 05:58:33,119 INFO L226 Difference]: Without dead ends: 710 [2019-09-08 05:58:33,122 INFO L628 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-09-08 05:58:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-09-08 05:58:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 709. [2019-09-08 05:58:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2019-09-08 05:58:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1008 transitions. [2019-09-08 05:58:33,163 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1008 transitions. Word has length 179 [2019-09-08 05:58:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:33,164 INFO L475 AbstractCegarLoop]: Abstraction has 709 states and 1008 transitions. [2019-09-08 05:58:33,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:33,164 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1008 transitions. [2019-09-08 05:58:33,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 05:58:33,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:33,170 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:33,170 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:33,170 INFO L82 PathProgramCache]: Analyzing trace with hash 164272269, now seen corresponding path program 1 times [2019-09-08 05:58:33,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:58:33,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:33,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:33,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:33,365 INFO L87 Difference]: Start difference. First operand 709 states and 1008 transitions. Second operand 3 states. [2019-09-08 05:58:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:33,423 INFO L93 Difference]: Finished difference Result 1510 states and 2212 transitions. [2019-09-08 05:58:33,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:33,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 05:58:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:33,432 INFO L225 Difference]: With dead ends: 1510 [2019-09-08 05:58:33,432 INFO L226 Difference]: Without dead ends: 866 [2019-09-08 05:58:33,435 INFO L628 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-09-08 05:58:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-08 05:58:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 865. [2019-09-08 05:58:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-09-08 05:58:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1272 transitions. [2019-09-08 05:58:33,578 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1272 transitions. Word has length 180 [2019-09-08 05:58:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:33,579 INFO L475 AbstractCegarLoop]: Abstraction has 865 states and 1272 transitions. [2019-09-08 05:58:33,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1272 transitions. [2019-09-08 05:58:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 05:58:33,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:33,588 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:33,589 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2136404765, now seen corresponding path program 1 times [2019-09-08 05:58:33,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:33,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:58:33,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:33,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:33,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:33,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:33,828 INFO L87 Difference]: Start difference. First operand 865 states and 1272 transitions. Second operand 3 states. [2019-09-08 05:58:33,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:33,896 INFO L93 Difference]: Finished difference Result 1966 states and 2984 transitions. [2019-09-08 05:58:33,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:33,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2019-09-08 05:58:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:33,907 INFO L225 Difference]: With dead ends: 1966 [2019-09-08 05:58:33,908 INFO L226 Difference]: Without dead ends: 1166 [2019-09-08 05:58:33,916 INFO L628 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-09-08 05:58:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2019-09-08 05:58:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1165. [2019-09-08 05:58:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-09-08 05:58:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1776 transitions. [2019-09-08 05:58:33,982 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1776 transitions. Word has length 181 [2019-09-08 05:58:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:33,984 INFO L475 AbstractCegarLoop]: Abstraction has 1165 states and 1776 transitions. [2019-09-08 05:58:33,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1776 transitions. [2019-09-08 05:58:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 05:58:33,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:33,992 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:33,992 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:33,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:33,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1850189406, now seen corresponding path program 1 times [2019-09-08 05:58:33,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:34,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:58:34,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:34,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:34,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:34,232 INFO L87 Difference]: Start difference. First operand 1165 states and 1776 transitions. Second operand 3 states. [2019-09-08 05:58:34,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:34,299 INFO L93 Difference]: Finished difference Result 1601 states and 2368 transitions. [2019-09-08 05:58:34,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:34,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 05:58:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:34,310 INFO L225 Difference]: With dead ends: 1601 [2019-09-08 05:58:34,310 INFO L226 Difference]: Without dead ends: 1306 [2019-09-08 05:58:34,312 INFO L628 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-09-08 05:58:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-08 05:58:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1305. [2019-09-08 05:58:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-09-08 05:58:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1973 transitions. [2019-09-08 05:58:34,436 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1973 transitions. Word has length 184 [2019-09-08 05:58:34,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:34,437 INFO L475 AbstractCegarLoop]: Abstraction has 1305 states and 1973 transitions. [2019-09-08 05:58:34,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1973 transitions. [2019-09-08 05:58:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:58:34,450 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:34,451 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:34,451 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:34,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash -576854632, now seen corresponding path program 1 times [2019-09-08 05:58:34,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:34,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:34,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:34,720 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:58:34,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:34,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:58:34,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:58:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:58:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:58:34,722 INFO L87 Difference]: Start difference. First operand 1305 states and 1973 transitions. Second operand 6 states. [2019-09-08 05:58:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:35,566 INFO L93 Difference]: Finished difference Result 2958 states and 4439 transitions. [2019-09-08 05:58:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:58:35,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 329 [2019-09-08 05:58:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:35,602 INFO L225 Difference]: With dead ends: 2958 [2019-09-08 05:58:35,602 INFO L226 Difference]: Without dead ends: 2561 [2019-09-08 05:58:35,605 INFO L628 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-09-08 05:58:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2019-09-08 05:58:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2550. [2019-09-08 05:58:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2019-09-08 05:58:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3896 transitions. [2019-09-08 05:58:35,782 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3896 transitions. Word has length 329 [2019-09-08 05:58:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:35,783 INFO L475 AbstractCegarLoop]: Abstraction has 2550 states and 3896 transitions. [2019-09-08 05:58:35,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:58:35,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3896 transitions. [2019-09-08 05:58:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 05:58:35,802 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:35,802 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:35,803 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:35,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 172382507, now seen corresponding path program 1 times [2019-09-08 05:58:35,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:35,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:35,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:35,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:58:36,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:58:36,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:58:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:58:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:58:36,138 INFO L87 Difference]: Start difference. First operand 2550 states and 3896 transitions. Second operand 11 states. [2019-09-08 05:58:36,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:36,727 INFO L93 Difference]: Finished difference Result 3341 states and 4945 transitions. [2019-09-08 05:58:36,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:58:36,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 330 [2019-09-08 05:58:36,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:36,744 INFO L225 Difference]: With dead ends: 3341 [2019-09-08 05:58:36,744 INFO L226 Difference]: Without dead ends: 2524 [2019-09-08 05:58:36,748 INFO L628 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-09-08 05:58:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2524 states. [2019-09-08 05:58:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2524 to 2520. [2019-09-08 05:58:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2520 states. [2019-09-08 05:58:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3845 transitions. [2019-09-08 05:58:36,898 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3845 transitions. Word has length 330 [2019-09-08 05:58:36,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:36,899 INFO L475 AbstractCegarLoop]: Abstraction has 2520 states and 3845 transitions. [2019-09-08 05:58:36,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:58:36,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3845 transitions. [2019-09-08 05:58:36,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 05:58:36,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:36,921 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 05:58:36,922 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1879909920, now seen corresponding path program 1 times [2019-09-08 05:58:36,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:36,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:36,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-08 05:58:37,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:37,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:37,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:37,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:37,287 INFO L87 Difference]: Start difference. First operand 2520 states and 3845 transitions. Second operand 3 states. [2019-09-08 05:58:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:37,459 INFO L93 Difference]: Finished difference Result 6129 states and 9587 transitions. [2019-09-08 05:58:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:37,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-09-08 05:58:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:37,488 INFO L225 Difference]: With dead ends: 6129 [2019-09-08 05:58:37,489 INFO L226 Difference]: Without dead ends: 3674 [2019-09-08 05:58:37,501 INFO L628 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-09-08 05:58:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3674 states. [2019-09-08 05:58:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3674 to 3672. [2019-09-08 05:58:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3672 states. [2019-09-08 05:58:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5781 transitions. [2019-09-08 05:58:37,775 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5781 transitions. Word has length 371 [2019-09-08 05:58:37,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:37,776 INFO L475 AbstractCegarLoop]: Abstraction has 3672 states and 5781 transitions. [2019-09-08 05:58:37,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:37,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5781 transitions. [2019-09-08 05:58:37,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 05:58:37,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:37,801 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 05:58:37,801 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash -670534202, now seen corresponding path program 1 times [2019-09-08 05:58:37,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:37,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:37,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 05:58:38,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:58:38,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:58:38,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:58:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:58:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:58:38,038 INFO L87 Difference]: Start difference. First operand 3672 states and 5781 transitions. Second operand 3 states. [2019-09-08 05:58:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:58:38,278 INFO L93 Difference]: Finished difference Result 9617 states and 15427 transitions. [2019-09-08 05:58:38,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:58:38,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-09-08 05:58:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:58:38,324 INFO L225 Difference]: With dead ends: 9617 [2019-09-08 05:58:38,324 INFO L226 Difference]: Without dead ends: 6010 [2019-09-08 05:58:38,342 INFO L628 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-09-08 05:58:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6010 states. [2019-09-08 05:58:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6010 to 6008. [2019-09-08 05:58:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6008 states. [2019-09-08 05:58:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6008 states to 6008 states and 9653 transitions. [2019-09-08 05:58:38,738 INFO L78 Accepts]: Start accepts. Automaton has 6008 states and 9653 transitions. Word has length 374 [2019-09-08 05:58:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:58:38,739 INFO L475 AbstractCegarLoop]: Abstraction has 6008 states and 9653 transitions. [2019-09-08 05:58:38,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:58:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6008 states and 9653 transitions. [2019-09-08 05:58:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-09-08 05:58:38,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:58:38,779 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:58:38,779 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:58:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:58:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash -419997698, now seen corresponding path program 1 times [2019-09-08 05:58:38,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:58:38,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:58:38,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:38,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:38,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:58:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:58:39,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:58:39,280 INFO L223 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-09-08 05:58:39,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:58:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:58:39,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 3895 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:58:40,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:58:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:58:40,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:58:40,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:58:40,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:58:40,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:58:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:58:40,564 INFO L87 Difference]: Start difference. First operand 6008 states and 9653 transitions. Second operand 29 states. [2019-09-08 05:59:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:59:28,319 INFO L93 Difference]: Finished difference Result 23256 states and 37198 transitions. [2019-09-08 05:59:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-08 05:59:28,324 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 338 [2019-09-08 05:59:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:59:28,438 INFO L225 Difference]: With dead ends: 23256 [2019-09-08 05:59:28,439 INFO L226 Difference]: Without dead ends: 17087 [2019-09-08 05:59:28,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10450 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-09-08 05:59:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17087 states. [2019-09-08 05:59:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17087 to 16657. [2019-09-08 05:59:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16657 states. [2019-09-08 05:59:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16657 states to 16657 states and 26434 transitions. [2019-09-08 05:59:29,708 INFO L78 Accepts]: Start accepts. Automaton has 16657 states and 26434 transitions. Word has length 338 [2019-09-08 05:59:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:59:29,709 INFO L475 AbstractCegarLoop]: Abstraction has 16657 states and 26434 transitions. [2019-09-08 05:59:29,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:59:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 16657 states and 26434 transitions. [2019-09-08 05:59:29,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-09-08 05:59:29,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:59:29,817 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:59:29,818 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:59:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:59:29,818 INFO L82 PathProgramCache]: Analyzing trace with hash -917261294, now seen corresponding path program 1 times [2019-09-08 05:59:29,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:59:29,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:59:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:29,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:59:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 05:59:30,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:59:30,474 INFO L223 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-09-08 05:59:30,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:59:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:59:31,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 3897 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:59:31,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:59:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 05:59:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:59:31,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:59:31,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:59:31,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:59:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:59:31,387 INFO L87 Difference]: Start difference. First operand 16657 states and 26434 transitions. Second operand 23 states. [2019-09-08 06:00:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:09,437 INFO L93 Difference]: Finished difference Result 40620 states and 64155 transitions. [2019-09-08 06:00:09,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 06:00:09,437 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 340 [2019-09-08 06:00:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:09,542 INFO L225 Difference]: With dead ends: 40620 [2019-09-08 06:00:09,542 INFO L226 Difference]: Without dead ends: 21990 [2019-09-08 06:00:09,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9622 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1916, Invalid=24816, Unknown=0, NotChecked=0, Total=26732 [2019-09-08 06:00:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21990 states. [2019-09-08 06:00:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21990 to 20488. [2019-09-08 06:00:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20488 states. [2019-09-08 06:00:10,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20488 states to 20488 states and 31986 transitions. [2019-09-08 06:00:10,799 INFO L78 Accepts]: Start accepts. Automaton has 20488 states and 31986 transitions. Word has length 340 [2019-09-08 06:00:10,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:10,800 INFO L475 AbstractCegarLoop]: Abstraction has 20488 states and 31986 transitions. [2019-09-08 06:00:10,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 06:00:10,800 INFO L276 IsEmpty]: Start isEmpty. Operand 20488 states and 31986 transitions. [2019-09-08 06:00:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 06:00:10,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:10,921 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:00:10,923 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:10,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:10,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1316553701, now seen corresponding path program 1 times [2019-09-08 06:00:10,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:10,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:10,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 06:00:11,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:00:11,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:00:11,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:00:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:00:11,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:00:11,168 INFO L87 Difference]: Start difference. First operand 20488 states and 31986 transitions. Second operand 5 states. [2019-09-08 06:00:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:12,664 INFO L93 Difference]: Finished difference Result 30047 states and 45461 transitions. [2019-09-08 06:00:12,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:00:12,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 345 [2019-09-08 06:00:12,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:12,762 INFO L225 Difference]: With dead ends: 30047 [2019-09-08 06:00:12,762 INFO L226 Difference]: Without dead ends: 19638 [2019-09-08 06:00:12,794 INFO L628 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-09-08 06:00:12,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19638 states. [2019-09-08 06:00:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19638 to 19410. [2019-09-08 06:00:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19410 states. [2019-09-08 06:00:13,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19410 states to 19410 states and 30370 transitions. [2019-09-08 06:00:13,710 INFO L78 Accepts]: Start accepts. Automaton has 19410 states and 30370 transitions. Word has length 345 [2019-09-08 06:00:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:13,711 INFO L475 AbstractCegarLoop]: Abstraction has 19410 states and 30370 transitions. [2019-09-08 06:00:13,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:00:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 19410 states and 30370 transitions. [2019-09-08 06:00:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-09-08 06:00:13,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:13,778 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:00:13,779 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash 580785414, now seen corresponding path program 1 times [2019-09-08 06:00:13,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:13,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:13,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:13,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 06:00:14,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:00:14,220 INFO L223 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-09-08 06:00:14,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:14,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 3898 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:00:14,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:00:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:00:15,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:00:15,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 06:00:15,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 06:00:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 06:00:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:00:15,154 INFO L87 Difference]: Start difference. First operand 19410 states and 30370 transitions. Second operand 25 states. [2019-09-08 06:00:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:00:19,693 INFO L93 Difference]: Finished difference Result 39765 states and 63131 transitions. [2019-09-08 06:00:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 06:00:19,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 341 [2019-09-08 06:00:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:00:19,796 INFO L225 Difference]: With dead ends: 39765 [2019-09-08 06:00:19,797 INFO L226 Difference]: Without dead ends: 20112 [2019-09-08 06:00:19,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=2090, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 06:00:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20112 states. [2019-09-08 06:00:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20112 to 20053. [2019-09-08 06:00:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20053 states. [2019-09-08 06:00:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20053 states to 20053 states and 31431 transitions. [2019-09-08 06:00:21,176 INFO L78 Accepts]: Start accepts. Automaton has 20053 states and 31431 transitions. Word has length 341 [2019-09-08 06:00:21,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:00:21,176 INFO L475 AbstractCegarLoop]: Abstraction has 20053 states and 31431 transitions. [2019-09-08 06:00:21,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 06:00:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20053 states and 31431 transitions. [2019-09-08 06:00:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 06:00:21,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:00:21,233 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:00:21,234 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:00:21,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:00:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1268735648, now seen corresponding path program 1 times [2019-09-08 06:00:21,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:00:21,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:00:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:21,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:21,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:00:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-08 06:00:21,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:00:21,641 INFO L223 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-09-08 06:00:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:00:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:00:22,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 3902 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:00:22,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:00:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:00:22,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:00:22,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-09-08 06:00:22,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 06:00:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 06:00:22,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:00:22,599 INFO L87 Difference]: Start difference. First operand 20053 states and 31431 transitions. Second operand 25 states. [2019-09-08 06:01:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:02,610 INFO L93 Difference]: Finished difference Result 48577 states and 75672 transitions. [2019-09-08 06:01:02,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-08 06:01:02,611 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 345 [2019-09-08 06:01:02,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:02,714 INFO L225 Difference]: With dead ends: 48577 [2019-09-08 06:01:02,714 INFO L226 Difference]: Without dead ends: 25283 [2019-09-08 06:01:02,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9620 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-09-08 06:01:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25283 states. [2019-09-08 06:01:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25283 to 23064. [2019-09-08 06:01:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23064 states. [2019-09-08 06:01:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23064 states to 23064 states and 35779 transitions. [2019-09-08 06:01:04,015 INFO L78 Accepts]: Start accepts. Automaton has 23064 states and 35779 transitions. Word has length 345 [2019-09-08 06:01:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:01:04,015 INFO L475 AbstractCegarLoop]: Abstraction has 23064 states and 35779 transitions. [2019-09-08 06:01:04,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 06:01:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 23064 states and 35779 transitions. [2019-09-08 06:01:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-09-08 06:01:04,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:01:04,065 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:01:04,065 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:01:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:01:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1527522108, now seen corresponding path program 1 times [2019-09-08 06:01:04,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:01:04,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:01:04,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:04,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:04,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-08 06:01:04,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:01:04,333 INFO L223 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) [2019-09-08 06:01:04,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:01:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:04,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 3900 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:01:04,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:01:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:01:05,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:01:05,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 06:01:05,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:01:05,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:01:05,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:01:05,076 INFO L87 Difference]: Start difference. First operand 23064 states and 35779 transitions. Second operand 14 states. [2019-09-08 06:01:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:17,208 INFO L93 Difference]: Finished difference Result 78348 states and 135670 transitions. [2019-09-08 06:01:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 06:01:17,209 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 344 [2019-09-08 06:01:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:17,557 INFO L225 Difference]: With dead ends: 78348 [2019-09-08 06:01:17,558 INFO L226 Difference]: Without dead ends: 55364 [2019-09-08 06:01:17,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 361 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-09-08 06:01:17,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55364 states. [2019-09-08 06:01:21,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55364 to 53220. [2019-09-08 06:01:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53220 states. [2019-09-08 06:01:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53220 states to 53220 states and 92437 transitions. [2019-09-08 06:01:21,515 INFO L78 Accepts]: Start accepts. Automaton has 53220 states and 92437 transitions. Word has length 344 [2019-09-08 06:01:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:01:21,516 INFO L475 AbstractCegarLoop]: Abstraction has 53220 states and 92437 transitions. [2019-09-08 06:01:21,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:01:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 53220 states and 92437 transitions. [2019-09-08 06:01:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 06:01:21,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:01:21,573 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-08 06:01:21,573 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:01:21,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:01:21,573 INFO L82 PathProgramCache]: Analyzing trace with hash 602844904, now seen corresponding path program 1 times [2019-09-08 06:01:21,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:01:21,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:01:21,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:21,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:21,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 06:01:22,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:01:22,055 INFO L223 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-09-08 06:01:22,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:22,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 3903 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:01:22,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:01:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:01:22,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:01:22,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-09-08 06:01:22,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 06:01:22,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 06:01:22,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 06:01:22,892 INFO L87 Difference]: Start difference. First operand 53220 states and 92437 transitions. Second operand 31 states. [2019-09-08 06:01:30,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:30,039 INFO L93 Difference]: Finished difference Result 117016 states and 236074 transitions. [2019-09-08 06:01:30,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 06:01:30,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 347 [2019-09-08 06:01:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:30,435 INFO L225 Difference]: With dead ends: 117016 [2019-09-08 06:01:30,435 INFO L226 Difference]: Without dead ends: 59556 [2019-09-08 06:01:30,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 345 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-09-08 06:01:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59556 states. [2019-09-08 06:01:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59556 to 57077. [2019-09-08 06:01:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57077 states. [2019-09-08 06:01:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57077 states to 57077 states and 97132 transitions. [2019-09-08 06:01:36,043 INFO L78 Accepts]: Start accepts. Automaton has 57077 states and 97132 transitions. Word has length 347 [2019-09-08 06:01:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:01:36,044 INFO L475 AbstractCegarLoop]: Abstraction has 57077 states and 97132 transitions. [2019-09-08 06:01:36,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 06:01:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 57077 states and 97132 transitions. [2019-09-08 06:01:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 06:01:36,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:01:36,098 INFO L399 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, 1, 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-09-08 06:01:36,099 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:01:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:01:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1430880114, now seen corresponding path program 1 times [2019-09-08 06:01:36,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:01:36,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:01:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:36,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 06:01:36,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:01:36,299 INFO L223 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-09-08 06:01:36,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:37,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 3961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:01:37,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:01:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-09-08 06:01:37,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:01:37,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-09-08 06:01:37,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:01:37,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:01:37,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:01:37,361 INFO L87 Difference]: Start difference. First operand 57077 states and 97132 transitions. Second operand 9 states. [2019-09-08 06:01:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:44,934 INFO L93 Difference]: Finished difference Result 178581 states and 314392 transitions. [2019-09-08 06:01:44,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:01:44,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 361 [2019-09-08 06:01:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:45,451 INFO L225 Difference]: With dead ends: 178581 [2019-09-08 06:01:45,451 INFO L226 Difference]: Without dead ends: 129451 [2019-09-08 06:01:45,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:01:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129451 states. [2019-09-08 06:01:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129451 to 125018. [2019-09-08 06:01:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125018 states. [2019-09-08 06:01:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125018 states to 125018 states and 217363 transitions. [2019-09-08 06:01:51,690 INFO L78 Accepts]: Start accepts. Automaton has 125018 states and 217363 transitions. Word has length 361 [2019-09-08 06:01:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:01:51,691 INFO L475 AbstractCegarLoop]: Abstraction has 125018 states and 217363 transitions. [2019-09-08 06:01:51,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:01:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 125018 states and 217363 transitions. [2019-09-08 06:01:51,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 06:01:51,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:01:51,807 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:01:51,807 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:01:51,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:01:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1131742587, now seen corresponding path program 1 times [2019-09-08 06:01:51,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:01:51,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:01:51,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:51,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:01:51,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:01:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:01:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-09-08 06:01:52,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:01:52,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:01:52,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:01:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:01:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:01:52,012 INFO L87 Difference]: Start difference. First operand 125018 states and 217363 transitions. Second operand 6 states. [2019-09-08 06:01:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:01:58,993 INFO L93 Difference]: Finished difference Result 249856 states and 434492 transitions. [2019-09-08 06:01:58,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:01:58,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 391 [2019-09-08 06:01:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:01:59,477 INFO L225 Difference]: With dead ends: 249856 [2019-09-08 06:01:59,477 INFO L226 Difference]: Without dead ends: 125026 [2019-09-08 06:01:59,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:01:59,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125026 states. [2019-09-08 06:02:08,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125026 to 125018. [2019-09-08 06:02:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125018 states. [2019-09-08 06:02:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125018 states to 125018 states and 217107 transitions. [2019-09-08 06:02:08,978 INFO L78 Accepts]: Start accepts. Automaton has 125018 states and 217107 transitions. Word has length 391 [2019-09-08 06:02:08,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:02:08,979 INFO L475 AbstractCegarLoop]: Abstraction has 125018 states and 217107 transitions. [2019-09-08 06:02:08,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:02:08,979 INFO L276 IsEmpty]: Start isEmpty. Operand 125018 states and 217107 transitions. [2019-09-08 06:02:09,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 06:02:09,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:02:09,150 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:02:09,151 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:02:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:02:09,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2111916983, now seen corresponding path program 1 times [2019-09-08 06:02:09,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:02:09,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:02:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:09,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-08 06:02:09,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:02:09,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:02:09,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:02:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:02:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:02:09,353 INFO L87 Difference]: Start difference. First operand 125018 states and 217107 transitions. Second operand 3 states. [2019-09-08 06:02:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:02:18,288 INFO L93 Difference]: Finished difference Result 267299 states and 465202 transitions. [2019-09-08 06:02:18,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:02:18,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 390 [2019-09-08 06:02:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:02:18,973 INFO L225 Difference]: With dead ends: 267299 [2019-09-08 06:02:18,973 INFO L226 Difference]: Without dead ends: 142436 [2019-09-08 06:02:19,298 INFO L628 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-09-08 06:02:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142436 states. [2019-09-08 06:02:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142436 to 142428. [2019-09-08 06:02:26,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142428 states. [2019-09-08 06:02:26,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142428 states to 142428 states and 247764 transitions. [2019-09-08 06:02:26,837 INFO L78 Accepts]: Start accepts. Automaton has 142428 states and 247764 transitions. Word has length 390 [2019-09-08 06:02:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:02:26,837 INFO L475 AbstractCegarLoop]: Abstraction has 142428 states and 247764 transitions. [2019-09-08 06:02:26,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:02:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 142428 states and 247764 transitions. [2019-09-08 06:02:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 06:02:27,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:02:27,077 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:02:27,077 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:02:27,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:02:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1222973277, now seen corresponding path program 1 times [2019-09-08 06:02:27,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:02:27,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:02:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:27,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:27,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 06:02:27,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:02:27,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 06:02:27,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:02:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:02:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:02:27,323 INFO L87 Difference]: Start difference. First operand 142428 states and 247764 transitions. Second operand 7 states. [2019-09-08 06:02:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:02:36,097 INFO L93 Difference]: Finished difference Result 284744 states and 496957 transitions. [2019-09-08 06:02:36,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 06:02:36,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 388 [2019-09-08 06:02:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:02:36,680 INFO L225 Difference]: With dead ends: 284744 [2019-09-08 06:02:36,680 INFO L226 Difference]: Without dead ends: 142500 [2019-09-08 06:02:37,688 INFO L628 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-09-08 06:02:37,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142500 states. [2019-09-08 06:02:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142500 to 142500. [2019-09-08 06:02:47,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142500 states. [2019-09-08 06:02:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142500 states to 142500 states and 247852 transitions. [2019-09-08 06:02:47,896 INFO L78 Accepts]: Start accepts. Automaton has 142500 states and 247852 transitions. Word has length 388 [2019-09-08 06:02:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:02:47,896 INFO L475 AbstractCegarLoop]: Abstraction has 142500 states and 247852 transitions. [2019-09-08 06:02:47,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:02:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 142500 states and 247852 transitions. [2019-09-08 06:02:48,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 06:02:48,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:02:48,892 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:02:48,892 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:02:48,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:02:48,892 INFO L82 PathProgramCache]: Analyzing trace with hash 565922703, now seen corresponding path program 1 times [2019-09-08 06:02:48,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:02:48,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:02:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:48,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:48,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:02:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:49,101 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 06:02:49,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:02:49,102 INFO L223 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-09-08 06:02:49,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:02:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:02:49,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 4128 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:02:49,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:02:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-09-08 06:02:49,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:02:49,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-08 06:02:49,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:02:49,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:02:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:02:49,828 INFO L87 Difference]: Start difference. First operand 142500 states and 247852 transitions. Second operand 10 states. [2019-09-08 06:02:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:02:56,725 INFO L93 Difference]: Finished difference Result 266121 states and 463353 transitions. [2019-09-08 06:02:56,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:02:56,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 388 [2019-09-08 06:02:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:02:57,322 INFO L225 Difference]: With dead ends: 266121 [2019-09-08 06:02:57,322 INFO L226 Difference]: Without dead ends: 142272 [2019-09-08 06:03:03,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:03:03,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142272 states. [2019-09-08 06:03:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142272 to 142272. [2019-09-08 06:03:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142272 states. [2019-09-08 06:03:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142272 states to 142272 states and 246112 transitions. [2019-09-08 06:03:10,040 INFO L78 Accepts]: Start accepts. Automaton has 142272 states and 246112 transitions. Word has length 388 [2019-09-08 06:03:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:03:10,040 INFO L475 AbstractCegarLoop]: Abstraction has 142272 states and 246112 transitions. [2019-09-08 06:03:10,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:03:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 142272 states and 246112 transitions. [2019-09-08 06:03:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 06:03:11,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:03:11,057 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:03:11,057 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:03:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:03:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1689106269, now seen corresponding path program 1 times [2019-09-08 06:03:11,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:03:11,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:03:11,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:11,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:11,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-08 06:03:11,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:03:11,322 INFO L223 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-09-08 06:03:11,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:11,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 4135 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:03:11,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:03:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-09-08 06:03:12,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:03:12,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-09-08 06:03:12,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:03:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:03:12,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:03:12,089 INFO L87 Difference]: Start difference. First operand 142272 states and 246112 transitions. Second operand 14 states. [2019-09-08 06:03:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:03:19,146 INFO L93 Difference]: Finished difference Result 249095 states and 430112 transitions. [2019-09-08 06:03:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:03:19,147 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 395 [2019-09-08 06:03:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:03:19,671 INFO L225 Difference]: With dead ends: 249095 [2019-09-08 06:03:19,671 INFO L226 Difference]: Without dead ends: 144759 [2019-09-08 06:03:19,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:03:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144759 states. [2019-09-08 06:03:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144759 to 143739. [2019-09-08 06:03:31,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143739 states. [2019-09-08 06:03:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143739 states to 143739 states and 248526 transitions. [2019-09-08 06:03:32,528 INFO L78 Accepts]: Start accepts. Automaton has 143739 states and 248526 transitions. Word has length 395 [2019-09-08 06:03:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:03:32,528 INFO L475 AbstractCegarLoop]: Abstraction has 143739 states and 248526 transitions. [2019-09-08 06:03:32,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:03:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 143739 states and 248526 transitions. [2019-09-08 06:03:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 06:03:32,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:03:32,698 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 06:03:32,699 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:03:32,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:03:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash -764664922, now seen corresponding path program 1 times [2019-09-08 06:03:32,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:03:32,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:03:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:32,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 06:03:32,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:03:32,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:03:32,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:03:32,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:03:32,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:03:32,904 INFO L87 Difference]: Start difference. First operand 143739 states and 248526 transitions. Second operand 3 states. [2019-09-08 06:03:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:03:44,415 INFO L93 Difference]: Finished difference Result 320002 states and 554701 transitions. [2019-09-08 06:03:44,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:03:44,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2019-09-08 06:03:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:03:45,151 INFO L225 Difference]: With dead ends: 320002 [2019-09-08 06:03:45,151 INFO L226 Difference]: Without dead ends: 177150 [2019-09-08 06:03:45,471 INFO L628 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-09-08 06:03:45,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177150 states. [2019-09-08 06:03:53,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177150 to 177142. [2019-09-08 06:03:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177142 states. [2019-09-08 06:03:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177142 states to 177142 states and 306409 transitions. [2019-09-08 06:03:55,050 INFO L78 Accepts]: Start accepts. Automaton has 177142 states and 306409 transitions. Word has length 355 [2019-09-08 06:03:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:03:55,050 INFO L475 AbstractCegarLoop]: Abstraction has 177142 states and 306409 transitions. [2019-09-08 06:03:55,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:03:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 177142 states and 306409 transitions. [2019-09-08 06:03:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2019-09-08 06:03:55,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:03:55,377 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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] [2019-09-08 06:03:55,377 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:03:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:03:55,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1814740007, now seen corresponding path program 1 times [2019-09-08 06:03:55,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:03:55,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:03:55,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:55,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:03:55,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:03:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:03:55,613 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 06:03:55,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:03:55,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:03:55,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:03:55,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:03:55,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:03:55,615 INFO L87 Difference]: Start difference. First operand 177142 states and 306409 transitions. Second operand 8 states. [2019-09-08 06:04:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:04:26,800 INFO L93 Difference]: Finished difference Result 531626 states and 984933 transitions. [2019-09-08 06:04:26,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:04:26,801 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 408 [2019-09-08 06:04:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:04:28,402 INFO L225 Difference]: With dead ends: 531626 [2019-09-08 06:04:28,403 INFO L226 Difference]: Without dead ends: 354880 [2019-09-08 06:04:28,906 INFO L628 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-09-08 06:04:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354880 states. [2019-09-08 06:04:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354880 to 319907. [2019-09-08 06:04:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319907 states. [2019-09-08 06:04:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319907 states to 319907 states and 586859 transitions. [2019-09-08 06:04:51,955 INFO L78 Accepts]: Start accepts. Automaton has 319907 states and 586859 transitions. Word has length 408 [2019-09-08 06:04:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:04:51,955 INFO L475 AbstractCegarLoop]: Abstraction has 319907 states and 586859 transitions. [2019-09-08 06:04:51,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 06:04:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 319907 states and 586859 transitions. [2019-09-08 06:05:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-09-08 06:05:03,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:05:03,291 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:05:03,292 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:05:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:05:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash -881478932, now seen corresponding path program 1 times [2019-09-08 06:05:03,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:05:03,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:05:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:05:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:05:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:05:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:05:03,480 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-08 06:05:03,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:05:03,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:05:03,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:05:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:05:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:05:03,482 INFO L87 Difference]: Start difference. First operand 319907 states and 586859 transitions. Second operand 3 states. [2019-09-08 06:05:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:05:30,461 INFO L93 Difference]: Finished difference Result 765576 states and 1413435 transitions. [2019-09-08 06:05:30,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:05:30,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 355 [2019-09-08 06:05:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:05:32,499 INFO L225 Difference]: With dead ends: 765576 [2019-09-08 06:05:32,499 INFO L226 Difference]: Without dead ends: 447417 [2019-09-08 06:05:34,422 INFO L628 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-09-08 06:05:34,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447417 states. [2019-09-08 06:06:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447417 to 438519. [2019-09-08 06:06:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438519 states. [2019-09-08 06:06:31,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438519 states to 438519 states and 810220 transitions. [2019-09-08 06:06:31,786 INFO L78 Accepts]: Start accepts. Automaton has 438519 states and 810220 transitions. Word has length 355 [2019-09-08 06:06:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:06:31,786 INFO L475 AbstractCegarLoop]: Abstraction has 438519 states and 810220 transitions. [2019-09-08 06:06:31,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:06:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 438519 states and 810220 transitions. [2019-09-08 06:06:33,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:06:33,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:06:33,549 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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] [2019-09-08 06:06:33,549 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:06:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:06:33,550 INFO L82 PathProgramCache]: Analyzing trace with hash 321439949, now seen corresponding path program 1 times [2019-09-08 06:06:33,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:06:33,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:06:33,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:06:33,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:06:33,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:06:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:06:35,457 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-09-08 06:06:35,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:06:35,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 06:06:35,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 06:06:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 06:06:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:06:35,458 INFO L87 Difference]: Start difference. First operand 438519 states and 810220 transitions. Second operand 8 states. [2019-09-08 06:07:46,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:07:46,279 INFO L93 Difference]: Finished difference Result 1314413 states and 2651252 transitions. [2019-09-08 06:07:46,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 06:07:46,280 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 411 [2019-09-08 06:07:46,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:07:52,256 INFO L225 Difference]: With dead ends: 1314413 [2019-09-08 06:07:52,256 INFO L226 Difference]: Without dead ends: 877482 [2019-09-08 06:07:53,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:07:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877482 states.