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_spec1_product12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:51:37,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:51:37,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:51:37,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:51:37,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:51:37,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:51:37,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:51:37,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:51:37,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:51:37,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:51:37,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:51:37,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:51:37,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:51:37,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:51:37,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:51:37,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:51:37,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:51:37,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:51:37,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:51:37,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:51:37,098 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:51:37,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:51:37,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:51:37,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:51:37,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:51:37,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:51:37,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:51:37,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:51:37,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:51:37,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:51:37,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:51:37,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:51:37,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:51:37,108 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:51:37,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:51:37,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:51:37,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:51:37,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:51:37,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:51:37,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:51:37,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:51:37,113 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 12:51:37,129 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:51:37,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:51:37,131 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:51:37,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:51:37,132 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:51:37,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:51:37,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:51:37,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:51:37,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:51:37,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:51:37,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:51:37,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:51:37,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:51:37,134 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:51:37,134 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:51:37,135 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:51:37,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:51:37,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:51:37,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:51:37,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:51:37,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:51:37,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:51:37,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:51:37,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:51:37,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:51:37,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:51:37,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:51:37,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:51:37,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:51:37,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:51:37,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:51:37,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:51:37,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:51:37,196 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:51:37,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product12.cil.c [2019-10-02 12:51:37,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9f6c12a/94471c93934a4b529e0c284aa6a9325a/FLAGb0acd583f [2019-10-02 12:51:37,930 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:51:37,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product12.cil.c [2019-10-02 12:51:37,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9f6c12a/94471c93934a4b529e0c284aa6a9325a/FLAGb0acd583f [2019-10-02 12:51:38,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf9f6c12a/94471c93934a4b529e0c284aa6a9325a [2019-10-02 12:51:38,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:51:38,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:51:38,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:51:38,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:51:38,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:51:38,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:51:38" (1/1) ... [2019-10-02 12:51:38,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a380d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:38, skipping insertion in model container [2019-10-02 12:51:38,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:51:38" (1/1) ... [2019-10-02 12:51:38,133 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:51:38,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:51:39,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:51:39,152 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:51:39,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:51:39,417 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:51:39,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39 WrapperNode [2019-10-02 12:51:39,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:51:39,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:51:39,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:51:39,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:51:39,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (1/1) ... [2019-10-02 12:51:39,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:51:39,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:51:39,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:51:39,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:51:39,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (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 12:51:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:51:39,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:51:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:51:39,708 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:51:39,709 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:51:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:51:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:51:39,710 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:51:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:51:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:51:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:51:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:51:39,712 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:51:39,713 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:51:39,714 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:51:39,715 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:51:39,718 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:51:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:51:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:51:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:51:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:51:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:51:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:51:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:51:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:51:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:51:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:51:39,721 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:51:39,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:51:39,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:51:39,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:51:39,722 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:51:39,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:51:39,723 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:51:39,723 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:51:39,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:51:39,723 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:51:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:51:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:51:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:51:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:51:39,724 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:51:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:51:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:51:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:51:39,725 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:51:39,726 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:51:39,726 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:51:39,726 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:51:39,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:51:39,727 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:51:39,727 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:51:39,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:51:39,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:51:39,728 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:51:39,728 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:51:39,728 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:51:39,728 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:51:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:51:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:51:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:51:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:51:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:51:39,729 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:51:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:51:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:51:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:51:39,730 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:51:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:51:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:51:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:51:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:51:39,732 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:51:39,732 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:51:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:51:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:51:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:51:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:51:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:51:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:51:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:51:39,737 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:51:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:51:39,738 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:51:39,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:51:39,739 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:51:39,739 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:51:39,740 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:51:39,740 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:51:39,741 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:51:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:51:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:51:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:51:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:51:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:51:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:51:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:51:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:51:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:51:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:51:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:51:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:51:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:51:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:51:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:51:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:51:39,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:51:39,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:51:39,746 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:51:39,746 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:51:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:51:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:51:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:51:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:51:39,748 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:51:39,748 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:51:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:51:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:51:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:51:39,749 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:51:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:51:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:51:39,750 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:51:39,751 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:51:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:51:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:51:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:51:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:51:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:51:39,752 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:51:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:51:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:51:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:51:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:51:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:51:39,759 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:51:39,760 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:51:39,760 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:51:39,760 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:51:39,761 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:51:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:51:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:51:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:51:39,768 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:51:39,775 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:51:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:51:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:51:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:51:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:51:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:51:39,776 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:51:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:51:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:51:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:51:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:51:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:51:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:51:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:51:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:51:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:51:39,778 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:51:39,781 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:51:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:51:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:51:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:51:39,782 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:51:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:51:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:51:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:51:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:51:39,783 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:51:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:51:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:51:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:51:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:51:39,784 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:51:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:51:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:51:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:51:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:51:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:51:39,785 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:51:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:51:39,786 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:51:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:51:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:51:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:51:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:51:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:51:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:51:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:51:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:51:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:51:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:51:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:51:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:51:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:51:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:51:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:51:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:51:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:51:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:51:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:51:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:51:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:51:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:51:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:51:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:51:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:51:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:51:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:51:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:51:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:51:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:51:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:51:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:51:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:51:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:51:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:51:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:51:39,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:51:42,300 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:51:42,301 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:51:42,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:51:42 BoogieIcfgContainer [2019-10-02 12:51:42,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:51:42,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:51:42,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:51:42,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:51:42,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:51:38" (1/3) ... [2019-10-02 12:51:42,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e224f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:51:42, skipping insertion in model container [2019-10-02 12:51:42,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:51:39" (2/3) ... [2019-10-02 12:51:42,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e224f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:51:42, skipping insertion in model container [2019-10-02 12:51:42,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:51:42" (3/3) ... [2019-10-02 12:51:42,311 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product12.cil.c [2019-10-02 12:51:42,322 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:51:42,332 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:51:42,352 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:51:42,392 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:51:42,393 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:51:42,393 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:51:42,394 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:51:42,394 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:51:42,394 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:51:42,394 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:51:42,394 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:51:42,394 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:51:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-10-02 12:51:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:51:42,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:42,449 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:42,452 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1292534618, now seen corresponding path program 1 times [2019-10-02 12:51:42,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:42,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:42,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:42,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:42,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:51:43,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:43,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:51:43,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:51:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:51:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:51:43,145 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 2 states. [2019-10-02 12:51:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:43,211 INFO L93 Difference]: Finished difference Result 557 states and 745 transitions. [2019-10-02 12:51:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:51:43,213 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-10-02 12:51:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:43,235 INFO L225 Difference]: With dead ends: 557 [2019-10-02 12:51:43,236 INFO L226 Difference]: Without dead ends: 379 [2019-10-02 12:51:43,246 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 12:51:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-02 12:51:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-10-02 12:51:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-02 12:51:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 510 transitions. [2019-10-02 12:51:43,355 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 510 transitions. Word has length 145 [2019-10-02 12:51:43,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:43,357 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 510 transitions. [2019-10-02 12:51:43,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:51:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 510 transitions. [2019-10-02 12:51:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:51:43,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:43,368 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:43,368 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1702693606, now seen corresponding path program 1 times [2019-10-02 12:51:43,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:43,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:43,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:43,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:43,740 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:51:43,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:43,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:51:43,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:51:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:51:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:51:43,743 INFO L87 Difference]: Start difference. First operand 379 states and 510 transitions. Second operand 3 states. [2019-10-02 12:51:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:43,794 INFO L93 Difference]: Finished difference Result 540 states and 714 transitions. [2019-10-02 12:51:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:51:43,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-10-02 12:51:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:43,804 INFO L225 Difference]: With dead ends: 540 [2019-10-02 12:51:43,806 INFO L226 Difference]: Without dead ends: 382 [2019-10-02 12:51:43,809 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 12:51:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-02 12:51:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2019-10-02 12:51:43,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-10-02 12:51:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 512 transitions. [2019-10-02 12:51:43,861 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 512 transitions. Word has length 146 [2019-10-02 12:51:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:43,865 INFO L475 AbstractCegarLoop]: Abstraction has 381 states and 512 transitions. [2019-10-02 12:51:43,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:51:43,866 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 512 transitions. [2019-10-02 12:51:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:51:43,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:43,869 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:43,869 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:43,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1477290126, now seen corresponding path program 1 times [2019-10-02 12:51:43,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:43,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:43,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:43,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:43,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:51:44,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:44,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:51:44,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:51:44,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:51:44,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:51:44,079 INFO L87 Difference]: Start difference. First operand 381 states and 512 transitions. Second operand 3 states. [2019-10-02 12:51:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:44,139 INFO L93 Difference]: Finished difference Result 736 states and 1019 transitions. [2019-10-02 12:51:44,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:51:44,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-02 12:51:44,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:44,149 INFO L225 Difference]: With dead ends: 736 [2019-10-02 12:51:44,149 INFO L226 Difference]: Without dead ends: 420 [2019-10-02 12:51:44,152 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 12:51:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-10-02 12:51:44,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 419. [2019-10-02 12:51:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-10-02 12:51:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 578 transitions. [2019-10-02 12:51:44,198 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 578 transitions. Word has length 152 [2019-10-02 12:51:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:44,201 INFO L475 AbstractCegarLoop]: Abstraction has 419 states and 578 transitions. [2019-10-02 12:51:44,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:51:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 578 transitions. [2019-10-02 12:51:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:51:44,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:44,208 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:44,208 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:44,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:44,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1886930768, now seen corresponding path program 1 times [2019-10-02 12:51:44,209 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:44,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:44,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:44,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:44,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:51:45,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:45,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 12:51:45,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 12:51:45,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 12:51:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=801, Unknown=0, NotChecked=0, Total=870 [2019-10-02 12:51:45,267 INFO L87 Difference]: Start difference. First operand 419 states and 578 transitions. Second operand 30 states. [2019-10-02 12:51:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:49,158 INFO L93 Difference]: Finished difference Result 1195 states and 1682 transitions. [2019-10-02 12:51:49,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 12:51:49,158 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 153 [2019-10-02 12:51:49,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:49,168 INFO L225 Difference]: With dead ends: 1195 [2019-10-02 12:51:49,169 INFO L226 Difference]: Without dead ends: 812 [2019-10-02 12:51:49,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=254, Invalid=3052, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 12:51:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-10-02 12:51:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 629. [2019-10-02 12:51:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:51:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 914 transitions. [2019-10-02 12:51:49,247 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 914 transitions. Word has length 153 [2019-10-02 12:51:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:49,247 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 914 transitions. [2019-10-02 12:51:49,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 12:51:49,248 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 914 transitions. [2019-10-02 12:51:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 12:51:49,255 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:49,255 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:51:49,258 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1456150513, now seen corresponding path program 1 times [2019-10-02 12:51:49,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:49,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:51:50,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:51:50,090 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 12:51:50,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:50,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 2223 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:51:50,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:51:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:51:50,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:51:50,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [30] total 34 [2019-10-02 12:51:50,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-02 12:51:50,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-02 12:51:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 12:51:50,848 INFO L87 Difference]: Start difference. First operand 629 states and 914 transitions. Second operand 34 states. [2019-10-02 12:51:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:55,232 INFO L93 Difference]: Finished difference Result 1396 states and 2012 transitions. [2019-10-02 12:51:55,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 12:51:55,232 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 154 [2019-10-02 12:51:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:55,239 INFO L225 Difference]: With dead ends: 1396 [2019-10-02 12:51:55,239 INFO L226 Difference]: Without dead ends: 818 [2019-10-02 12:51:55,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=297, Invalid=3863, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 12:51:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-02 12:51:55,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 633. [2019-10-02 12:51:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:51:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 919 transitions. [2019-10-02 12:51:55,305 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 919 transitions. Word has length 154 [2019-10-02 12:51:55,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:55,306 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 919 transitions. [2019-10-02 12:51:55,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-02 12:51:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 919 transitions. [2019-10-02 12:51:55,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:51:55,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:55,313 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:51:55,314 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:55,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:55,314 INFO L82 PathProgramCache]: Analyzing trace with hash 864289227, now seen corresponding path program 1 times [2019-10-02 12:51:55,314 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:55,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:55,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:55,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:51:56,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:56,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-02 12:51:56,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 12:51:56,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 12:51:56,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:51:56,190 INFO L87 Difference]: Start difference. First operand 633 states and 919 transitions. Second operand 25 states. [2019-10-02 12:52:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:03,116 INFO L93 Difference]: Finished difference Result 1864 states and 2600 transitions. [2019-10-02 12:52:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 12:52:03,116 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 155 [2019-10-02 12:52:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:03,128 INFO L225 Difference]: With dead ends: 1864 [2019-10-02 12:52:03,128 INFO L226 Difference]: Without dead ends: 1720 [2019-10-02 12:52:03,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=681, Invalid=5325, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 12:52:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2019-10-02 12:52:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1358. [2019-10-02 12:52:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2019-10-02 12:52:03,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1964 transitions. [2019-10-02 12:52:03,226 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1964 transitions. Word has length 155 [2019-10-02 12:52:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:03,227 INFO L475 AbstractCegarLoop]: Abstraction has 1358 states and 1964 transitions. [2019-10-02 12:52:03,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 12:52:03,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1964 transitions. [2019-10-02 12:52:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:03,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:03,234 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:03,234 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 339417093, now seen corresponding path program 1 times [2019-10-02 12:52:03,235 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:03,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:03,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:03,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:03,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:03,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:03,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:52:03,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:52:03,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:52:03,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:52:03,475 INFO L87 Difference]: Start difference. First operand 1358 states and 1964 transitions. Second operand 9 states. [2019-10-02 12:52:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:03,766 INFO L93 Difference]: Finished difference Result 1819 states and 2569 transitions. [2019-10-02 12:52:03,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:52:03,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2019-10-02 12:52:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:03,780 INFO L225 Difference]: With dead ends: 1819 [2019-10-02 12:52:03,780 INFO L226 Difference]: Without dead ends: 1393 [2019-10-02 12:52:03,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:52:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-10-02 12:52:03,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2019-10-02 12:52:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1393 states. [2019-10-02 12:52:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 2018 transitions. [2019-10-02 12:52:03,900 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 2018 transitions. Word has length 156 [2019-10-02 12:52:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:03,901 INFO L475 AbstractCegarLoop]: Abstraction has 1393 states and 2018 transitions. [2019-10-02 12:52:03,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:52:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 2018 transitions. [2019-10-02 12:52:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:03,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:03,912 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:03,912 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:03,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:03,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1109181897, now seen corresponding path program 1 times [2019-10-02 12:52:03,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:03,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:03,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:03,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:03,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:04,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:04,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:52:04,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:52:04,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:52:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:52:04,190 INFO L87 Difference]: Start difference. First operand 1393 states and 2018 transitions. Second operand 5 states. [2019-10-02 12:52:04,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:04,956 INFO L93 Difference]: Finished difference Result 3181 states and 4504 transitions. [2019-10-02 12:52:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:52:04,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-02 12:52:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:04,974 INFO L225 Difference]: With dead ends: 3181 [2019-10-02 12:52:04,974 INFO L226 Difference]: Without dead ends: 2740 [2019-10-02 12:52:04,978 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:52:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2019-10-02 12:52:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 2524. [2019-10-02 12:52:05,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-10-02 12:52:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3568 transitions. [2019-10-02 12:52:05,164 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3568 transitions. Word has length 156 [2019-10-02 12:52:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:05,167 INFO L475 AbstractCegarLoop]: Abstraction has 2524 states and 3568 transitions. [2019-10-02 12:52:05,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:52:05,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3568 transitions. [2019-10-02 12:52:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:05,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:05,175 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:05,175 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:05,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:05,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1175681558, now seen corresponding path program 1 times [2019-10-02 12:52:05,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:05,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:05,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:05,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:05,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:52:05,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:52:05,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:52:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:52:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:52:05,469 INFO L87 Difference]: Start difference. First operand 2524 states and 3568 transitions. Second operand 9 states. [2019-10-02 12:52:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:05,790 INFO L93 Difference]: Finished difference Result 2839 states and 3975 transitions. [2019-10-02 12:52:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:52:05,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 156 [2019-10-02 12:52:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:05,796 INFO L225 Difference]: With dead ends: 2839 [2019-10-02 12:52:05,796 INFO L226 Difference]: Without dead ends: 966 [2019-10-02 12:52:05,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:52:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-10-02 12:52:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-10-02 12:52:05,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-10-02 12:52:05,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1348 transitions. [2019-10-02 12:52:05,850 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1348 transitions. Word has length 156 [2019-10-02 12:52:05,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:05,851 INFO L475 AbstractCegarLoop]: Abstraction has 964 states and 1348 transitions. [2019-10-02 12:52:05,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:52:05,851 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1348 transitions. [2019-10-02 12:52:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:52:05,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:05,855 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:05,855 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:05,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1475896574, now seen corresponding path program 2 times [2019-10-02 12:52:05,856 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:05,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:05,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:05,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:06,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:06,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 12:52:06,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 12:52:06,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 12:52:06,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:52:06,404 INFO L87 Difference]: Start difference. First operand 964 states and 1348 transitions. Second operand 23 states. [2019-10-02 12:52:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:12,616 INFO L93 Difference]: Finished difference Result 3840 states and 5359 transitions. [2019-10-02 12:52:12,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 12:52:12,617 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 156 [2019-10-02 12:52:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:12,638 INFO L225 Difference]: With dead ends: 3840 [2019-10-02 12:52:12,638 INFO L226 Difference]: Without dead ends: 3447 [2019-10-02 12:52:12,643 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=726, Invalid=5436, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 12:52:12,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2019-10-02 12:52:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 2519. [2019-10-02 12:52:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2519 states. [2019-10-02 12:52:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3560 transitions. [2019-10-02 12:52:12,822 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3560 transitions. Word has length 156 [2019-10-02 12:52:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:12,823 INFO L475 AbstractCegarLoop]: Abstraction has 2519 states and 3560 transitions. [2019-10-02 12:52:12,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 12:52:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3560 transitions. [2019-10-02 12:52:12,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:52:12,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:12,831 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:12,832 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1644365759, now seen corresponding path program 2 times [2019-10-02 12:52:12,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:12,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:12,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:52:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:13,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:52:13,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:52:13,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:52:13,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:52:13,006 INFO L87 Difference]: Start difference. First operand 2519 states and 3560 transitions. Second operand 7 states. [2019-10-02 12:52:13,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:13,251 INFO L93 Difference]: Finished difference Result 2834 states and 3967 transitions. [2019-10-02 12:52:13,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:52:13,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 157 [2019-10-02 12:52:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:13,260 INFO L225 Difference]: With dead ends: 2834 [2019-10-02 12:52:13,260 INFO L226 Difference]: Without dead ends: 966 [2019-10-02 12:52:13,266 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:52:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-10-02 12:52:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 964. [2019-10-02 12:52:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-10-02 12:52:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1347 transitions. [2019-10-02 12:52:13,340 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1347 transitions. Word has length 157 [2019-10-02 12:52:13,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:13,341 INFO L475 AbstractCegarLoop]: Abstraction has 964 states and 1347 transitions. [2019-10-02 12:52:13,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:52:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1347 transitions. [2019-10-02 12:52:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:52:13,345 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:13,345 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:13,345 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -694323250, now seen corresponding path program 3 times [2019-10-02 12:52:13,346 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:13,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:52:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:13,833 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:13,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:13,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-10-02 12:52:13,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-02 12:52:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-02 12:52:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:52:13,834 INFO L87 Difference]: Start difference. First operand 964 states and 1347 transitions. Second operand 25 states. [2019-10-02 12:52:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:19,252 INFO L93 Difference]: Finished difference Result 3847 states and 5366 transitions. [2019-10-02 12:52:19,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-10-02 12:52:19,253 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 157 [2019-10-02 12:52:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:19,272 INFO L225 Difference]: With dead ends: 3847 [2019-10-02 12:52:19,272 INFO L226 Difference]: Without dead ends: 3454 [2019-10-02 12:52:19,277 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=681, Invalid=5325, Unknown=0, NotChecked=0, Total=6006 [2019-10-02 12:52:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2019-10-02 12:52:19,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 2524. [2019-10-02 12:52:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-10-02 12:52:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 3565 transitions. [2019-10-02 12:52:19,453 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 3565 transitions. Word has length 157 [2019-10-02 12:52:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:19,454 INFO L475 AbstractCegarLoop]: Abstraction has 2524 states and 3565 transitions. [2019-10-02 12:52:19,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-02 12:52:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 3565 transitions. [2019-10-02 12:52:19,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:52:19,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:19,462 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:19,462 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:19,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:19,462 INFO L82 PathProgramCache]: Analyzing trace with hash 103335027, now seen corresponding path program 3 times [2019-10-02 12:52:19,462 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:19,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:19,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:19,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:52:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:19,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:19,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:52:19,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:52:19,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:52:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:52:19,623 INFO L87 Difference]: Start difference. First operand 2524 states and 3565 transitions. Second operand 9 states. [2019-10-02 12:52:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:19,894 INFO L93 Difference]: Finished difference Result 2841 states and 3974 transitions. [2019-10-02 12:52:19,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:52:19,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:52:19,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:19,900 INFO L225 Difference]: With dead ends: 2841 [2019-10-02 12:52:19,900 INFO L226 Difference]: Without dead ends: 968 [2019-10-02 12:52:19,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:52:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-02 12:52:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 964. [2019-10-02 12:52:19,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-10-02 12:52:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1346 transitions. [2019-10-02 12:52:19,954 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1346 transitions. Word has length 158 [2019-10-02 12:52:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:19,956 INFO L475 AbstractCegarLoop]: Abstraction has 964 states and 1346 transitions. [2019-10-02 12:52:19,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:52:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1346 transitions. [2019-10-02 12:52:19,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:52:19,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:19,960 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:19,960 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:19,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1347675872, now seen corresponding path program 1 times [2019-10-02 12:52:19,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:19,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:19,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:52:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:20,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:20,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-10-02 12:52:20,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 12:52:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 12:52:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:52:20,429 INFO L87 Difference]: Start difference. First operand 964 states and 1346 transitions. Second operand 23 states. [2019-10-02 12:52:26,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:26,118 INFO L93 Difference]: Finished difference Result 4336 states and 6127 transitions. [2019-10-02 12:52:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:52:26,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 158 [2019-10-02 12:52:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:26,143 INFO L225 Difference]: With dead ends: 4336 [2019-10-02 12:52:26,144 INFO L226 Difference]: Without dead ends: 3461 [2019-10-02 12:52:26,151 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=738, Invalid=5582, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:52:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3461 states. [2019-10-02 12:52:26,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3461 to 2521. [2019-10-02 12:52:26,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2521 states. [2019-10-02 12:52:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2521 states to 2521 states and 3562 transitions. [2019-10-02 12:52:26,328 INFO L78 Accepts]: Start accepts. Automaton has 2521 states and 3562 transitions. Word has length 158 [2019-10-02 12:52:26,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:26,328 INFO L475 AbstractCegarLoop]: Abstraction has 2521 states and 3562 transitions. [2019-10-02 12:52:26,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 12:52:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2521 states and 3562 transitions. [2019-10-02 12:52:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:52:26,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:26,337 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:26,337 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1019201631, now seen corresponding path program 1 times [2019-10-02 12:52:26,338 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:26,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:26,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:26,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:26,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:52:26,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:26,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:52:26,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:52:26,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:52:26,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:52:26,501 INFO L87 Difference]: Start difference. First operand 2521 states and 3562 transitions. Second operand 7 states. [2019-10-02 12:52:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:26,782 INFO L93 Difference]: Finished difference Result 2840 states and 3974 transitions. [2019-10-02 12:52:26,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:52:26,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 159 [2019-10-02 12:52:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:26,789 INFO L225 Difference]: With dead ends: 2840 [2019-10-02 12:52:26,789 INFO L226 Difference]: Without dead ends: 972 [2019-10-02 12:52:26,797 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:52:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-10-02 12:52:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 966. [2019-10-02 12:52:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2019-10-02 12:52:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1349 transitions. [2019-10-02 12:52:26,868 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1349 transitions. Word has length 159 [2019-10-02 12:52:26,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:26,868 INFO L475 AbstractCegarLoop]: Abstraction has 966 states and 1349 transitions. [2019-10-02 12:52:26,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:52:26,869 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1349 transitions. [2019-10-02 12:52:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:52:26,873 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:26,873 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:26,873 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:26,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash 559004235, now seen corresponding path program 1 times [2019-10-02 12:52:26,874 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:26,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:26,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:26,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:52:27,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:27,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-10-02 12:52:27,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:52:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:52:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:52:27,230 INFO L87 Difference]: Start difference. First operand 966 states and 1349 transitions. Second operand 17 states. [2019-10-02 12:52:30,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:30,122 INFO L93 Difference]: Finished difference Result 2410 states and 3320 transitions. [2019-10-02 12:52:30,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 12:52:30,122 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 159 [2019-10-02 12:52:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:30,133 INFO L225 Difference]: With dead ends: 2410 [2019-10-02 12:52:30,133 INFO L226 Difference]: Without dead ends: 2017 [2019-10-02 12:52:30,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1409, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 12:52:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2019-10-02 12:52:30,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1950. [2019-10-02 12:52:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-10-02 12:52:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2712 transitions. [2019-10-02 12:52:30,264 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2712 transitions. Word has length 159 [2019-10-02 12:52:30,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:30,265 INFO L475 AbstractCegarLoop]: Abstraction has 1950 states and 2712 transitions. [2019-10-02 12:52:30,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:52:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2712 transitions. [2019-10-02 12:52:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:52:30,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:30,270 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:30,271 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash 301781398, now seen corresponding path program 1 times [2019-10-02 12:52:30,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:30,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:30,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:52:30,400 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 12:52:30,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:30,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 2228 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:52:30,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:52:30,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:30,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:52:30,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:52:30,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:52:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:52:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:52:30,919 INFO L87 Difference]: Start difference. First operand 1950 states and 2712 transitions. Second operand 5 states. [2019-10-02 12:52:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:31,073 INFO L93 Difference]: Finished difference Result 3283 states and 4473 transitions. [2019-10-02 12:52:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:52:31,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-02 12:52:31,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:31,123 INFO L225 Difference]: With dead ends: 3283 [2019-10-02 12:52:31,123 INFO L226 Difference]: Without dead ends: 2018 [2019-10-02 12:52:31,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:52:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2019-10-02 12:52:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 2011. [2019-10-02 12:52:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-10-02 12:52:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2812 transitions. [2019-10-02 12:52:31,252 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2812 transitions. Word has length 160 [2019-10-02 12:52:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:31,253 INFO L475 AbstractCegarLoop]: Abstraction has 2011 states and 2812 transitions. [2019-10-02 12:52:31,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:52:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2812 transitions. [2019-10-02 12:52:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:52:31,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:31,259 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:31,259 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:31,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1911542739, now seen corresponding path program 1 times [2019-10-02 12:52:31,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:31,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:31,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:31,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:31,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:31,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:31,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:31,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:31,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:31,374 INFO L87 Difference]: Start difference. First operand 2011 states and 2812 transitions. Second operand 3 states. [2019-10-02 12:52:31,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:31,482 INFO L93 Difference]: Finished difference Result 4154 states and 5936 transitions. [2019-10-02 12:52:31,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:31,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-02 12:52:31,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:31,494 INFO L225 Difference]: With dead ends: 4154 [2019-10-02 12:52:31,494 INFO L226 Difference]: Without dead ends: 2247 [2019-10-02 12:52:31,501 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 12:52:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-10-02 12:52:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2244. [2019-10-02 12:52:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-10-02 12:52:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3236 transitions. [2019-10-02 12:52:31,650 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3236 transitions. Word has length 166 [2019-10-02 12:52:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:31,650 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3236 transitions. [2019-10-02 12:52:31,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3236 transitions. [2019-10-02 12:52:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:52:31,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:31,660 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:52:31,660 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:31,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1497111094, now seen corresponding path program 2 times [2019-10-02 12:52:31,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:31,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:31,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:31,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:31,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:31,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:31,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:52:31,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:52:31,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:52:31,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:52:31,792 INFO L87 Difference]: Start difference. First operand 2244 states and 3236 transitions. Second operand 6 states. [2019-10-02 12:52:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:31,906 INFO L93 Difference]: Finished difference Result 4339 states and 6273 transitions. [2019-10-02 12:52:31,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:52:31,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-10-02 12:52:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:31,915 INFO L225 Difference]: With dead ends: 4339 [2019-10-02 12:52:31,915 INFO L226 Difference]: Without dead ends: 2247 [2019-10-02 12:52:31,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:52:31,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2247 states. [2019-10-02 12:52:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2247 to 2244. [2019-10-02 12:52:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2244 states. [2019-10-02 12:52:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2244 states to 2244 states and 3230 transitions. [2019-10-02 12:52:32,058 INFO L78 Accepts]: Start accepts. Automaton has 2244 states and 3230 transitions. Word has length 167 [2019-10-02 12:52:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:32,059 INFO L475 AbstractCegarLoop]: Abstraction has 2244 states and 3230 transitions. [2019-10-02 12:52:32,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:52:32,059 INFO L276 IsEmpty]: Start isEmpty. Operand 2244 states and 3230 transitions. [2019-10-02 12:52:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:52:32,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:32,066 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:32,066 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:32,067 INFO L82 PathProgramCache]: Analyzing trace with hash 783173959, now seen corresponding path program 1 times [2019-10-02 12:52:32,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:32,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:32,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:32,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:52:32,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:32,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:32,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:32,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:32,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:32,207 INFO L87 Difference]: Start difference. First operand 2244 states and 3230 transitions. Second operand 3 states. [2019-10-02 12:52:32,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:32,360 INFO L93 Difference]: Finished difference Result 4815 states and 7133 transitions. [2019-10-02 12:52:32,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:32,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-02 12:52:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:32,383 INFO L225 Difference]: With dead ends: 4815 [2019-10-02 12:52:32,383 INFO L226 Difference]: Without dead ends: 2681 [2019-10-02 12:52:32,390 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 12:52:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2019-10-02 12:52:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2678. [2019-10-02 12:52:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2019-10-02 12:52:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 4017 transitions. [2019-10-02 12:52:32,593 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 4017 transitions. Word has length 167 [2019-10-02 12:52:32,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:32,593 INFO L475 AbstractCegarLoop]: Abstraction has 2678 states and 4017 transitions. [2019-10-02 12:52:32,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4017 transitions. [2019-10-02 12:52:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:52:32,606 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:32,607 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:32,607 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:32,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:32,607 INFO L82 PathProgramCache]: Analyzing trace with hash 186839857, now seen corresponding path program 1 times [2019-10-02 12:52:32,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:32,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:32,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:32,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:32,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:32,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:32,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:32,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:32,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:32,749 INFO L87 Difference]: Start difference. First operand 2678 states and 4017 transitions. Second operand 3 states. [2019-10-02 12:52:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:32,953 INFO L93 Difference]: Finished difference Result 6075 states and 9401 transitions. [2019-10-02 12:52:32,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:32,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-10-02 12:52:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:32,968 INFO L225 Difference]: With dead ends: 6075 [2019-10-02 12:52:32,969 INFO L226 Difference]: Without dead ends: 3515 [2019-10-02 12:52:32,977 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 12:52:32,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2019-10-02 12:52:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 3512. [2019-10-02 12:52:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3512 states. [2019-10-02 12:52:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5498 transitions. [2019-10-02 12:52:33,213 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5498 transitions. Word has length 168 [2019-10-02 12:52:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:33,214 INFO L475 AbstractCegarLoop]: Abstraction has 3512 states and 5498 transitions. [2019-10-02 12:52:33,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5498 transitions. [2019-10-02 12:52:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:52:33,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:33,227 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:33,227 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1340050393, now seen corresponding path program 1 times [2019-10-02 12:52:33,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:33,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:33,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:33,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:33,334 INFO L87 Difference]: Start difference. First operand 3512 states and 5498 transitions. Second operand 3 states. [2019-10-02 12:52:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:33,583 INFO L93 Difference]: Finished difference Result 8487 states and 13679 transitions. [2019-10-02 12:52:33,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:33,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 12:52:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:33,603 INFO L225 Difference]: With dead ends: 8487 [2019-10-02 12:52:33,603 INFO L226 Difference]: Without dead ends: 5105 [2019-10-02 12:52:33,616 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 12:52:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2019-10-02 12:52:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 5102. [2019-10-02 12:52:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5102 states. [2019-10-02 12:52:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 8287 transitions. [2019-10-02 12:52:34,036 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 8287 transitions. Word has length 169 [2019-10-02 12:52:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:34,036 INFO L475 AbstractCegarLoop]: Abstraction has 5102 states and 8287 transitions. [2019-10-02 12:52:34,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 8287 transitions. [2019-10-02 12:52:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:52:34,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:34,060 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:34,060 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:34,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:34,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1473376337, now seen corresponding path program 1 times [2019-10-02 12:52:34,061 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:34,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:34,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:34,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:34,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:34,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:34,164 INFO L87 Difference]: Start difference. First operand 5102 states and 8287 transitions. Second operand 3 states. [2019-10-02 12:52:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:34,574 INFO L93 Difference]: Finished difference Result 13287 states and 22124 transitions. [2019-10-02 12:52:34,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:34,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 12:52:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:34,609 INFO L225 Difference]: With dead ends: 13287 [2019-10-02 12:52:34,610 INFO L226 Difference]: Without dead ends: 8323 [2019-10-02 12:52:34,633 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 12:52:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2019-10-02 12:52:35,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 8320. [2019-10-02 12:52:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-10-02 12:52:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 13904 transitions. [2019-10-02 12:52:35,179 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 13904 transitions. Word has length 170 [2019-10-02 12:52:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:35,180 INFO L475 AbstractCegarLoop]: Abstraction has 8320 states and 13904 transitions. [2019-10-02 12:52:35,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 13904 transitions. [2019-10-02 12:52:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:52:35,215 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:35,216 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:35,217 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:35,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1221316359, now seen corresponding path program 1 times [2019-10-02 12:52:35,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:35,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:35,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:35,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:35,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:35,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:35,327 INFO L87 Difference]: Start difference. First operand 8320 states and 13904 transitions. Second operand 3 states. [2019-10-02 12:52:36,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:36,004 INFO L93 Difference]: Finished difference Result 22453 states and 38198 transitions. [2019-10-02 12:52:36,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:36,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 12:52:36,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:36,068 INFO L225 Difference]: With dead ends: 22453 [2019-10-02 12:52:36,068 INFO L226 Difference]: Without dead ends: 14277 [2019-10-02 12:52:36,096 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 12:52:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14277 states. [2019-10-02 12:52:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14277 to 14274. [2019-10-02 12:52:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14274 states. [2019-10-02 12:52:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14274 states to 14274 states and 24273 transitions. [2019-10-02 12:52:37,891 INFO L78 Accepts]: Start accepts. Automaton has 14274 states and 24273 transitions. Word has length 171 [2019-10-02 12:52:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:37,892 INFO L475 AbstractCegarLoop]: Abstraction has 14274 states and 24273 transitions. [2019-10-02 12:52:37,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 14274 states and 24273 transitions. [2019-10-02 12:52:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:52:37,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:37,919 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:52:37,919 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:37,919 INFO L82 PathProgramCache]: Analyzing trace with hash -513519399, now seen corresponding path program 1 times [2019-10-02 12:52:37,919 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:37,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:37,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:52:38,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:52:38,035 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 12:52:38,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:38,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 2292 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:52:38,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:52:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:52:38,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:52:38,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 12:52:38,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:52:38,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:52:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:52:38,556 INFO L87 Difference]: Start difference. First operand 14274 states and 24273 transitions. Second operand 6 states. [2019-10-02 12:52:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:39,140 INFO L93 Difference]: Finished difference Result 16397 states and 27301 transitions. [2019-10-02 12:52:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:52:39,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-10-02 12:52:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:39,203 INFO L225 Difference]: With dead ends: 16397 [2019-10-02 12:52:39,203 INFO L226 Difference]: Without dead ends: 15132 [2019-10-02 12:52:39,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:52:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15132 states. [2019-10-02 12:52:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15132 to 15053. [2019-10-02 12:52:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15053 states. [2019-10-02 12:52:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15053 states to 15053 states and 25499 transitions. [2019-10-02 12:52:39,991 INFO L78 Accepts]: Start accepts. Automaton has 15053 states and 25499 transitions. Word has length 178 [2019-10-02 12:52:39,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:39,991 INFO L475 AbstractCegarLoop]: Abstraction has 15053 states and 25499 transitions. [2019-10-02 12:52:39,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:52:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 15053 states and 25499 transitions. [2019-10-02 12:52:40,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:52:40,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:40,028 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:40,029 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:40,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1251563247, now seen corresponding path program 1 times [2019-10-02 12:52:40,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:40,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:40,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:40,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:40,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:40,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:40,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:40,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:40,132 INFO L87 Difference]: Start difference. First operand 15053 states and 25499 transitions. Second operand 3 states. [2019-10-02 12:52:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:41,369 INFO L93 Difference]: Finished difference Result 41697 states and 71401 transitions. [2019-10-02 12:52:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:41,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 12:52:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:41,498 INFO L225 Difference]: With dead ends: 41697 [2019-10-02 12:52:41,498 INFO L226 Difference]: Without dead ends: 27234 [2019-10-02 12:52:41,733 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 12:52:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27234 states. [2019-10-02 12:52:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27234 to 27231. [2019-10-02 12:52:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27231 states. [2019-10-02 12:52:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27231 states to 27231 states and 46332 transitions. [2019-10-02 12:52:44,242 INFO L78 Accepts]: Start accepts. Automaton has 27231 states and 46332 transitions. Word has length 172 [2019-10-02 12:52:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:44,243 INFO L475 AbstractCegarLoop]: Abstraction has 27231 states and 46332 transitions. [2019-10-02 12:52:44,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 27231 states and 46332 transitions. [2019-10-02 12:52:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:52:44,293 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:44,293 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:44,293 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:44,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2133952935, now seen corresponding path program 1 times [2019-10-02 12:52:44,294 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:44,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:44,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:44,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:44,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:44,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:44,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:44,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:44,424 INFO L87 Difference]: Start difference. First operand 27231 states and 46332 transitions. Second operand 3 states. [2019-10-02 12:52:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:46,281 INFO L93 Difference]: Finished difference Result 76183 states and 129886 transitions. [2019-10-02 12:52:46,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:46,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-10-02 12:52:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:46,452 INFO L225 Difference]: With dead ends: 76183 [2019-10-02 12:52:46,452 INFO L226 Difference]: Without dead ends: 49674 [2019-10-02 12:52:46,538 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 12:52:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49674 states. [2019-10-02 12:52:49,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49674 to 49671. [2019-10-02 12:52:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49671 states. [2019-10-02 12:52:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49671 states to 49671 states and 83802 transitions. [2019-10-02 12:52:49,390 INFO L78 Accepts]: Start accepts. Automaton has 49671 states and 83802 transitions. Word has length 173 [2019-10-02 12:52:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:49,390 INFO L475 AbstractCegarLoop]: Abstraction has 49671 states and 83802 transitions. [2019-10-02 12:52:49,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:52:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 49671 states and 83802 transitions. [2019-10-02 12:52:49,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:52:49,441 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:49,441 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:52:49,441 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:49,442 INFO L82 PathProgramCache]: Analyzing trace with hash 468294989, now seen corresponding path program 1 times [2019-10-02 12:52:49,442 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:49,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:49,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:52:49,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:49,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:52:49,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:52:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:52:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:49,552 INFO L87 Difference]: Start difference. First operand 49671 states and 83802 transitions. Second operand 3 states. [2019-10-02 12:52:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:52:54,252 INFO L93 Difference]: Finished difference Result 140741 states and 238579 transitions. [2019-10-02 12:52:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:52:54,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-10-02 12:52:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:52:54,545 INFO L225 Difference]: With dead ends: 140741 [2019-10-02 12:52:54,545 INFO L226 Difference]: Without dead ends: 92002 [2019-10-02 12:52:54,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:52:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92002 states. [2019-10-02 12:53:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92002 to 91999. [2019-10-02 12:53:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91999 states. [2019-10-02 12:53:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91999 states to 91999 states and 154554 transitions. [2019-10-02 12:53:02,344 INFO L78 Accepts]: Start accepts. Automaton has 91999 states and 154554 transitions. Word has length 174 [2019-10-02 12:53:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:02,344 INFO L475 AbstractCegarLoop]: Abstraction has 91999 states and 154554 transitions. [2019-10-02 12:53:02,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 91999 states and 154554 transitions. [2019-10-02 12:53:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:53:02,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:02,398 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:02,398 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -163863545, now seen corresponding path program 1 times [2019-10-02 12:53:02,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:02,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:02,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:02,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:02,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:02,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:02,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:02,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:02,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:02,498 INFO L87 Difference]: Start difference. First operand 91999 states and 154554 transitions. Second operand 3 states. [2019-10-02 12:53:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:11,303 INFO L93 Difference]: Finished difference Result 173289 states and 288514 transitions. [2019-10-02 12:53:11,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:11,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 12:53:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:11,737 INFO L225 Difference]: With dead ends: 173289 [2019-10-02 12:53:11,738 INFO L226 Difference]: Without dead ends: 172024 [2019-10-02 12:53:11,784 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 12:53:11,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172024 states. [2019-10-02 12:53:23,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172024 to 172021. [2019-10-02 12:53:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172021 states. [2019-10-02 12:53:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172021 states to 172021 states and 283769 transitions. [2019-10-02 12:53:24,366 INFO L78 Accepts]: Start accepts. Automaton has 172021 states and 283769 transitions. Word has length 175 [2019-10-02 12:53:24,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:24,366 INFO L475 AbstractCegarLoop]: Abstraction has 172021 states and 283769 transitions. [2019-10-02 12:53:24,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 172021 states and 283769 transitions. [2019-10-02 12:53:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:53:24,429 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:24,429 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:53:24,430 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:24,430 INFO L82 PathProgramCache]: Analyzing trace with hash -104359187, now seen corresponding path program 1 times [2019-10-02 12:53:24,430 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:24,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:24,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:24,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:53:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:53:24,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:53:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:53:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:24,854 INFO L87 Difference]: Start difference. First operand 172021 states and 283769 transitions. Second operand 3 states. [2019-10-02 12:53:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:36,118 INFO L93 Difference]: Finished difference Result 173543 states and 285756 transitions. [2019-10-02 12:53:36,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:53:36,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-10-02 12:53:36,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:36,707 INFO L225 Difference]: With dead ends: 173543 [2019-10-02 12:53:36,707 INFO L226 Difference]: Without dead ends: 172370 [2019-10-02 12:53:36,772 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:53:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172370 states. [2019-10-02 12:53:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172370 to 172173. [2019-10-02 12:53:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172173 states. [2019-10-02 12:53:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172173 states to 172173 states and 283927 transitions. [2019-10-02 12:53:46,886 INFO L78 Accepts]: Start accepts. Automaton has 172173 states and 283927 transitions. Word has length 176 [2019-10-02 12:53:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:53:46,886 INFO L475 AbstractCegarLoop]: Abstraction has 172173 states and 283927 transitions. [2019-10-02 12:53:46,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:53:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 172173 states and 283927 transitions. [2019-10-02 12:53:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 12:53:47,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:53:47,425 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:47,425 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:53:47,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:53:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1885977305, now seen corresponding path program 1 times [2019-10-02 12:53:47,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:53:47,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:53:47,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:47,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:53:47,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:53:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:53:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-10-02 12:53:47,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:53:47,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:53:47,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:53:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:53:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:53:47,554 INFO L87 Difference]: Start difference. First operand 172173 states and 283927 transitions. Second operand 5 states. [2019-10-02 12:53:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:53:58,781 INFO L93 Difference]: Finished difference Result 172566 states and 284428 transitions. [2019-10-02 12:53:58,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:53:58,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 268 [2019-10-02 12:53:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:53:59,267 INFO L225 Difference]: With dead ends: 172566 [2019-10-02 12:53:59,267 INFO L226 Difference]: Without dead ends: 171601 [2019-10-02 12:53:59,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:53:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171601 states. [2019-10-02 12:54:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171601 to 171601. [2019-10-02 12:54:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171601 states. [2019-10-02 12:54:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171601 states to 171601 states and 283191 transitions. [2019-10-02 12:54:12,848 INFO L78 Accepts]: Start accepts. Automaton has 171601 states and 283191 transitions. Word has length 268 [2019-10-02 12:54:12,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:12,848 INFO L475 AbstractCegarLoop]: Abstraction has 171601 states and 283191 transitions. [2019-10-02 12:54:12,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:54:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 171601 states and 283191 transitions. [2019-10-02 12:54:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 12:54:13,464 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:54:13,464 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:13,464 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:54:13,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:54:13,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1541186445, now seen corresponding path program 1 times [2019-10-02 12:54:13,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:54:13,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:54:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:54:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:54:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:54:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-02 12:54:13,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:54:13,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:54:13,644 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:54:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:54:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:54:13,645 INFO L87 Difference]: Start difference. First operand 171601 states and 283191 transitions. Second operand 10 states. [2019-10-02 12:54:22,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:54:22,853 INFO L93 Difference]: Finished difference Result 171721 states and 283329 transitions. [2019-10-02 12:54:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:54:22,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 269 [2019-10-02 12:54:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:54:22,854 INFO L225 Difference]: With dead ends: 171721 [2019-10-02 12:54:22,854 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 12:54:23,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:54:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 12:54:23,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 12:54:23,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 12:54:23,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 12:54:23,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2019-10-02 12:54:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:54:23,193 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 12:54:23,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:54:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 12:54:23,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 12:54:23,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 12:54:25,842 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-10-02 12:54:28,596 WARN L191 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 21 [2019-10-02 12:55:10,889 WARN L191 SmtUtils]: Spent 41.49 s on a formula simplification. DAG size of input: 3167 DAG size of output: 479 [2019-10-02 12:57:48,984 WARN L191 SmtUtils]: Spent 2.20 m on a formula simplification. DAG size of input: 6242 DAG size of output: 808 [2019-10-02 13:00:02,928 WARN L191 SmtUtils]: Spent 2.23 m on a formula simplification. DAG size of input: 6242 DAG size of output: 808 [2019-10-02 13:02:15,216 WARN L191 SmtUtils]: Spent 2.20 m on a formula simplification. DAG size of input: 6242 DAG size of output: 808 [2019-10-02 13:04:26,616 WARN L191 SmtUtils]: Spent 2.19 m on a formula simplification. DAG size of input: 6242 DAG size of output: 808 [2019-10-02 13:04:31,313 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128