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_spec8_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:54:46,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:54:46,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:54:46,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:54:46,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:54:46,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:54:46,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:54:46,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:54:46,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:54:46,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:54:46,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:54:46,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:54:46,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:54:46,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:54:46,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:54:46,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:54:46,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:54:46,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:54:46,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:54:46,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:54:46,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:54:46,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:54:46,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:54:46,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:54:46,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:54:46,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:54:46,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:54:46,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:54:46,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:54:46,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:54:46,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:54:46,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:54:46,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:54:46,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:54:46,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:54:46,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:54:46,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:54:46,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:54:46,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:54:46,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:54:46,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:54:46,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:54:46,384 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:54:46,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:54:46,385 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:54:46,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:54:46,386 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:54:46,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:54:46,386 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:54:46,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:54:46,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:54:46,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:54:46,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:54:46,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:54:46,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:54:46,388 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:54:46,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:54:46,388 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:54:46,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:54:46,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:54:46,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:54:46,389 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:54:46,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:54:46,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:54:46,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:54:46,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:54:46,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:54:46,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:54:46,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:54:46,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:54:46,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:54:46,420 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:54:46,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:54:46,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:54:46,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:54:46,438 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:54:46,438 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product20.cil.c [2019-10-02 13:54:46,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c89094d9/40c448d064ca48959b132eb76953a776/FLAGdd09deec9 [2019-10-02 13:54:47,114 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:54:47,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product20.cil.c [2019-10-02 13:54:47,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c89094d9/40c448d064ca48959b132eb76953a776/FLAGdd09deec9 [2019-10-02 13:54:47,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c89094d9/40c448d064ca48959b132eb76953a776 [2019-10-02 13:54:47,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:54:47,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:54:47,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:54:47,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:54:47,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:54:47,330 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:54:47" (1/1) ... [2019-10-02 13:54:47,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760969a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:47, skipping insertion in model container [2019-10-02 13:54:47,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:54:47" (1/1) ... [2019-10-02 13:54:47,342 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:54:47,429 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:54:48,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:54:48,228 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:54:48,396 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:54:48,501 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:54:48,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48 WrapperNode [2019-10-02 13:54:48,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:54:48,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:54:48,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:54:48,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:54:48,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... [2019-10-02 13:54:48,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:54:48,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:54:48,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:54:48,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:54:48,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:54:48,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:54:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:54:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:54:48,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:54:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:54:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:54:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:54:48,760 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:54:48,761 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:54:48,761 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:54:48,761 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:54:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:54:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:54:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:54:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:54:48,764 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:54:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:54:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:54:48,766 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:54:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:54:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:54:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:54:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:54:48,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:54:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:54:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:54:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:54:48,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:54:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:54:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:54:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:54:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:54:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:54:48,769 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:54:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:54:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:54:48,770 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:54:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:54:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:54:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:54:48,771 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:54:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:54:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:54:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:54:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:54:48,773 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:54:48,774 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:54:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:54:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:54:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:54:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:54:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:54:48,775 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:54:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:54:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:54:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:54:48,776 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:54:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:54:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:54:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:54:48,777 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:54:48,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:54:48,778 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:54:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:54:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:54:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:54:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:54:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:54:48,779 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:54:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:54:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:54:48,780 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:54:48,781 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:54:48,781 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:54:48,781 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:54:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:54:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:54:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:54:48,782 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:54:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:54:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:54:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:54:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:54:48,783 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:54:48,784 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:54:48,785 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:54:48,786 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:54:48,786 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:54:48,786 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:54:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:54:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:54:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:54:48,786 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:54:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:54:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:54:48,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:54:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:54:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:54:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:54:48,788 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:54:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:54:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:54:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:54:48,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:54:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:54:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:54:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:54:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:54:48,790 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:54:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:54:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:54:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:54:48,791 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:54:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:54:48,792 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:54:48,793 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:54:48,796 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:54:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:54:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:54:48,797 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:54:48,803 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:54:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:54:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:54:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:54:48,804 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:54:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:54:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:54:48,805 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:54:48,806 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:54:48,807 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:54:48,808 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:54:48,809 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:54:48,810 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:54:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:54:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:54:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:54:48,811 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:54:48,812 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:54:48,813 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:54:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:54:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:54:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:54:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:54:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:54:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:54:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:54:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:54:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:54:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:54:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:54:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:54:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:54:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:54:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:54:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:54:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:54:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:54:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:54:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:54:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 13:54:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:54:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:54:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:54:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:54:51,053 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:54:51,054 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:54:51,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:54:51 BoogieIcfgContainer [2019-10-02 13:54:51,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:54:51,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:54:51,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:54:51,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:54:51,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:54:47" (1/3) ... [2019-10-02 13:54:51,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be69bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:54:51, skipping insertion in model container [2019-10-02 13:54:51,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:54:48" (2/3) ... [2019-10-02 13:54:51,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be69bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:54:51, skipping insertion in model container [2019-10-02 13:54:51,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:54:51" (3/3) ... [2019-10-02 13:54:51,065 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product20.cil.c [2019-10-02 13:54:51,077 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:54:51,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:54:51,105 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:54:51,142 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:54:51,143 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:54:51,143 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:54:51,143 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:54:51,144 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:54:51,144 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:54:51,144 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:54:51,144 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:54:51,144 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:54:51,176 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states. [2019-10-02 13:54:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 13:54:51,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:51,205 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:51,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:51,219 INFO L82 PathProgramCache]: Analyzing trace with hash -26401555, now seen corresponding path program 1 times [2019-10-02 13:54:51,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:51,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:51,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:51,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:51,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:54:51,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:54:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:54:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:54:51,986 INFO L87 Difference]: Start difference. First operand 563 states. Second operand 2 states. [2019-10-02 13:54:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:52,119 INFO L93 Difference]: Finished difference Result 764 states and 1044 transitions. [2019-10-02 13:54:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:54:52,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 154 [2019-10-02 13:54:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:52,162 INFO L225 Difference]: With dead ends: 764 [2019-10-02 13:54:52,162 INFO L226 Difference]: Without dead ends: 510 [2019-10-02 13:54:52,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:54:52,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-02 13:54:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2019-10-02 13:54:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-02 13:54:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 701 transitions. [2019-10-02 13:54:52,275 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 701 transitions. Word has length 154 [2019-10-02 13:54:52,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:52,277 INFO L475 AbstractCegarLoop]: Abstraction has 510 states and 701 transitions. [2019-10-02 13:54:52,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:54:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 701 transitions. [2019-10-02 13:54:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 13:54:52,284 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:52,285 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:52,285 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:52,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1452305840, now seen corresponding path program 1 times [2019-10-02 13:54:52,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:52,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:52,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:52,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:52,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:52,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:52,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:52,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:52,627 INFO L87 Difference]: Start difference. First operand 510 states and 701 transitions. Second operand 3 states. [2019-10-02 13:54:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:52,701 INFO L93 Difference]: Finished difference Result 747 states and 1010 transitions. [2019-10-02 13:54:52,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:52,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-10-02 13:54:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:52,711 INFO L225 Difference]: With dead ends: 747 [2019-10-02 13:54:52,711 INFO L226 Difference]: Without dead ends: 513 [2019-10-02 13:54:52,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-02 13:54:52,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 512. [2019-10-02 13:54:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-02 13:54:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 703 transitions. [2019-10-02 13:54:52,783 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 703 transitions. Word has length 155 [2019-10-02 13:54:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:52,784 INFO L475 AbstractCegarLoop]: Abstraction has 512 states and 703 transitions. [2019-10-02 13:54:52,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 703 transitions. [2019-10-02 13:54:52,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 13:54:52,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:52,791 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:52,791 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1395553248, now seen corresponding path program 1 times [2019-10-02 13:54:52,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:52,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:52,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:52,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:53,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:53,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:53,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:53,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:53,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,042 INFO L87 Difference]: Start difference. First operand 512 states and 703 transitions. Second operand 3 states. [2019-10-02 13:54:53,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:53,081 INFO L93 Difference]: Finished difference Result 1002 states and 1407 transitions. [2019-10-02 13:54:53,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:53,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 13:54:53,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:53,086 INFO L225 Difference]: With dead ends: 1002 [2019-10-02 13:54:53,086 INFO L226 Difference]: Without dead ends: 555 [2019-10-02 13:54:53,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-02 13:54:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 554. [2019-10-02 13:54:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-02 13:54:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 775 transitions. [2019-10-02 13:54:53,113 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 775 transitions. Word has length 165 [2019-10-02 13:54:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:53,114 INFO L475 AbstractCegarLoop]: Abstraction has 554 states and 775 transitions. [2019-10-02 13:54:53,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:53,115 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 775 transitions. [2019-10-02 13:54:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 13:54:53,119 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:53,119 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:53,119 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:53,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:53,120 INFO L82 PathProgramCache]: Analyzing trace with hash 742155615, now seen corresponding path program 1 times [2019-10-02 13:54:53,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:53,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:53,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:53,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:53,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:53,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:53,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:53,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,278 INFO L87 Difference]: Start difference. First operand 554 states and 775 transitions. Second operand 3 states. [2019-10-02 13:54:53,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:53,334 INFO L93 Difference]: Finished difference Result 1125 states and 1618 transitions. [2019-10-02 13:54:53,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:53,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-02 13:54:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:53,341 INFO L225 Difference]: With dead ends: 1125 [2019-10-02 13:54:53,341 INFO L226 Difference]: Without dead ends: 636 [2019-10-02 13:54:53,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-02 13:54:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 635. [2019-10-02 13:54:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 13:54:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 913 transitions. [2019-10-02 13:54:53,380 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 913 transitions. Word has length 166 [2019-10-02 13:54:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:53,381 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 913 transitions. [2019-10-02 13:54:53,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 913 transitions. [2019-10-02 13:54:53,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 13:54:53,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:53,386 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:53,387 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:53,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash -158203488, now seen corresponding path program 1 times [2019-10-02 13:54:53,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:53,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:53,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:53,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:53,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:53,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:53,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:53,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:53,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,550 INFO L87 Difference]: Start difference. First operand 635 states and 913 transitions. Second operand 3 states. [2019-10-02 13:54:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:53,593 INFO L93 Difference]: Finished difference Result 1362 states and 2022 transitions. [2019-10-02 13:54:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:53,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 13:54:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:53,599 INFO L225 Difference]: With dead ends: 1362 [2019-10-02 13:54:53,600 INFO L226 Difference]: Without dead ends: 792 [2019-10-02 13:54:53,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-02 13:54:53,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2019-10-02 13:54:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-02 13:54:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1177 transitions. [2019-10-02 13:54:53,648 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1177 transitions. Word has length 167 [2019-10-02 13:54:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:53,650 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1177 transitions. [2019-10-02 13:54:53,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1177 transitions. [2019-10-02 13:54:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 13:54:53,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:53,656 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:53,656 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:53,657 INFO L82 PathProgramCache]: Analyzing trace with hash 937061343, now seen corresponding path program 1 times [2019-10-02 13:54:53,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:53,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:53,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:53,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:53,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:54:53,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:53,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,909 INFO L87 Difference]: Start difference. First operand 791 states and 1177 transitions. Second operand 3 states. [2019-10-02 13:54:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:53,965 INFO L93 Difference]: Finished difference Result 1818 states and 2794 transitions. [2019-10-02 13:54:53,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:53,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 13:54:53,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:53,973 INFO L225 Difference]: With dead ends: 1818 [2019-10-02 13:54:53,973 INFO L226 Difference]: Without dead ends: 1092 [2019-10-02 13:54:53,976 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:53,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2019-10-02 13:54:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 1091. [2019-10-02 13:54:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2019-10-02 13:54:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1681 transitions. [2019-10-02 13:54:54,027 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1681 transitions. Word has length 168 [2019-10-02 13:54:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:54,029 INFO L475 AbstractCegarLoop]: Abstraction has 1091 states and 1681 transitions. [2019-10-02 13:54:54,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1681 transitions. [2019-10-02 13:54:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 13:54:54,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:54,039 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:54,039 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:54,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1598706118, now seen corresponding path program 1 times [2019-10-02 13:54:54,039 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:54,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:54,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:54,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:54,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:54:54,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:54,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:54:54,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:54:54,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:54:54,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:54,239 INFO L87 Difference]: Start difference. First operand 1091 states and 1681 transitions. Second operand 3 states. [2019-10-02 13:54:54,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:54,295 INFO L93 Difference]: Finished difference Result 1426 states and 2141 transitions. [2019-10-02 13:54:54,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:54:54,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 13:54:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:54,303 INFO L225 Difference]: With dead ends: 1426 [2019-10-02 13:54:54,304 INFO L226 Difference]: Without dead ends: 1205 [2019-10-02 13:54:54,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:54:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-10-02 13:54:54,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1204. [2019-10-02 13:54:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2019-10-02 13:54:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1843 transitions. [2019-10-02 13:54:54,376 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1843 transitions. Word has length 171 [2019-10-02 13:54:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:54,377 INFO L475 AbstractCegarLoop]: Abstraction has 1204 states and 1843 transitions. [2019-10-02 13:54:54,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:54:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1843 transitions. [2019-10-02 13:54:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 13:54:54,391 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:54,392 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:54,392 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1464715799, now seen corresponding path program 1 times [2019-10-02 13:54:54,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:54,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:54,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:54,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:54,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:54,773 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:54:54,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:54,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:54:54,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:54:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:54:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:54:54,776 INFO L87 Difference]: Start difference. First operand 1204 states and 1843 transitions. Second operand 6 states. [2019-10-02 13:54:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:55,638 INFO L93 Difference]: Finished difference Result 2682 states and 4084 transitions. [2019-10-02 13:54:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:54:55,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 295 [2019-10-02 13:54:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:55,673 INFO L225 Difference]: With dead ends: 2682 [2019-10-02 13:54:55,674 INFO L226 Difference]: Without dead ends: 2359 [2019-10-02 13:54:55,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:54:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2019-10-02 13:54:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2348. [2019-10-02 13:54:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2348 states. [2019-10-02 13:54:55,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 3636 transitions. [2019-10-02 13:54:55,912 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 3636 transitions. Word has length 295 [2019-10-02 13:54:55,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:55,913 INFO L475 AbstractCegarLoop]: Abstraction has 2348 states and 3636 transitions. [2019-10-02 13:54:55,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:54:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 3636 transitions. [2019-10-02 13:54:55,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:54:55,995 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:55,995 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:55,995 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:55,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1738724539, now seen corresponding path program 1 times [2019-10-02 13:54:55,996 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:55,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:56,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:56,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:56,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:56,304 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-02 13:54:56,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:56,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:54:56,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:54:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:54:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:54:56,309 INFO L87 Difference]: Start difference. First operand 2348 states and 3636 transitions. Second operand 9 states. [2019-10-02 13:54:56,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:56,801 INFO L93 Difference]: Finished difference Result 2991 states and 4495 transitions. [2019-10-02 13:54:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:54:56,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 296 [2019-10-02 13:54:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:56,830 INFO L225 Difference]: With dead ends: 2991 [2019-10-02 13:54:56,831 INFO L226 Difference]: Without dead ends: 2322 [2019-10-02 13:54:56,835 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:54:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2019-10-02 13:54:56,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2318. [2019-10-02 13:54:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2318 states. [2019-10-02 13:54:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3585 transitions. [2019-10-02 13:54:56,987 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3585 transitions. Word has length 296 [2019-10-02 13:54:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:56,987 INFO L475 AbstractCegarLoop]: Abstraction has 2318 states and 3585 transitions. [2019-10-02 13:54:56,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:54:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3585 transitions. [2019-10-02 13:54:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 13:54:57,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:57,006 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:54:57,006 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2024929825, now seen corresponding path program 1 times [2019-10-02 13:54:57,007 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:57,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:57,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:57,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:57,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:57,567 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:54:57,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:54:57,568 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:54:57,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:58,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 3330 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:54:58,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:54:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 13:54:58,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:54:58,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-10-02 13:54:58,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:54:58,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:54:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:54:58,728 INFO L87 Difference]: Start difference. First operand 2318 states and 3585 transitions. Second operand 29 states. [2019-10-02 13:55:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:38,563 INFO L93 Difference]: Finished difference Result 11222 states and 17411 transitions. [2019-10-02 13:55:38,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 13:55:38,563 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 289 [2019-10-02 13:55:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:38,629 INFO L225 Difference]: With dead ends: 11222 [2019-10-02 13:55:38,629 INFO L226 Difference]: Without dead ends: 8796 [2019-10-02 13:55:38,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10451 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2054, Invalid=28048, Unknown=0, NotChecked=0, Total=30102 [2019-10-02 13:55:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8796 states. [2019-10-02 13:55:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8796 to 8398. [2019-10-02 13:55:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-10-02 13:55:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 12814 transitions. [2019-10-02 13:55:39,286 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 12814 transitions. Word has length 289 [2019-10-02 13:55:39,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:39,287 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 12814 transitions. [2019-10-02 13:55:39,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:55:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 12814 transitions. [2019-10-02 13:55:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:55:39,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:39,324 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:55:39,325 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:39,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:39,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1662268124, now seen corresponding path program 1 times [2019-10-02 13:55:39,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:39,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:39,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:39,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:39,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:55:39,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:55:39,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:55:39,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:55:39,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:55:39,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:55:39,754 INFO L87 Difference]: Start difference. First operand 8398 states and 12814 transitions. Second operand 5 states. [2019-10-02 13:55:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:40,054 INFO L93 Difference]: Finished difference Result 13143 states and 19526 transitions. [2019-10-02 13:55:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:55:40,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 294 [2019-10-02 13:55:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:40,143 INFO L225 Difference]: With dead ends: 13143 [2019-10-02 13:55:40,143 INFO L226 Difference]: Without dead ends: 8027 [2019-10-02 13:55:40,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:55:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8027 states. [2019-10-02 13:55:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8027 to 7953. [2019-10-02 13:55:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7953 states. [2019-10-02 13:55:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7953 states to 7953 states and 12146 transitions. [2019-10-02 13:55:40,680 INFO L78 Accepts]: Start accepts. Automaton has 7953 states and 12146 transitions. Word has length 294 [2019-10-02 13:55:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:40,680 INFO L475 AbstractCegarLoop]: Abstraction has 7953 states and 12146 transitions. [2019-10-02 13:55:40,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:55:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7953 states and 12146 transitions. [2019-10-02 13:55:40,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 13:55:40,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:40,722 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 13:55:40,722 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:40,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:40,723 INFO L82 PathProgramCache]: Analyzing trace with hash -670185011, now seen corresponding path program 1 times [2019-10-02 13:55:40,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:40,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:40,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:40,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:55:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:41,120 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:41,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:41,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 3334 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:55:41,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:55:42,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:42,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2019-10-02 13:55:42,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 13:55:42,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 13:55:42,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:55:42,218 INFO L87 Difference]: Start difference. First operand 7953 states and 12146 transitions. Second operand 21 states. [2019-10-02 13:55:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:55:44,741 INFO L93 Difference]: Finished difference Result 16533 states and 25889 transitions. [2019-10-02 13:55:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-02 13:55:44,741 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 293 [2019-10-02 13:55:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:55:44,793 INFO L225 Difference]: With dead ends: 16533 [2019-10-02 13:55:44,794 INFO L226 Difference]: Without dead ends: 8465 [2019-10-02 13:55:44,832 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:55:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8465 states. [2019-10-02 13:55:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8465 to 8423. [2019-10-02 13:55:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8423 states. [2019-10-02 13:55:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8423 states to 8423 states and 12922 transitions. [2019-10-02 13:55:45,244 INFO L78 Accepts]: Start accepts. Automaton has 8423 states and 12922 transitions. Word has length 293 [2019-10-02 13:55:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:45,246 INFO L475 AbstractCegarLoop]: Abstraction has 8423 states and 12922 transitions. [2019-10-02 13:55:45,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 13:55:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 8423 states and 12922 transitions. [2019-10-02 13:55:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:55:45,281 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:45,282 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:55:45,282 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:45,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash 34125307, now seen corresponding path program 1 times [2019-10-02 13:55:45,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:45,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:45,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:45,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:55:45,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:45,919 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:46,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:46,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:55:46,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:55:46,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:46,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:55:46,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:55:46,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:55:46,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:55:46,807 INFO L87 Difference]: Start difference. First operand 8423 states and 12922 transitions. Second operand 25 states. [2019-10-02 13:56:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:20,513 INFO L93 Difference]: Finished difference Result 22829 states and 35044 transitions. [2019-10-02 13:56:20,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 13:56:20,513 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 294 [2019-10-02 13:56:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:20,562 INFO L225 Difference]: With dead ends: 22829 [2019-10-02 13:56:20,562 INFO L226 Difference]: Without dead ends: 12741 [2019-10-02 13:56:20,610 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9535 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 13:56:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-10-02 13:56:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 11523. [2019-10-02 13:56:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11523 states. [2019-10-02 13:56:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11523 states to 11523 states and 17493 transitions. [2019-10-02 13:56:21,163 INFO L78 Accepts]: Start accepts. Automaton has 11523 states and 17493 transitions. Word has length 294 [2019-10-02 13:56:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:21,164 INFO L475 AbstractCegarLoop]: Abstraction has 11523 states and 17493 transitions. [2019-10-02 13:56:21,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:56:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 11523 states and 17493 transitions. [2019-10-02 13:56:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:56:21,202 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:56:21,203 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 13:56:21,204 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:56:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:56:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash 372132554, now seen corresponding path program 1 times [2019-10-02 13:56:21,204 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:56:21,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:56:21,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:21,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 13:56:21,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:56:21,636 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:56:21,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:22,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:56:22,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:56:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:56:22,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:56:22,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2019-10-02 13:56:22,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 13:56:22,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 13:56:22,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:56:22,552 INFO L87 Difference]: Start difference. First operand 11523 states and 17493 transitions. Second operand 25 states. [2019-10-02 13:56:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:56:56,406 INFO L93 Difference]: Finished difference Result 30207 states and 46051 transitions. [2019-10-02 13:56:56,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-10-02 13:56:56,406 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 294 [2019-10-02 13:56:56,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:56:56,470 INFO L225 Difference]: With dead ends: 30207 [2019-10-02 13:56:56,470 INFO L226 Difference]: Without dead ends: 16167 [2019-10-02 13:56:56,513 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9535 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1939, Invalid=25451, Unknown=0, NotChecked=0, Total=27390 [2019-10-02 13:56:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16167 states. [2019-10-02 13:56:57,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16167 to 13930. [2019-10-02 13:56:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13930 states. [2019-10-02 13:56:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13930 states to 13930 states and 21003 transitions. [2019-10-02 13:56:57,248 INFO L78 Accepts]: Start accepts. Automaton has 13930 states and 21003 transitions. Word has length 294 [2019-10-02 13:56:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:56:57,249 INFO L475 AbstractCegarLoop]: Abstraction has 13930 states and 21003 transitions. [2019-10-02 13:56:57,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 13:56:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 13930 states and 21003 transitions. [2019-10-02 13:56:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:56:57,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:56:57,280 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:56:57,281 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:56:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:56:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 797921752, now seen corresponding path program 1 times [2019-10-02 13:56:57,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:56:57,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:56:57,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:57,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:57,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:56:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 13:56:57,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:56:57,716 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:56:57,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:56:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:56:58,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 3336 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:56:58,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:56:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:56:58,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:56:58,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-10-02 13:56:58,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 13:56:58,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 13:56:58,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=748, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:56:58,720 INFO L87 Difference]: Start difference. First operand 13930 states and 21003 transitions. Second operand 29 states. [2019-10-02 13:57:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:34,495 INFO L93 Difference]: Finished difference Result 50626 states and 77994 transitions. [2019-10-02 13:57:34,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2019-10-02 13:57:34,496 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 296 [2019-10-02 13:57:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:34,664 INFO L225 Difference]: With dead ends: 50626 [2019-10-02 13:57:34,665 INFO L226 Difference]: Without dead ends: 32304 [2019-10-02 13:57:34,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15335 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2506, Invalid=39314, Unknown=0, NotChecked=0, Total=41820 [2019-10-02 13:57:34,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32304 states. [2019-10-02 13:57:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32304 to 28239. [2019-10-02 13:57:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28239 states. [2019-10-02 13:57:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28239 states to 28239 states and 42630 transitions. [2019-10-02 13:57:36,292 INFO L78 Accepts]: Start accepts. Automaton has 28239 states and 42630 transitions. Word has length 296 [2019-10-02 13:57:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:36,293 INFO L475 AbstractCegarLoop]: Abstraction has 28239 states and 42630 transitions. [2019-10-02 13:57:36,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 13:57:36,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28239 states and 42630 transitions. [2019-10-02 13:57:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:57:36,311 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:36,312 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:36,312 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:36,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:36,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1356823325, now seen corresponding path program 1 times [2019-10-02 13:57:36,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:36,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:36,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:57:36,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:36,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:57:36,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:57:36,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:57:36,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:57:36,832 INFO L87 Difference]: Start difference. First operand 28239 states and 42630 transitions. Second operand 9 states. [2019-10-02 13:57:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:37,559 INFO L93 Difference]: Finished difference Result 52177 states and 80097 transitions. [2019-10-02 13:57:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:57:37,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2019-10-02 13:57:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:37,704 INFO L225 Difference]: With dead ends: 52177 [2019-10-02 13:57:37,704 INFO L226 Difference]: Without dead ends: 29246 [2019-10-02 13:57:37,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:57:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29246 states. [2019-10-02 13:57:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29246 to 28987. [2019-10-02 13:57:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28987 states. [2019-10-02 13:57:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28987 states to 28987 states and 43813 transitions. [2019-10-02 13:57:39,012 INFO L78 Accepts]: Start accepts. Automaton has 28987 states and 43813 transitions. Word has length 297 [2019-10-02 13:57:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:39,013 INFO L475 AbstractCegarLoop]: Abstraction has 28987 states and 43813 transitions. [2019-10-02 13:57:39,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:57:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28987 states and 43813 transitions. [2019-10-02 13:57:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:57:39,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:39,035 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:39,036 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash -255511680, now seen corresponding path program 1 times [2019-10-02 13:57:39,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:39,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:39,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:57:39,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:57:39,224 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:57:39,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:41,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 3337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:57:41,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:57:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 13:57:41,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:57:41,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-10-02 13:57:41,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:57:41,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:57:41,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:57:41,336 INFO L87 Difference]: Start difference. First operand 28987 states and 43813 transitions. Second operand 10 states. [2019-10-02 13:57:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:46,619 INFO L93 Difference]: Finished difference Result 87908 states and 133276 transitions. [2019-10-02 13:57:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:57:46,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 296 [2019-10-02 13:57:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:46,900 INFO L225 Difference]: With dead ends: 87908 [2019-10-02 13:57:46,901 INFO L226 Difference]: Without dead ends: 58739 [2019-10-02 13:57:47,010 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:57:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58739 states. [2019-10-02 13:57:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58739 to 58127. [2019-10-02 13:57:49,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58127 states. [2019-10-02 13:57:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58127 states to 58127 states and 87914 transitions. [2019-10-02 13:57:49,462 INFO L78 Accepts]: Start accepts. Automaton has 58127 states and 87914 transitions. Word has length 296 [2019-10-02 13:57:49,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:49,463 INFO L475 AbstractCegarLoop]: Abstraction has 58127 states and 87914 transitions. [2019-10-02 13:57:49,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:57:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 58127 states and 87914 transitions. [2019-10-02 13:57:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:57:49,497 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:49,498 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:57:49,498 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:49,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:49,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1187005735, now seen corresponding path program 1 times [2019-10-02 13:57:49,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:49,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:49,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:49,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:57:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:49,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:57:49,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:57:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:57:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:57:49,713 INFO L87 Difference]: Start difference. First operand 58127 states and 87914 transitions. Second operand 9 states. [2019-10-02 13:57:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:51,584 INFO L93 Difference]: Finished difference Result 109965 states and 169340 transitions. [2019-10-02 13:57:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:57:51,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2019-10-02 13:57:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:51,884 INFO L225 Difference]: With dead ends: 109965 [2019-10-02 13:57:51,885 INFO L226 Difference]: Without dead ends: 60115 [2019-10-02 13:57:52,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:57:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60115 states. [2019-10-02 13:57:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60115 to 59702. [2019-10-02 13:57:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59702 states. [2019-10-02 13:57:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59702 states to 59702 states and 90361 transitions. [2019-10-02 13:57:57,188 INFO L78 Accepts]: Start accepts. Automaton has 59702 states and 90361 transitions. Word has length 300 [2019-10-02 13:57:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:57:57,189 INFO L475 AbstractCegarLoop]: Abstraction has 59702 states and 90361 transitions. [2019-10-02 13:57:57,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:57:57,189 INFO L276 IsEmpty]: Start isEmpty. Operand 59702 states and 90361 transitions. [2019-10-02 13:57:57,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:57:57,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:57:57,220 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 13:57:57,220 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:57:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:57:57,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1657413811, now seen corresponding path program 1 times [2019-10-02 13:57:57,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:57:57,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:57:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:57,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:57:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:57:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:57:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:57:57,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:57:57,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:57:57,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:57:57,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:57:57,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:57:57,448 INFO L87 Difference]: Start difference. First operand 59702 states and 90361 transitions. Second operand 9 states. [2019-10-02 13:57:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:57:58,616 INFO L93 Difference]: Finished difference Result 89276 states and 136233 transitions. [2019-10-02 13:57:58,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 13:57:58,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 297 [2019-10-02 13:57:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:57:58,751 INFO L225 Difference]: With dead ends: 89276 [2019-10-02 13:57:58,751 INFO L226 Difference]: Without dead ends: 36612 [2019-10-02 13:57:58,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:57:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36612 states. [2019-10-02 13:58:00,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36612 to 36484. [2019-10-02 13:58:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36484 states. [2019-10-02 13:58:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36484 states to 36484 states and 54842 transitions. [2019-10-02 13:58:00,846 INFO L78 Accepts]: Start accepts. Automaton has 36484 states and 54842 transitions. Word has length 297 [2019-10-02 13:58:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:00,846 INFO L475 AbstractCegarLoop]: Abstraction has 36484 states and 54842 transitions. [2019-10-02 13:58:00,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:58:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 36484 states and 54842 transitions. [2019-10-02 13:58:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:58:00,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:00,872 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:00,872 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash 463131064, now seen corresponding path program 1 times [2019-10-02 13:58:00,872 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:00,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:00,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:58:01,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:01,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:58:01,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:58:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:58:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:58:01,045 INFO L87 Difference]: Start difference. First operand 36484 states and 54842 transitions. Second operand 5 states. [2019-10-02 13:58:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:01,890 INFO L93 Difference]: Finished difference Result 66703 states and 101149 transitions. [2019-10-02 13:58:01,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:58:01,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 300 [2019-10-02 13:58:01,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:02,039 INFO L225 Difference]: With dead ends: 66703 [2019-10-02 13:58:02,040 INFO L226 Difference]: Without dead ends: 36574 [2019-10-02 13:58:02,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:58:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36574 states. [2019-10-02 13:58:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36574 to 36524. [2019-10-02 13:58:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36524 states. [2019-10-02 13:58:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36524 states to 36524 states and 54815 transitions. [2019-10-02 13:58:04,030 INFO L78 Accepts]: Start accepts. Automaton has 36524 states and 54815 transitions. Word has length 300 [2019-10-02 13:58:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:04,031 INFO L475 AbstractCegarLoop]: Abstraction has 36524 states and 54815 transitions. [2019-10-02 13:58:04,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:58:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 36524 states and 54815 transitions. [2019-10-02 13:58:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:58:04,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:04,056 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:04,056 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:04,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:04,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1135009235, now seen corresponding path program 1 times [2019-10-02 13:58:04,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:04,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:04,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:04,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:58:04,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:04,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:58:04,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:58:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:58:04,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:58:04,294 INFO L87 Difference]: Start difference. First operand 36524 states and 54815 transitions. Second operand 13 states. [2019-10-02 13:58:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:09,404 INFO L93 Difference]: Finished difference Result 102332 states and 155280 transitions. [2019-10-02 13:58:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:58:09,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 296 [2019-10-02 13:58:09,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:09,667 INFO L225 Difference]: With dead ends: 102332 [2019-10-02 13:58:09,668 INFO L226 Difference]: Without dead ends: 72737 [2019-10-02 13:58:09,762 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:58:09,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72737 states. [2019-10-02 13:58:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72737 to 72327. [2019-10-02 13:58:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72327 states. [2019-10-02 13:58:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72327 states to 72327 states and 108228 transitions. [2019-10-02 13:58:12,989 INFO L78 Accepts]: Start accepts. Automaton has 72327 states and 108228 transitions. Word has length 296 [2019-10-02 13:58:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:12,990 INFO L475 AbstractCegarLoop]: Abstraction has 72327 states and 108228 transitions. [2019-10-02 13:58:12,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:58:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 72327 states and 108228 transitions. [2019-10-02 13:58:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-02 13:58:13,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:13,054 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:13,055 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash -830410233, now seen corresponding path program 1 times [2019-10-02 13:58:13,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:13,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:13,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:13,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 13:58:13,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:13,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:13,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:13,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:13,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:13,205 INFO L87 Difference]: Start difference. First operand 72327 states and 108228 transitions. Second operand 3 states. [2019-10-02 13:58:15,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:15,831 INFO L93 Difference]: Finished difference Result 151489 states and 228799 transitions. [2019-10-02 13:58:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:15,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-10-02 13:58:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:16,116 INFO L225 Difference]: With dead ends: 151489 [2019-10-02 13:58:16,116 INFO L226 Difference]: Without dead ends: 79251 [2019-10-02 13:58:16,249 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79251 states. [2019-10-02 13:58:22,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79251 to 79239. [2019-10-02 13:58:22,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79239 states. [2019-10-02 13:58:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79239 states to 79239 states and 120468 transitions. [2019-10-02 13:58:22,494 INFO L78 Accepts]: Start accepts. Automaton has 79239 states and 120468 transitions. Word has length 294 [2019-10-02 13:58:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:22,494 INFO L475 AbstractCegarLoop]: Abstraction has 79239 states and 120468 transitions. [2019-10-02 13:58:22,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:22,495 INFO L276 IsEmpty]: Start isEmpty. Operand 79239 states and 120468 transitions. [2019-10-02 13:58:22,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:58:22,593 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:22,593 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:22,594 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1961029764, now seen corresponding path program 1 times [2019-10-02 13:58:22,594 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:22,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:22,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 13:58:22,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:22,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:58:22,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:58:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:58:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:58:22,860 INFO L87 Difference]: Start difference. First operand 79239 states and 120468 transitions. Second operand 11 states. [2019-10-02 13:58:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:32,866 INFO L93 Difference]: Finished difference Result 156228 states and 233211 transitions. [2019-10-02 13:58:32,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:58:32,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 298 [2019-10-02 13:58:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:33,204 INFO L225 Difference]: With dead ends: 156228 [2019-10-02 13:58:33,204 INFO L226 Difference]: Without dead ends: 97289 [2019-10-02 13:58:33,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:58:33,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97289 states. [2019-10-02 13:58:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97289 to 92936. [2019-10-02 13:58:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92936 states. [2019-10-02 13:58:37,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92936 states to 92936 states and 141316 transitions. [2019-10-02 13:58:37,322 INFO L78 Accepts]: Start accepts. Automaton has 92936 states and 141316 transitions. Word has length 298 [2019-10-02 13:58:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:37,323 INFO L475 AbstractCegarLoop]: Abstraction has 92936 states and 141316 transitions. [2019-10-02 13:58:37,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:58:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 92936 states and 141316 transitions. [2019-10-02 13:58:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 13:58:37,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:37,396 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:58:37,396 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1416195272, now seen corresponding path program 1 times [2019-10-02 13:58:37,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:37,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:37,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:37,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:37,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 13:58:37,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:37,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:37,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:37,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:37,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:37,564 INFO L87 Difference]: Start difference. First operand 92936 states and 141316 transitions. Second operand 3 states. [2019-10-02 13:58:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:42,964 INFO L93 Difference]: Finished difference Result 199811 states and 307599 transitions. [2019-10-02 13:58:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:42,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-10-02 13:58:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:43,373 INFO L225 Difference]: With dead ends: 199811 [2019-10-02 13:58:43,373 INFO L226 Difference]: Without dead ends: 106964 [2019-10-02 13:58:43,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106964 states. [2019-10-02 13:58:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106964 to 106894. [2019-10-02 13:58:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106894 states. [2019-10-02 13:58:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106894 states to 106894 states and 165903 transitions. [2019-10-02 13:58:51,211 INFO L78 Accepts]: Start accepts. Automaton has 106894 states and 165903 transitions. Word has length 331 [2019-10-02 13:58:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:58:51,212 INFO L475 AbstractCegarLoop]: Abstraction has 106894 states and 165903 transitions. [2019-10-02 13:58:51,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:58:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 106894 states and 165903 transitions. [2019-10-02 13:58:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 13:58:51,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:58:51,328 INFO L411 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, 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] [2019-10-02 13:58:51,328 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:58:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:58:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1191615116, now seen corresponding path program 1 times [2019-10-02 13:58:51,328 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:58:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:58:51,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:51,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:58:51,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:58:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:58:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:58:51,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:58:51,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:58:51,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:58:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:58:51,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:58:51,502 INFO L87 Difference]: Start difference. First operand 106894 states and 165903 transitions. Second operand 3 states. [2019-10-02 13:58:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:59,649 INFO L93 Difference]: Finished difference Result 239823 states and 378373 transitions. [2019-10-02 13:58:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:58:59,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 350 [2019-10-02 13:58:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:00,151 INFO L225 Difference]: With dead ends: 239823 [2019-10-02 13:59:00,151 INFO L226 Difference]: Without dead ends: 133018 [2019-10-02 13:59:00,342 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:59:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133018 states. [2019-10-02 13:59:05,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133018 to 133006. [2019-10-02 13:59:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133006 states. [2019-10-02 13:59:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133006 states to 133006 states and 211791 transitions. [2019-10-02 13:59:06,021 INFO L78 Accepts]: Start accepts. Automaton has 133006 states and 211791 transitions. Word has length 350 [2019-10-02 13:59:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:06,021 INFO L475 AbstractCegarLoop]: Abstraction has 133006 states and 211791 transitions. [2019-10-02 13:59:06,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:59:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 133006 states and 211791 transitions. [2019-10-02 13:59:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-02 13:59:06,262 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:06,262 INFO L411 BasicCegarLoop]: trace histogram [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, 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] [2019-10-02 13:59:06,262 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1252187854, now seen corresponding path program 1 times [2019-10-02 13:59:06,262 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:06,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:06,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:06,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:06,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 13:59:07,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:07,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:59:07,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:59:07,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:59:07,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:59:07,164 INFO L87 Difference]: Start difference. First operand 133006 states and 211791 transitions. Second operand 7 states. [2019-10-02 13:59:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:16,209 INFO L93 Difference]: Finished difference Result 266031 states and 425977 transitions. [2019-10-02 13:59:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:59:16,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 348 [2019-10-02 13:59:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:16,576 INFO L225 Difference]: With dead ends: 266031 [2019-10-02 13:59:16,577 INFO L226 Difference]: Without dead ends: 133114 [2019-10-02 13:59:16,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:59:16,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133114 states. [2019-10-02 13:59:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133114 to 133114. [2019-10-02 13:59:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133114 states. [2019-10-02 13:59:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133114 states to 133114 states and 211923 transitions. [2019-10-02 13:59:26,593 INFO L78 Accepts]: Start accepts. Automaton has 133114 states and 211923 transitions. Word has length 348 [2019-10-02 13:59:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:26,594 INFO L475 AbstractCegarLoop]: Abstraction has 133114 states and 211923 transitions. [2019-10-02 13:59:26,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:59:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 133114 states and 211923 transitions. [2019-10-02 13:59:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 13:59:26,823 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:26,823 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:26,823 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:26,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:26,824 INFO L82 PathProgramCache]: Analyzing trace with hash 187265673, now seen corresponding path program 1 times [2019-10-02 13:59:26,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:26,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:26,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-10-02 13:59:27,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:59:27,029 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:59:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:27,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 3632 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:59:27,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:59:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-02 13:59:27,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:59:27,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-10-02 13:59:27,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:59:27,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:59:27,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:59:27,876 INFO L87 Difference]: Start difference. First operand 133114 states and 211923 transitions. Second operand 9 states. [2019-10-02 13:59:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:32,352 INFO L93 Difference]: Finished difference Result 207278 states and 321252 transitions. [2019-10-02 13:59:32,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:59:32,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 335 [2019-10-02 13:59:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:32,904 INFO L225 Difference]: With dead ends: 207278 [2019-10-02 13:59:32,904 INFO L226 Difference]: Without dead ends: 133026 [2019-10-02 13:59:33,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:59:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133026 states. [2019-10-02 13:59:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133026 to 133007. [2019-10-02 13:59:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133007 states. [2019-10-02 13:59:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133007 states to 133007 states and 210388 transitions. [2019-10-02 13:59:40,127 INFO L78 Accepts]: Start accepts. Automaton has 133007 states and 210388 transitions. Word has length 335 [2019-10-02 13:59:40,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:40,127 INFO L475 AbstractCegarLoop]: Abstraction has 133007 states and 210388 transitions. [2019-10-02 13:59:40,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:59:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 133007 states and 210388 transitions. [2019-10-02 13:59:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 13:59:40,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:40,358 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:59:40,358 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash 140976489, now seen corresponding path program 1 times [2019-10-02 13:59:40,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:40,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:40,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:40,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:40,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 13:59:40,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:59:40,592 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:59:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:41,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 3686 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:59:41,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:59:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:59:46,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:59:46,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 13:59:46,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:59:46,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:59:46,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:59:46,369 INFO L87 Difference]: Start difference. First operand 133007 states and 210388 transitions. Second operand 12 states. [2019-10-02 13:59:50,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:59:50,729 INFO L93 Difference]: Finished difference Result 211131 states and 324049 transitions. [2019-10-02 13:59:50,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:59:50,729 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 351 [2019-10-02 13:59:50,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:59:51,226 INFO L225 Difference]: With dead ends: 211131 [2019-10-02 13:59:51,226 INFO L226 Difference]: Without dead ends: 134754 [2019-10-02 13:59:51,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:59:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134754 states. [2019-10-02 13:59:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134754 to 134032. [2019-10-02 13:59:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134032 states. [2019-10-02 13:59:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134032 states to 134032 states and 211892 transitions. [2019-10-02 13:59:58,921 INFO L78 Accepts]: Start accepts. Automaton has 134032 states and 211892 transitions. Word has length 351 [2019-10-02 13:59:58,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:59:58,922 INFO L475 AbstractCegarLoop]: Abstraction has 134032 states and 211892 transitions. [2019-10-02 13:59:58,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:59:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 134032 states and 211892 transitions. [2019-10-02 13:59:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 13:59:59,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:59:59,173 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:59:59,174 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:59:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:59:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash 271599779, now seen corresponding path program 1 times [2019-10-02 13:59:59,174 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:59:59,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:59:59,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:59,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:59:59,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:59:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:59:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 13:59:59,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:59:59,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:59:59,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:59:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:59:59,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:59:59,299 INFO L87 Difference]: Start difference. First operand 134032 states and 211892 transitions. Second operand 3 states. [2019-10-02 14:00:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:08,547 INFO L93 Difference]: Finished difference Result 317243 states and 510650 transitions. [2019-10-02 14:00:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:00:08,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-10-02 14:00:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:00:09,225 INFO L225 Difference]: With dead ends: 317243 [2019-10-02 14:00:09,225 INFO L226 Difference]: Without dead ends: 184075 [2019-10-02 14:00:09,470 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:00:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184075 states. [2019-10-02 14:00:22,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184075 to 184063. [2019-10-02 14:00:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184063 states. [2019-10-02 14:00:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184063 states to 184063 states and 298431 transitions. [2019-10-02 14:00:22,729 INFO L78 Accepts]: Start accepts. Automaton has 184063 states and 298431 transitions. Word has length 323 [2019-10-02 14:00:22,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:00:22,730 INFO L475 AbstractCegarLoop]: Abstraction has 184063 states and 298431 transitions. [2019-10-02 14:00:22,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:00:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 184063 states and 298431 transitions. [2019-10-02 14:00:23,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-02 14:00:23,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:00:23,180 INFO L411 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:00:23,180 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:00:23,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:00:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1769865542, now seen corresponding path program 1 times [2019-10-02 14:00:23,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:00:23,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:00:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:23,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:00:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:23,411 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 14:00:23,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:00:23,411 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:00:23,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:00:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:00:24,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 3733 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:00:24,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:00:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 14:00:25,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:00:25,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 14:00:25,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:00:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:00:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:00:25,082 INFO L87 Difference]: Start difference. First operand 184063 states and 298431 transitions. Second operand 13 states. [2019-10-02 14:00:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:00:56,779 INFO L93 Difference]: Finished difference Result 554069 states and 1031761 transitions. [2019-10-02 14:00:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 14:00:56,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 365 [2019-10-02 14:00:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:01:06,170 INFO L225 Difference]: With dead ends: 554069 [2019-10-02 14:01:06,170 INFO L226 Difference]: Without dead ends: 438102 [2019-10-02 14:01:06,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 14:01:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438102 states. [2019-10-02 14:01:30,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438102 to 421781. [2019-10-02 14:01:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421781 states. [2019-10-02 14:01:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421781 states to 421781 states and 757583 transitions. [2019-10-02 14:01:45,129 INFO L78 Accepts]: Start accepts. Automaton has 421781 states and 757583 transitions. Word has length 365 [2019-10-02 14:01:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:01:45,129 INFO L475 AbstractCegarLoop]: Abstraction has 421781 states and 757583 transitions. [2019-10-02 14:01:45,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:01:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 421781 states and 757583 transitions. [2019-10-02 14:01:45,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 14:01:45,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:01:45,673 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:01:45,673 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:01:45,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:01:45,673 INFO L82 PathProgramCache]: Analyzing trace with hash 780301665, now seen corresponding path program 1 times [2019-10-02 14:01:45,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:01:45,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:01:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:45,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:01:45,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:01:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:01:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:01:47,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:01:47,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:01:47,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:01:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:01:47,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:01:47,479 INFO L87 Difference]: Start difference. First operand 421781 states and 757583 transitions. Second operand 3 states. [2019-10-02 14:02:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:02:26,498 INFO L93 Difference]: Finished difference Result 935795 states and 1674820 transitions. [2019-10-02 14:02:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:02:26,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 322 [2019-10-02 14:02:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:02:28,813 INFO L225 Difference]: With dead ends: 935795 [2019-10-02 14:02:28,813 INFO L226 Difference]: Without dead ends: 519203 [2019-10-02 14:02:30,872 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:02:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519203 states. [2019-10-02 14:03:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519203 to 519163. [2019-10-02 14:03:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519163 states. [2019-10-02 14:03:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519163 states to 519163 states and 921942 transitions. [2019-10-02 14:03:32,507 INFO L78 Accepts]: Start accepts. Automaton has 519163 states and 921942 transitions. Word has length 322 [2019-10-02 14:03:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:03:32,507 INFO L475 AbstractCegarLoop]: Abstraction has 519163 states and 921942 transitions. [2019-10-02 14:03:32,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:03:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 519163 states and 921942 transitions. [2019-10-02 14:03:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2019-10-02 14:03:33,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:03:33,501 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 14:03:33,502 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:03:33,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:03:33,502 INFO L82 PathProgramCache]: Analyzing trace with hash 675050792, now seen corresponding path program 1 times [2019-10-02 14:03:33,502 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:03:33,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:03:33,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:33,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:03:33,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:03:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:03:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-10-02 14:03:33,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:03:33,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:03:33,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:03:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:03:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:03:33,659 INFO L87 Difference]: Start difference. First operand 519163 states and 921942 transitions. Second operand 3 states. [2019-10-02 14:04:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:04:28,215 INFO L93 Difference]: Finished difference Result 1213562 states and 2147949 transitions. [2019-10-02 14:04:28,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:04:28,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2019-10-02 14:04:28,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:04:32,428 INFO L225 Difference]: With dead ends: 1213562 [2019-10-02 14:04:32,428 INFO L226 Difference]: Without dead ends: 701956 [2019-10-02 14:04:33,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:04:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701956 states.