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_spec27_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:09:13,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:09:13,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:09:13,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:09:13,535 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:09:13,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:09:13,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:09:13,551 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:09:13,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:09:13,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:09:13,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:09:13,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:09:13,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:09:13,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:09:13,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:09:13,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:09:13,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:09:13,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:09:13,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:09:13,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:09:13,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:09:13,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:09:13,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:09:13,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:09:13,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:09:13,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:09:13,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:09:13,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:09:13,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:09:13,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:09:13,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:09:13,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:09:13,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:09:13,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:09:13,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:09:13,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:09:13,593 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:09:13,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:09:13,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:09:13,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:09:13,595 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:09:13,596 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:09:13,610 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:09:13,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:09:13,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:09:13,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:09:13,612 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:09:13,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:09:13,612 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:09:13,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:09:13,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:09:13,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:09:13,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:09:13,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:09:13,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:09:13,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:09:13,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:09:13,614 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:09:13,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:09:13,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:09:13,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:09:13,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:09:13,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:09:13,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:09:13,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:09:13,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:09:13,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:09:13,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:09:13,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:09:13,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:09:13,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:09:13,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:09:13,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:09:13,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:09:13,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:09:13,673 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:09:13,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product30.cil.c [2019-10-02 13:09:13,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded73c899/110fe85e103640128959856e1fd40cf3/FLAG3577c51bd [2019-10-02 13:09:14,361 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:09:14,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product30.cil.c [2019-10-02 13:09:14,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded73c899/110fe85e103640128959856e1fd40cf3/FLAG3577c51bd [2019-10-02 13:09:14,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded73c899/110fe85e103640128959856e1fd40cf3 [2019-10-02 13:09:14,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:09:14,596 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:09:14,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:09:14,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:09:14,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:09:14,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:09:14" (1/1) ... [2019-10-02 13:09:14,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7201854e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:14, skipping insertion in model container [2019-10-02 13:09:14,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:09:14" (1/1) ... [2019-10-02 13:09:14,613 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:09:14,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:09:15,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:09:15,493 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:09:15,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:09:15,774 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:09:15,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15 WrapperNode [2019-10-02 13:09:15,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:09:15,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:09:15,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:09:15,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:09:15,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (1/1) ... [2019-10-02 13:09:15,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:09:15,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:09:15,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:09:15,962 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:09:15,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (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:09:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:09:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:09:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:09:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:09:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:09:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:09:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:09:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:09:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:09:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:09:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:09:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:09:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:09:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:09:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:09:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:09:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:09:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:09:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:09:16,040 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:09:16,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:09:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:09:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:09:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:09:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:09:16,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:09:16,042 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:09:16,043 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:09:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:09:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:09:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:09:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:09:16,044 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:09:16,045 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:09:16,046 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:09:16,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:09:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:09:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:09:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:09:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:09:16,048 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:09:16,049 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:09:16,049 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:09:16,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:09:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:09:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:09:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:09:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:09:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:09:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:09:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:09:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 13:09:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 13:09:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:09:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:09:16,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:09:16,053 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:09:16,053 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:09:16,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:09:16,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:09:16,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:09:16,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:09:16,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:09:16,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:09:16,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:09:16,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:09:16,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:09:16,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:09:16,056 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:09:16,057 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:09:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:09:16,058 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:09:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:09:16,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:09:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:09:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:09:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:09:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:09:16,059 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:09:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:09:16,060 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:09:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:09:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:09:16,061 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:09:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:09:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:09:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:09:16,062 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:09:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:09:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:09:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:09:16,063 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:09:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:09:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:09:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:09:16,064 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:09:16,065 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:09:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:09:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:09:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:09:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:09:16,075 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:09:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:09:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:09:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:09:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:09:16,077 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:09:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:09:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:09:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:09:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:09:16,078 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:09:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:09:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:09:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:09:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:09:16,079 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:09:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:09:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:09:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:09:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:09:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:09:16,080 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:09:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:09:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:09:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:09:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:09:16,081 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:09:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:09:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:09:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:09:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:09:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:09:16,082 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:09:16,083 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:09:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:09:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:09:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:09:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:09:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:09:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:09:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:09:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:09:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:09:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:09:16,086 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:09:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:09:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:09:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:09:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:09:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 13:09:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 13:09:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:09:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:09:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:09:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:09:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:09:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:09:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:09:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:09:16,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:09:16,091 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:09:16,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:09:16,091 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:09:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:09:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:09:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:09:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:09:16,092 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:09:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:09:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:09:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:09:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:09:16,093 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:09:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:09:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:09:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:09:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:09:16,094 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:09:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:09:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:09:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:09:16,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:09:18,376 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:09:18,376 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:09:18,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:09:18 BoogieIcfgContainer [2019-10-02 13:09:18,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:09:18,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:09:18,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:09:18,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:09:18,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:09:14" (1/3) ... [2019-10-02 13:09:18,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a4224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:09:18, skipping insertion in model container [2019-10-02 13:09:18,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:09:15" (2/3) ... [2019-10-02 13:09:18,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a4224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:09:18, skipping insertion in model container [2019-10-02 13:09:18,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:09:18" (3/3) ... [2019-10-02 13:09:18,388 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product30.cil.c [2019-10-02 13:09:18,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:09:18,410 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:09:18,426 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:09:18,466 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:09:18,466 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:09:18,466 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:09:18,467 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:09:18,467 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:09:18,468 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:09:18,471 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:09:18,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:09:18,472 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:09:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states. [2019-10-02 13:09:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 13:09:18,537 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:18,539 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:18,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:18,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:18,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1742226729, now seen corresponding path program 1 times [2019-10-02 13:09:18,549 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:18,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:18,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:19,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:19,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:09:19,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:09:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:09:19,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:09:19,251 INFO L87 Difference]: Start difference. First operand 546 states. Second operand 2 states. [2019-10-02 13:09:19,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:19,360 INFO L93 Difference]: Finished difference Result 788 states and 1045 transitions. [2019-10-02 13:09:19,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:09:19,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 211 [2019-10-02 13:09:19,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:19,399 INFO L225 Difference]: With dead ends: 788 [2019-10-02 13:09:19,399 INFO L226 Difference]: Without dead ends: 500 [2019-10-02 13:09:19,410 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:09:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-02 13:09:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-10-02 13:09:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-10-02 13:09:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 664 transitions. [2019-10-02 13:09:19,525 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 664 transitions. Word has length 211 [2019-10-02 13:09:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:19,527 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 664 transitions. [2019-10-02 13:09:19,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:09:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 664 transitions. [2019-10-02 13:09:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:09:19,533 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:19,534 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:19,534 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:19,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:19,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1814113968, now seen corresponding path program 1 times [2019-10-02 13:09:19,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:19,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:19,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:19,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:19,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:09:19,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:09:19,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:09:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:09:19,832 INFO L87 Difference]: Start difference. First operand 500 states and 664 transitions. Second operand 3 states. [2019-10-02 13:09:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:19,895 INFO L93 Difference]: Finished difference Result 771 states and 1008 transitions. [2019-10-02 13:09:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:09:19,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-10-02 13:09:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:19,901 INFO L225 Difference]: With dead ends: 771 [2019-10-02 13:09:19,902 INFO L226 Difference]: Without dead ends: 503 [2019-10-02 13:09:19,918 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:09:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-02 13:09:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 502. [2019-10-02 13:09:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-10-02 13:09:19,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 666 transitions. [2019-10-02 13:09:19,962 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 666 transitions. Word has length 212 [2019-10-02 13:09:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:19,963 INFO L475 AbstractCegarLoop]: Abstraction has 502 states and 666 transitions. [2019-10-02 13:09:19,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:09:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 666 transitions. [2019-10-02 13:09:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:09:19,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:19,968 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:19,969 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1188714336, now seen corresponding path program 1 times [2019-10-02 13:09:19,969 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:19,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:19,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:20,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:20,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:09:20,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:09:20,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:09:20,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:09:20,182 INFO L87 Difference]: Start difference. First operand 502 states and 666 transitions. Second operand 3 states. [2019-10-02 13:09:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:20,228 INFO L93 Difference]: Finished difference Result 980 states and 1330 transitions. [2019-10-02 13:09:20,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:09:20,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 222 [2019-10-02 13:09:20,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:20,236 INFO L225 Difference]: With dead ends: 980 [2019-10-02 13:09:20,236 INFO L226 Difference]: Without dead ends: 543 [2019-10-02 13:09:20,238 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:09:20,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-10-02 13:09:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 542. [2019-10-02 13:09:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-02 13:09:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 735 transitions. [2019-10-02 13:09:20,276 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 735 transitions. Word has length 222 [2019-10-02 13:09:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:20,277 INFO L475 AbstractCegarLoop]: Abstraction has 542 states and 735 transitions. [2019-10-02 13:09:20,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:09:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 735 transitions. [2019-10-02 13:09:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 13:09:20,286 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:20,286 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:20,286 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1821969317, now seen corresponding path program 1 times [2019-10-02 13:09:20,287 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:20,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:20,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:20,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:20,484 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:20,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:20,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:09:20,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:09:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:09:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:09:20,486 INFO L87 Difference]: Start difference. First operand 542 states and 735 transitions. Second operand 3 states. [2019-10-02 13:09:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:20,522 INFO L93 Difference]: Finished difference Result 1097 states and 1532 transitions. [2019-10-02 13:09:20,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:09:20,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-10-02 13:09:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:20,528 INFO L225 Difference]: With dead ends: 1097 [2019-10-02 13:09:20,529 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 13:09:20,530 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:09:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 13:09:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 619. [2019-10-02 13:09:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 13:09:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 867 transitions. [2019-10-02 13:09:20,560 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 867 transitions. Word has length 223 [2019-10-02 13:09:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:20,561 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 867 transitions. [2019-10-02 13:09:20,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:09:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 867 transitions. [2019-10-02 13:09:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:09:20,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:20,566 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:20,566 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:20,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:20,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1508989344, now seen corresponding path program 1 times [2019-10-02 13:09:20,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:20,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:20,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:20,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:20,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:09:20,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:09:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:09:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:09:20,772 INFO L87 Difference]: Start difference. First operand 619 states and 867 transitions. Second operand 3 states. [2019-10-02 13:09:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:20,818 INFO L93 Difference]: Finished difference Result 1322 states and 1918 transitions. [2019-10-02 13:09:20,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:09:20,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2019-10-02 13:09:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:20,875 INFO L225 Difference]: With dead ends: 1322 [2019-10-02 13:09:20,875 INFO L226 Difference]: Without dead ends: 768 [2019-10-02 13:09:20,877 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:09:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2019-10-02 13:09:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 767. [2019-10-02 13:09:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-10-02 13:09:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1119 transitions. [2019-10-02 13:09:20,911 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1119 transitions. Word has length 224 [2019-10-02 13:09:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:20,912 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1119 transitions. [2019-10-02 13:09:20,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:09:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1119 transitions. [2019-10-02 13:09:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 13:09:20,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:20,918 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:20,919 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2014555995, now seen corresponding path program 1 times [2019-10-02 13:09:20,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:21,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:21,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:09:21,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:09:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:09:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:09:21,099 INFO L87 Difference]: Start difference. First operand 767 states and 1119 transitions. Second operand 3 states. [2019-10-02 13:09:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:21,148 INFO L93 Difference]: Finished difference Result 1754 states and 2654 transitions. [2019-10-02 13:09:21,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:09:21,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-10-02 13:09:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:21,156 INFO L225 Difference]: With dead ends: 1754 [2019-10-02 13:09:21,157 INFO L226 Difference]: Without dead ends: 1052 [2019-10-02 13:09:21,159 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:09:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-02 13:09:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1051. [2019-10-02 13:09:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-10-02 13:09:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1599 transitions. [2019-10-02 13:09:21,207 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1599 transitions. Word has length 225 [2019-10-02 13:09:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:21,208 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1599 transitions. [2019-10-02 13:09:21,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:09:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1599 transitions. [2019-10-02 13:09:21,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:09:21,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:21,215 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:21,216 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:21,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1949808246, now seen corresponding path program 1 times [2019-10-02 13:09:21,216 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:21,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:21,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:21,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:09:21,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:09:21,777 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:09:21,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:22,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:09:22,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:09:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:09:22,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:09:22,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:09:22,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:09:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:09:22,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:09:22,748 INFO L87 Difference]: Start difference. First operand 1051 states and 1599 transitions. Second operand 26 states. [2019-10-02 13:09:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:31,330 INFO L93 Difference]: Finished difference Result 3674 states and 5610 transitions. [2019-10-02 13:09:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:09:31,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 228 [2019-10-02 13:09:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:31,362 INFO L225 Difference]: With dead ends: 3674 [2019-10-02 13:09:31,362 INFO L226 Difference]: Without dead ends: 2659 [2019-10-02 13:09:31,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:09:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2019-10-02 13:09:31,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2622. [2019-10-02 13:09:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2622 states. [2019-10-02 13:09:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 3978 transitions. [2019-10-02 13:09:31,552 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 3978 transitions. Word has length 228 [2019-10-02 13:09:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:31,553 INFO L475 AbstractCegarLoop]: Abstraction has 2622 states and 3978 transitions. [2019-10-02 13:09:31,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:09:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 3978 transitions. [2019-10-02 13:09:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:09:31,571 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:31,571 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:31,571 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2070598444, now seen corresponding path program 1 times [2019-10-02 13:09:31,572 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:31,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:31,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:31,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:31,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:09:31,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:09:31,869 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:09:31,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:32,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:09:32,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:09:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 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:09:32,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:09:32,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 13:09:32,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:09:32,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:09:32,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:09:32,624 INFO L87 Difference]: Start difference. First operand 2622 states and 3978 transitions. Second operand 16 states. [2019-10-02 13:09:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:34,338 INFO L93 Difference]: Finished difference Result 5271 states and 8060 transitions. [2019-10-02 13:09:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:09:34,339 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 230 [2019-10-02 13:09:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:34,356 INFO L225 Difference]: With dead ends: 5271 [2019-10-02 13:09:34,357 INFO L226 Difference]: Without dead ends: 2684 [2019-10-02 13:09:34,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:09:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-10-02 13:09:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2019-10-02 13:09:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2019-10-02 13:09:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 4080 transitions. [2019-10-02 13:09:34,542 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 4080 transitions. Word has length 230 [2019-10-02 13:09:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:34,543 INFO L475 AbstractCegarLoop]: Abstraction has 2684 states and 4080 transitions. [2019-10-02 13:09:34,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:09:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 4080 transitions. [2019-10-02 13:09:34,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:09:34,559 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:34,560 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:34,560 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:34,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1522115230, now seen corresponding path program 1 times [2019-10-02 13:09:34,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:34,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:34,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:34,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:09:34,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:09:34,841 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:09:34,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:35,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 2944 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:09:35,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:09:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:09:35,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:09:35,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:09:35,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:09:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:09:35,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:09:35,536 INFO L87 Difference]: Start difference. First operand 2684 states and 4080 transitions. Second operand 12 states. [2019-10-02 13:09:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:39,400 INFO L93 Difference]: Finished difference Result 7738 states and 11815 transitions. [2019-10-02 13:09:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:09:39,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 231 [2019-10-02 13:09:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:39,436 INFO L225 Difference]: With dead ends: 7738 [2019-10-02 13:09:39,436 INFO L226 Difference]: Without dead ends: 5115 [2019-10-02 13:09:39,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:09:39,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2019-10-02 13:09:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 5095. [2019-10-02 13:09:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5095 states. [2019-10-02 13:09:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 7720 transitions. [2019-10-02 13:09:39,710 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 7720 transitions. Word has length 231 [2019-10-02 13:09:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:39,711 INFO L475 AbstractCegarLoop]: Abstraction has 5095 states and 7720 transitions. [2019-10-02 13:09:39,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:09:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 7720 transitions. [2019-10-02 13:09:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:09:39,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:39,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:09:39,732 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:39,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1492575817, now seen corresponding path program 1 times [2019-10-02 13:09:39,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:39,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:39,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:09:40,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:09:40,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:09:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:09:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:09:40,021 INFO L87 Difference]: Start difference. First operand 5095 states and 7720 transitions. Second operand 7 states. [2019-10-02 13:09:41,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:41,873 INFO L93 Difference]: Finished difference Result 13353 states and 19706 transitions. [2019-10-02 13:09:41,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:09:41,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-10-02 13:09:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:41,971 INFO L225 Difference]: With dead ends: 13353 [2019-10-02 13:09:41,971 INFO L226 Difference]: Without dead ends: 10657 [2019-10-02 13:09:41,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:09:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10657 states. [2019-10-02 13:09:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10657 to 10617. [2019-10-02 13:09:42,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10617 states. [2019-10-02 13:09:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10617 states to 10617 states and 15521 transitions. [2019-10-02 13:09:42,539 INFO L78 Accepts]: Start accepts. Automaton has 10617 states and 15521 transitions. Word has length 232 [2019-10-02 13:09:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:42,539 INFO L475 AbstractCegarLoop]: Abstraction has 10617 states and 15521 transitions. [2019-10-02 13:09:42,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:09:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10617 states and 15521 transitions. [2019-10-02 13:09:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:09:42,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:42,563 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:09:42,563 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:42,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1561726785, now seen corresponding path program 1 times [2019-10-02 13:09:42,564 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:42,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:42,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:42,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:42,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:09:43,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:43,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:09:43,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:09:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:09:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:09:43,067 INFO L87 Difference]: Start difference. First operand 10617 states and 15521 transitions. Second operand 24 states. [2019-10-02 13:09:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:44,064 INFO L93 Difference]: Finished difference Result 19669 states and 29056 transitions. [2019-10-02 13:09:44,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:09:44,065 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 233 [2019-10-02 13:09:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:44,149 INFO L225 Difference]: With dead ends: 19669 [2019-10-02 13:09:44,150 INFO L226 Difference]: Without dead ends: 10791 [2019-10-02 13:09:44,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:09:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10791 states. [2019-10-02 13:09:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10791 to 10556. [2019-10-02 13:09:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10556 states. [2019-10-02 13:09:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 15554 transitions. [2019-10-02 13:09:44,737 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 15554 transitions. Word has length 233 [2019-10-02 13:09:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:44,738 INFO L475 AbstractCegarLoop]: Abstraction has 10556 states and 15554 transitions. [2019-10-02 13:09:44,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:09:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 15554 transitions. [2019-10-02 13:09:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:09:44,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:44,759 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:09:44,760 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:44,760 INFO L82 PathProgramCache]: Analyzing trace with hash -792265025, now seen corresponding path program 1 times [2019-10-02 13:09:44,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:44,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:44,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:44,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:44,970 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:09:44,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:44,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:09:44,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:09:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:09:44,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:09:44,972 INFO L87 Difference]: Start difference. First operand 10556 states and 15554 transitions. Second operand 10 states. [2019-10-02 13:09:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:45,837 INFO L93 Difference]: Finished difference Result 16901 states and 24449 transitions. [2019-10-02 13:09:45,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:09:45,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-10-02 13:09:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:45,881 INFO L225 Difference]: With dead ends: 16901 [2019-10-02 13:09:45,882 INFO L226 Difference]: Without dead ends: 11156 [2019-10-02 13:09:45,904 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:09:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11156 states. [2019-10-02 13:09:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11156 to 10676. [2019-10-02 13:09:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10676 states. [2019-10-02 13:09:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10676 states to 10676 states and 15664 transitions. [2019-10-02 13:09:46,401 INFO L78 Accepts]: Start accepts. Automaton has 10676 states and 15664 transitions. Word has length 237 [2019-10-02 13:09:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:46,402 INFO L475 AbstractCegarLoop]: Abstraction has 10676 states and 15664 transitions. [2019-10-02 13:09:46,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:09:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 10676 states and 15664 transitions. [2019-10-02 13:09:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 13:09:46,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:46,426 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:46,426 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1124850689, now seen corresponding path program 1 times [2019-10-02 13:09:46,427 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:46,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:46,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:09:46,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:09:46,579 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:09:46,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:47,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 2987 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:09:47,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:09:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 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:09:47,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:09:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:09:47,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:09:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:09:47,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:09:47,379 INFO L87 Difference]: Start difference. First operand 10676 states and 15664 transitions. Second operand 12 states. [2019-10-02 13:09:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:49,254 INFO L93 Difference]: Finished difference Result 21491 states and 31741 transitions. [2019-10-02 13:09:49,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:09:49,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2019-10-02 13:09:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:49,300 INFO L225 Difference]: With dead ends: 21491 [2019-10-02 13:09:49,300 INFO L226 Difference]: Without dead ends: 10890 [2019-10-02 13:09:49,330 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:09:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10890 states. [2019-10-02 13:09:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10890 to 10776. [2019-10-02 13:09:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10776 states. [2019-10-02 13:09:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10776 states to 10776 states and 15845 transitions. [2019-10-02 13:09:49,840 INFO L78 Accepts]: Start accepts. Automaton has 10776 states and 15845 transitions. Word has length 242 [2019-10-02 13:09:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:49,841 INFO L475 AbstractCegarLoop]: Abstraction has 10776 states and 15845 transitions. [2019-10-02 13:09:49,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:09:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 10776 states and 15845 transitions. [2019-10-02 13:09:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 13:09:49,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:49,863 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:09:49,863 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1992001787, now seen corresponding path program 1 times [2019-10-02 13:09:49,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:49,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:49,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:09:50,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:09:50,066 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:09:50,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:50,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 2989 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:09:50,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:09:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:09:50,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:09:50,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:09:50,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:09:50,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:09:50,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:09:50,840 INFO L87 Difference]: Start difference. First operand 10776 states and 15845 transitions. Second operand 11 states. [2019-10-02 13:09:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:52,958 INFO L93 Difference]: Finished difference Result 32194 states and 47803 transitions. [2019-10-02 13:09:52,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:09:52,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 243 [2019-10-02 13:09:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:53,049 INFO L225 Difference]: With dead ends: 32194 [2019-10-02 13:09:53,050 INFO L226 Difference]: Without dead ends: 21498 [2019-10-02 13:09:53,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:09:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21498 states. [2019-10-02 13:09:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21498 to 21248. [2019-10-02 13:09:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21248 states. [2019-10-02 13:09:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21248 states to 21248 states and 31517 transitions. [2019-10-02 13:09:54,225 INFO L78 Accepts]: Start accepts. Automaton has 21248 states and 31517 transitions. Word has length 243 [2019-10-02 13:09:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:09:54,225 INFO L475 AbstractCegarLoop]: Abstraction has 21248 states and 31517 transitions. [2019-10-02 13:09:54,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:09:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 21248 states and 31517 transitions. [2019-10-02 13:09:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 13:09:54,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:09:54,269 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 13:09:54,270 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:09:54,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:09:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash -963002479, now seen corresponding path program 1 times [2019-10-02 13:09:54,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:09:54,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:09:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:09:54,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:09:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:09:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:09:54,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:09:54,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:09:54,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:09:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:09:54,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:09:54,463 INFO L87 Difference]: Start difference. First operand 21248 states and 31517 transitions. Second operand 7 states. [2019-10-02 13:09:57,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:09:57,479 INFO L93 Difference]: Finished difference Result 52750 states and 75293 transitions. [2019-10-02 13:09:57,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:09:57,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 246 [2019-10-02 13:09:57,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:09:57,619 INFO L225 Difference]: With dead ends: 52750 [2019-10-02 13:09:57,619 INFO L226 Difference]: Without dead ends: 37389 [2019-10-02 13:09:57,663 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:09:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37389 states. [2019-10-02 13:10:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37389 to 37076. [2019-10-02 13:10:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37076 states. [2019-10-02 13:10:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37076 states to 37076 states and 53545 transitions. [2019-10-02 13:10:01,625 INFO L78 Accepts]: Start accepts. Automaton has 37076 states and 53545 transitions. Word has length 246 [2019-10-02 13:10:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:10:01,626 INFO L475 AbstractCegarLoop]: Abstraction has 37076 states and 53545 transitions. [2019-10-02 13:10:01,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:10:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 37076 states and 53545 transitions. [2019-10-02 13:10:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 13:10:01,656 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:10:01,658 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:10:01,658 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:10:01,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:10:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash -263921364, now seen corresponding path program 1 times [2019-10-02 13:10:01,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:10:01,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:10:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:10:02,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:10:02,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-02 13:10:02,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-02 13:10:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-02 13:10:02,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-02 13:10:02,205 INFO L87 Difference]: Start difference. First operand 37076 states and 53545 transitions. Second operand 28 states. [2019-10-02 13:10:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:10:03,790 INFO L93 Difference]: Finished difference Result 70418 states and 99814 transitions. [2019-10-02 13:10:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-02 13:10:03,790 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 247 [2019-10-02 13:10:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:10:03,967 INFO L225 Difference]: With dead ends: 70418 [2019-10-02 13:10:03,967 INFO L226 Difference]: Without dead ends: 38085 [2019-10-02 13:10:04,048 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:10:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38085 states. [2019-10-02 13:10:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38085 to 37884. [2019-10-02 13:10:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37884 states. [2019-10-02 13:10:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37884 states to 37884 states and 54365 transitions. [2019-10-02 13:10:05,897 INFO L78 Accepts]: Start accepts. Automaton has 37884 states and 54365 transitions. Word has length 247 [2019-10-02 13:10:05,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:10:05,898 INFO L475 AbstractCegarLoop]: Abstraction has 37884 states and 54365 transitions. [2019-10-02 13:10:05,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-02 13:10:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 37884 states and 54365 transitions. [2019-10-02 13:10:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 13:10:05,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:10:05,935 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:10:05,935 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:10:05,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:10:05,936 INFO L82 PathProgramCache]: Analyzing trace with hash -882725108, now seen corresponding path program 1 times [2019-10-02 13:10:05,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:10:05,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:10:05,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:05,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:05,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:05,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:10:06,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:10:06,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:10:06,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:10:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:10:06,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:10:06,146 INFO L87 Difference]: Start difference. First operand 37884 states and 54365 transitions. Second operand 8 states. [2019-10-02 13:10:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:10:13,523 INFO L93 Difference]: Finished difference Result 140821 states and 200995 transitions. [2019-10-02 13:10:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:10:13,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 278 [2019-10-02 13:10:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:10:13,932 INFO L225 Difference]: With dead ends: 140821 [2019-10-02 13:10:13,932 INFO L226 Difference]: Without dead ends: 108864 [2019-10-02 13:10:14,054 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:10:14,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108864 states. [2019-10-02 13:10:20,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108864 to 108670. [2019-10-02 13:10:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108670 states. [2019-10-02 13:10:20,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108670 states to 108670 states and 155199 transitions. [2019-10-02 13:10:20,893 INFO L78 Accepts]: Start accepts. Automaton has 108670 states and 155199 transitions. Word has length 278 [2019-10-02 13:10:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:10:20,894 INFO L475 AbstractCegarLoop]: Abstraction has 108670 states and 155199 transitions. [2019-10-02 13:10:20,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:10:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 108670 states and 155199 transitions. [2019-10-02 13:10:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 13:10:20,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:10:20,963 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:10:20,963 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:10:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:10:20,964 INFO L82 PathProgramCache]: Analyzing trace with hash 215213496, now seen corresponding path program 1 times [2019-10-02 13:10:20,964 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:10:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:10:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:10:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:10:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:10:21,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:10:21,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:10:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:10:21,330 INFO L87 Difference]: Start difference. First operand 108670 states and 155199 transitions. Second operand 22 states. [2019-10-02 13:10:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:10:26,586 INFO L93 Difference]: Finished difference Result 165761 states and 233267 transitions. [2019-10-02 13:10:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 13:10:26,586 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 279 [2019-10-02 13:10:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:10:26,864 INFO L225 Difference]: With dead ends: 165761 [2019-10-02 13:10:26,864 INFO L226 Difference]: Without dead ends: 90228 [2019-10-02 13:10:26,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=0, NotChecked=0, Total=930 [2019-10-02 13:10:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90228 states. [2019-10-02 13:10:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90228 to 87213. [2019-10-02 13:10:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87213 states. [2019-10-02 13:10:30,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87213 states to 87213 states and 124507 transitions. [2019-10-02 13:10:30,061 INFO L78 Accepts]: Start accepts. Automaton has 87213 states and 124507 transitions. Word has length 279 [2019-10-02 13:10:30,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:10:30,062 INFO L475 AbstractCegarLoop]: Abstraction has 87213 states and 124507 transitions. [2019-10-02 13:10:30,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:10:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 87213 states and 124507 transitions. [2019-10-02 13:10:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 13:10:30,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:10:30,119 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:30,119 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:10:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:10:30,119 INFO L82 PathProgramCache]: Analyzing trace with hash -622556700, now seen corresponding path program 1 times [2019-10-02 13:10:30,120 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:10:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:10:30,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:30,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:30,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 13:10:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:10:30,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:10:30,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:10:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:10:30,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:10:30,324 INFO L87 Difference]: Start difference. First operand 87213 states and 124507 transitions. Second operand 8 states. [2019-10-02 13:10:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:10:38,551 INFO L93 Difference]: Finished difference Result 251434 states and 356256 transitions. [2019-10-02 13:10:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:10:38,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 288 [2019-10-02 13:10:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:10:39,051 INFO L225 Difference]: With dead ends: 251434 [2019-10-02 13:10:39,051 INFO L226 Difference]: Without dead ends: 174593 [2019-10-02 13:10:39,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:10:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174593 states. [2019-10-02 13:10:44,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174593 to 172876. [2019-10-02 13:10:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172876 states. [2019-10-02 13:10:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172876 states to 172876 states and 245838 transitions. [2019-10-02 13:10:45,123 INFO L78 Accepts]: Start accepts. Automaton has 172876 states and 245838 transitions. Word has length 288 [2019-10-02 13:10:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:10:45,123 INFO L475 AbstractCegarLoop]: Abstraction has 172876 states and 245838 transitions. [2019-10-02 13:10:45,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:10:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 172876 states and 245838 transitions. [2019-10-02 13:10:45,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 13:10:45,251 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:10:45,251 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:45,251 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:10:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:10:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1474919675, now seen corresponding path program 1 times [2019-10-02 13:10:45,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:10:45,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:10:45,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:45,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:45,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:10:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 13:10:45,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:10:45,527 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:10:45,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:10:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:10:46,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 3141 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:10:46,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:10:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:10:46,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:10:46,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:10:46,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:10:46,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:10:46,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:10:46,264 INFO L87 Difference]: Start difference. First operand 172876 states and 245838 transitions. Second operand 20 states. [2019-10-02 13:11:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:11:03,175 INFO L93 Difference]: Finished difference Result 360659 states and 523316 transitions. [2019-10-02 13:11:03,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:11:03,176 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 288 [2019-10-02 13:11:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:11:03,804 INFO L225 Difference]: With dead ends: 360659 [2019-10-02 13:11:03,804 INFO L226 Difference]: Without dead ends: 187863 [2019-10-02 13:11:04,084 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:11:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187863 states. [2019-10-02 13:11:11,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187863 to 179344. [2019-10-02 13:11:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179344 states. [2019-10-02 13:11:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179344 states to 179344 states and 257115 transitions. [2019-10-02 13:11:19,166 INFO L78 Accepts]: Start accepts. Automaton has 179344 states and 257115 transitions. Word has length 288 [2019-10-02 13:11:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:11:19,167 INFO L475 AbstractCegarLoop]: Abstraction has 179344 states and 257115 transitions. [2019-10-02 13:11:19,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:11:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 179344 states and 257115 transitions. [2019-10-02 13:11:19,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 13:11:19,280 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:11:19,280 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:19,281 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:11:19,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:11:19,281 INFO L82 PathProgramCache]: Analyzing trace with hash 969560581, now seen corresponding path program 1 times [2019-10-02 13:11:19,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:11:19,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:11:19,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:11:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:11:19,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:11:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:11:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 13:11:19,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:11:19,503 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:11:19,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:11:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:11:20,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 3139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:11:20,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:11:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:11:20,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:11:20,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2019-10-02 13:11:20,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:11:20,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:11:20,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:11:20,118 INFO L87 Difference]: Start difference. First operand 179344 states and 257115 transitions. Second operand 13 states. [2019-10-02 13:11:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:11:31,324 INFO L93 Difference]: Finished difference Result 385692 states and 581443 transitions. [2019-10-02 13:11:31,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:11:31,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 290 [2019-10-02 13:11:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:11:32,645 INFO L225 Difference]: With dead ends: 385692 [2019-10-02 13:11:32,645 INFO L226 Difference]: Without dead ends: 210759 [2019-10-02 13:11:32,922 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:11:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210759 states. [2019-10-02 13:11:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210759 to 208292. [2019-10-02 13:11:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208292 states. [2019-10-02 13:11:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208292 states to 208292 states and 315552 transitions. [2019-10-02 13:11:49,423 INFO L78 Accepts]: Start accepts. Automaton has 208292 states and 315552 transitions. Word has length 290 [2019-10-02 13:11:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:11:49,424 INFO L475 AbstractCegarLoop]: Abstraction has 208292 states and 315552 transitions. [2019-10-02 13:11:49,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:11:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 208292 states and 315552 transitions. [2019-10-02 13:11:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-02 13:11:49,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:11:49,589 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:49,589 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:11:49,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:11:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1833530444, now seen corresponding path program 1 times [2019-10-02 13:11:49,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:11:49,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:11:49,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:11:49,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:11:49,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:11:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:11:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:11:49,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:11:49,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:11:49,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:11:49,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:11:49,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:11:49,749 INFO L87 Difference]: Start difference. First operand 208292 states and 315552 transitions. Second operand 3 states. [2019-10-02 13:12:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:01,344 INFO L93 Difference]: Finished difference Result 419713 states and 637075 transitions. [2019-10-02 13:12:01,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:01,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 296 [2019-10-02 13:12:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:02,649 INFO L225 Difference]: With dead ends: 419713 [2019-10-02 13:12:02,649 INFO L226 Difference]: Without dead ends: 211574 [2019-10-02 13:12:03,017 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:12:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211574 states. [2019-10-02 13:12:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211574 to 211568. [2019-10-02 13:12:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211568 states. [2019-10-02 13:12:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211568 states to 211568 states and 321611 transitions. [2019-10-02 13:12:13,638 INFO L78 Accepts]: Start accepts. Automaton has 211568 states and 321611 transitions. Word has length 296 [2019-10-02 13:12:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:13,639 INFO L475 AbstractCegarLoop]: Abstraction has 211568 states and 321611 transitions. [2019-10-02 13:12:13,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 211568 states and 321611 transitions. [2019-10-02 13:12:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 13:12:13,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:13,826 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:13,826 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:13,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1913442231, now seen corresponding path program 1 times [2019-10-02 13:12:13,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:13,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:13,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:13,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:12:19,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:19,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:19,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:19,750 INFO L87 Difference]: Start difference. First operand 211568 states and 321611 transitions. Second operand 3 states. [2019-10-02 13:12:27,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:12:27,354 INFO L93 Difference]: Finished difference Result 429601 states and 655504 transitions. [2019-10-02 13:12:28,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:12:28,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-10-02 13:12:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:12:28,912 INFO L225 Difference]: With dead ends: 429601 [2019-10-02 13:12:28,912 INFO L226 Difference]: Without dead ends: 218200 [2019-10-02 13:12:29,334 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218200 states. [2019-10-02 13:12:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218200 to 218194. [2019-10-02 13:12:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218194 states. [2019-10-02 13:12:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218194 states to 218194 states and 333900 transitions. [2019-10-02 13:12:44,658 INFO L78 Accepts]: Start accepts. Automaton has 218194 states and 333900 transitions. Word has length 297 [2019-10-02 13:12:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:12:44,659 INFO L475 AbstractCegarLoop]: Abstraction has 218194 states and 333900 transitions. [2019-10-02 13:12:44,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:12:44,659 INFO L276 IsEmpty]: Start isEmpty. Operand 218194 states and 333900 transitions. [2019-10-02 13:12:44,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:12:44,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:12:44,847 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:44,847 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:12:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:12:44,848 INFO L82 PathProgramCache]: Analyzing trace with hash -560076212, now seen corresponding path program 1 times [2019-10-02 13:12:44,848 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:12:44,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:12:44,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:44,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:12:44,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:12:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:12:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:12:45,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:12:45,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:12:45,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:12:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:12:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:12:45,009 INFO L87 Difference]: Start difference. First operand 218194 states and 333900 transitions. Second operand 3 states. [2019-10-02 13:13:01,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:01,325 INFO L93 Difference]: Finished difference Result 448511 states and 690826 transitions. [2019-10-02 13:13:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:01,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-02 13:13:01,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:02,159 INFO L225 Difference]: With dead ends: 448511 [2019-10-02 13:13:02,159 INFO L226 Difference]: Without dead ends: 230490 [2019-10-02 13:13:02,590 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:13:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230490 states. [2019-10-02 13:13:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230490 to 230484. [2019-10-02 13:13:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230484 states. [2019-10-02 13:13:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230484 states to 230484 states and 356749 transitions. [2019-10-02 13:13:13,883 INFO L78 Accepts]: Start accepts. Automaton has 230484 states and 356749 transitions. Word has length 298 [2019-10-02 13:13:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:13,884 INFO L475 AbstractCegarLoop]: Abstraction has 230484 states and 356749 transitions. [2019-10-02 13:13:13,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 230484 states and 356749 transitions. [2019-10-02 13:13:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 13:13:14,248 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:14,248 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:14,248 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 563498251, now seen corresponding path program 1 times [2019-10-02 13:13:14,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:14,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:14,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:14,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:13:15,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:15,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:15,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:15,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:15,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:15,432 INFO L87 Difference]: Start difference. First operand 230484 states and 356749 transitions. Second operand 3 states. [2019-10-02 13:13:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:29,315 INFO L93 Difference]: Finished difference Result 485759 states and 759751 transitions. [2019-10-02 13:13:29,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:29,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-10-02 13:13:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:30,201 INFO L225 Difference]: With dead ends: 485759 [2019-10-02 13:13:30,201 INFO L226 Difference]: Without dead ends: 255452 [2019-10-02 13:13:30,645 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:13:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255452 states. [2019-10-02 13:13:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255452 to 255446. [2019-10-02 13:13:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255446 states. [2019-10-02 13:13:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255446 states to 255446 states and 402446 transitions. [2019-10-02 13:13:49,613 INFO L78 Accepts]: Start accepts. Automaton has 255446 states and 402446 transitions. Word has length 299 [2019-10-02 13:13:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:49,613 INFO L475 AbstractCegarLoop]: Abstraction has 255446 states and 402446 transitions. [2019-10-02 13:13:49,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 255446 states and 402446 transitions. [2019-10-02 13:13:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:13:50,156 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:50,156 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,156 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1733382284, now seen corresponding path program 1 times [2019-10-02 13:13:50,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:50,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:50,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:50,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:13:50,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:50,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:50,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:50,321 INFO L87 Difference]: Start difference. First operand 255446 states and 402446 transitions. Second operand 3 states. [2019-10-02 13:14:09,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:09,232 INFO L93 Difference]: Finished difference Result 556802 states and 887617 transitions. [2019-10-02 13:14:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:14:09,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-10-02 13:14:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:10,279 INFO L225 Difference]: With dead ends: 556802 [2019-10-02 13:14:10,279 INFO L226 Difference]: Without dead ends: 301544 [2019-10-02 13:14:11,268 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:14:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301544 states. [2019-10-02 13:14:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301544 to 301538. [2019-10-02 13:14:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301538 states. [2019-10-02 13:14:34,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301538 states to 301538 states and 483865 transitions. [2019-10-02 13:14:34,511 INFO L78 Accepts]: Start accepts. Automaton has 301538 states and 483865 transitions. Word has length 300 [2019-10-02 13:14:34,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:34,512 INFO L475 AbstractCegarLoop]: Abstraction has 301538 states and 483865 transitions. [2019-10-02 13:14:34,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:14:34,512 INFO L276 IsEmpty]: Start isEmpty. Operand 301538 states and 483865 transitions. [2019-10-02 13:14:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 13:14:35,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:35,018 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:35,019 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 670190093, now seen corresponding path program 1 times [2019-10-02 13:14:35,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:35,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:35,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:14:36,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:36,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:14:36,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:14:36,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:14:36,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:14:36,258 INFO L87 Difference]: Start difference. First operand 301538 states and 483865 transitions. Second operand 3 states. [2019-10-02 13:14:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:59,183 INFO L93 Difference]: Finished difference Result 690432 states and 1127227 transitions. [2019-10-02 13:14:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:14:59,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-10-02 13:14:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:00,454 INFO L225 Difference]: With dead ends: 690432 [2019-10-02 13:15:00,454 INFO L226 Difference]: Without dead ends: 389098 [2019-10-02 13:15:00,996 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389098 states. [2019-10-02 13:15:33,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389098 to 389092. [2019-10-02 13:15:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389092 states. [2019-10-02 13:15:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389092 states to 389092 states and 640538 transitions. [2019-10-02 13:15:44,107 INFO L78 Accepts]: Start accepts. Automaton has 389092 states and 640538 transitions. Word has length 301 [2019-10-02 13:15:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:44,108 INFO L475 AbstractCegarLoop]: Abstraction has 389092 states and 640538 transitions. [2019-10-02 13:15:44,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:15:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 389092 states and 640538 transitions. [2019-10-02 13:15:45,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 13:15:45,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:45,008 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:45,008 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:45,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:45,008 INFO L82 PathProgramCache]: Analyzing trace with hash -28858612, now seen corresponding path program 1 times [2019-10-02 13:15:45,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:45,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:45,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:45,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:45,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:45,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 13:15:45,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:45,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:15:45,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:15:45,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:15:45,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:15:45,158 INFO L87 Difference]: Start difference. First operand 389092 states and 640538 transitions. Second operand 3 states. [2019-10-02 13:16:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:15,361 INFO L93 Difference]: Finished difference Result 758737 states and 1236640 transitions. [2019-10-02 13:16:15,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:16:15,362 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-10-02 13:16:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:18,384 INFO L225 Difference]: With dead ends: 758737 [2019-10-02 13:16:18,385 INFO L226 Difference]: Without dead ends: 554962 [2019-10-02 13:16:18,900 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:16:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554962 states. [2019-10-02 13:17:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554962 to 554956. [2019-10-02 13:17:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554956 states. [2019-10-02 13:17:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554956 states to 554956 states and 923131 transitions. [2019-10-02 13:17:14,505 INFO L78 Accepts]: Start accepts. Automaton has 554956 states and 923131 transitions. Word has length 302 [2019-10-02 13:17:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:17:14,505 INFO L475 AbstractCegarLoop]: Abstraction has 554956 states and 923131 transitions. [2019-10-02 13:17:14,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:17:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 554956 states and 923131 transitions. [2019-10-02 13:17:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 13:17:16,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:17:16,138 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:16,138 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:17:16,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:17:16,138 INFO L82 PathProgramCache]: Analyzing trace with hash -15173747, now seen corresponding path program 1 times [2019-10-02 13:17:16,139 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:17:16,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:17:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:16,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:17:17,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:17:17,575 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:17:17,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:18,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:17:18,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:17:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 13:17:18,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:17:18,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-10-02 13:17:18,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-02 13:17:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-02 13:17:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1801, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 13:17:18,699 INFO L87 Difference]: Start difference. First operand 554956 states and 923131 transitions. Second operand 44 states.