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_spec0_product35.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:44:06,592 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:44:06,594 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:44:06,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:44:06,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:44:06,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:44:06,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:44:06,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:44:06,633 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:44:06,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:44:06,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:44:06,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:44:06,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:44:06,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:44:06,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:44:06,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:44:06,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:44:06,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:44:06,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:44:06,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:44:06,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:44:06,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:44:06,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:44:06,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:44:06,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:44:06,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:44:06,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:44:06,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:44:06,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:44:06,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:44:06,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:44:06,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:44:06,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:44:06,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:44:06,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:44:06,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:44:06,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:44:06,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:44:06,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:44:06,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:44:06,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:44:06,682 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:44:06,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:44:06,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:44:06,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:44:06,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:44:06,725 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:44:06,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:44:06,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:44:06,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:44:06,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:44:06,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:44:06,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:44:06,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:44:06,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:44:06,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:44:06,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:44:06,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:44:06,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:44:06,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:44:06,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:44:06,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:44:06,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:44:06,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:44:06,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:44:06,731 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:44:06,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:44:06,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:44:06,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:44:06,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:44:06,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:44:06,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:44:06,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:44:06,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:44:06,802 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:44:06,802 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:44:06,803 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c [2019-10-02 12:44:06,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74dd1c749/764461ed3c1e4118a00a2cbd1c09e80c/FLAG8afaf82f2 [2019-10-02 12:44:07,484 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:44:07,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product35.cil.c [2019-10-02 12:44:07,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74dd1c749/764461ed3c1e4118a00a2cbd1c09e80c/FLAG8afaf82f2 [2019-10-02 12:44:07,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74dd1c749/764461ed3c1e4118a00a2cbd1c09e80c [2019-10-02 12:44:07,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:44:07,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:44:07,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:44:07,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:44:07,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:44:07,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:44:07" (1/1) ... [2019-10-02 12:44:07,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6764f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:07, skipping insertion in model container [2019-10-02 12:44:07,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:44:07" (1/1) ... [2019-10-02 12:44:07,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:44:07,743 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:44:08,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:44:08,623 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:44:08,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:44:08,900 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:44:08,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08 WrapperNode [2019-10-02 12:44:08,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:44:08,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:44:08,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:44:08,903 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:44:08,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:08,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:08,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:08,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:09,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:09,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:09,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (1/1) ... [2019-10-02 12:44:09,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:44:09,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:44:09,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:44:09,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:44:09,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (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:44:09,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:44:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:44:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:44:09,208 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:44:09,209 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:44:09,209 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-02 12:44:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 12:44:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:44:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:44:09,210 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:44:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:44:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:44:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:44:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:44:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:44:09,213 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:44:09,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:44:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:44:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:44:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:44:09,216 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:44:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:44:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:44:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:44:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:44:09,217 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:44:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:44:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-02 12:44:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:44:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:44:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:44:09,218 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:44:09,219 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:44:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:44:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:44:09,220 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:44:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:44:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:44:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 12:44:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:44:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:44:09,221 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:44:09,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:44:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:44:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:44:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:44:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:44:09,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:44:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:44:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:44:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:44:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:44:09,224 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:44:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:44:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:44:09,225 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:44:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:44:09,226 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:44:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:44:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:44:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:44:09,228 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:44:09,229 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:44:09,230 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:44:09,230 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:44:09,230 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:44:09,230 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:44:09,230 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:44:09,231 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:44:09,231 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:44:09,232 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:44:09,232 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:44:09,232 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:44:09,232 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:44:09,232 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:44:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:44:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:44:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:44:09,233 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:44:09,234 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:44:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:44:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:44:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:44:09,235 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:44:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:44:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:44:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 12:44:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:44:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:44:09,236 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:44:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:44:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:44:09,237 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:44:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:44:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:44:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:44:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:44:09,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:44:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:44:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:44:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:44:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:44:09,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:44:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:44:09,240 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:44:09,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:44:09,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:44:09,241 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:44:09,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:44:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:44:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:44:09,242 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:44:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:44:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:44:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:44:09,244 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:44:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:44:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:44:09,245 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:44:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:44:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:44:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:44:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:44:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:44:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:44:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:44:09,248 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:44:09,249 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:44:09,252 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:44:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-02 12:44:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 12:44:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:44:09,262 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:44:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:44:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:44:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:44:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:44:09,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:44:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:44:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:44:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:44:09,264 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:44:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:44:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:44:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:44:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:44:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:44:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:44:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:44:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:44:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-10-02 12:44:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:44:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:44:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:44:09,267 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:44:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:44:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:44:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:44:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:44:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:44:09,268 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:44:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:44:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:44:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:44:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:44:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:44:09,269 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:44:09,270 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:44:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:44:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:44:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:44:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:44:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:44:09,271 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:44:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:44:09,272 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:44:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 12:44:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:44:09,273 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:44:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:44:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:44:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:44:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-02 12:44:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:44:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:44:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:44:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:44:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:44:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:44:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:44:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:44:09,276 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:44:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:44:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:44:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:44:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:44:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:44:09,277 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:44:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:44:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:44:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:44:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:44:09,278 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:44:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:44:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:44:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:44:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:44:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:44:09,279 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:44:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:44:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:44:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:44:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:44:09,280 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:44:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 12:44:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:44:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:44:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:44:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:44:09,281 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:44:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:44:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:44:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:44:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:44:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:44:09,282 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:44:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:44:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:44:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:44:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:44:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:44:09,283 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:44:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:44:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:44:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:44:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:44:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:44:09,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:44:09,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:44:11,609 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:44:11,609 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:44:11,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:44:11 BoogieIcfgContainer [2019-10-02 12:44:11,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:44:11,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:44:11,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:44:11,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:44:11,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:44:07" (1/3) ... [2019-10-02 12:44:11,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394f8c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:44:11, skipping insertion in model container [2019-10-02 12:44:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:44:08" (2/3) ... [2019-10-02 12:44:11,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@394f8c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:44:11, skipping insertion in model container [2019-10-02 12:44:11,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:44:11" (3/3) ... [2019-10-02 12:44:11,620 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product35.cil.c [2019-10-02 12:44:11,632 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:44:11,643 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:44:11,662 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:44:11,702 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:44:11,703 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:44:11,703 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:44:11,703 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:44:11,703 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:44:11,704 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:44:11,704 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:44:11,704 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:44:11,704 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:44:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states. [2019-10-02 12:44:11,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:44:11,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:11,774 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:44:11,777 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:11,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1323292494, now seen corresponding path program 1 times [2019-10-02 12:44:11,787 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:11,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:11,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:11,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:44:12,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:12,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:44:12,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:44:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:44:12,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:44:12,609 INFO L87 Difference]: Start difference. First operand 680 states. Second operand 2 states. [2019-10-02 12:44:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:12,697 INFO L93 Difference]: Finished difference Result 1035 states and 1395 transitions. [2019-10-02 12:44:12,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:44:12,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 241 [2019-10-02 12:44:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:12,725 INFO L225 Difference]: With dead ends: 1035 [2019-10-02 12:44:12,725 INFO L226 Difference]: Without dead ends: 651 [2019-10-02 12:44:12,733 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:44:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-10-02 12:44:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-10-02 12:44:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-10-02 12:44:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 881 transitions. [2019-10-02 12:44:12,835 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 881 transitions. Word has length 241 [2019-10-02 12:44:12,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:12,838 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 881 transitions. [2019-10-02 12:44:12,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:44:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 881 transitions. [2019-10-02 12:44:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:44:12,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:12,845 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:12,845 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1534104076, now seen corresponding path program 1 times [2019-10-02 12:44:12,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:12,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:12,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:44:13,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:13,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:44:13,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:44:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:44:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:13,195 INFO L87 Difference]: Start difference. First operand 651 states and 881 transitions. Second operand 3 states. [2019-10-02 12:44:13,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:13,260 INFO L93 Difference]: Finished difference Result 1018 states and 1356 transitions. [2019-10-02 12:44:13,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:44:13,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2019-10-02 12:44:13,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:13,268 INFO L225 Difference]: With dead ends: 1018 [2019-10-02 12:44:13,268 INFO L226 Difference]: Without dead ends: 654 [2019-10-02 12:44:13,271 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:44:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2019-10-02 12:44:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 653. [2019-10-02 12:44:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-02 12:44:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 883 transitions. [2019-10-02 12:44:13,309 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 883 transitions. Word has length 242 [2019-10-02 12:44:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:13,309 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 883 transitions. [2019-10-02 12:44:13,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:44:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 883 transitions. [2019-10-02 12:44:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 12:44:13,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:13,315 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:13,316 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1794718877, now seen corresponding path program 1 times [2019-10-02 12:44:13,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:13,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:13,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:13,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:44:13,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:13,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:44:13,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:44:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:44:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:13,587 INFO L87 Difference]: Start difference. First operand 653 states and 883 transitions. Second operand 3 states. [2019-10-02 12:44:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:13,656 INFO L93 Difference]: Finished difference Result 1286 states and 1770 transitions. [2019-10-02 12:44:13,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:44:13,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 254 [2019-10-02 12:44:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:13,673 INFO L225 Difference]: With dead ends: 1286 [2019-10-02 12:44:13,673 INFO L226 Difference]: Without dead ends: 698 [2019-10-02 12:44:13,677 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:44:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-02 12:44:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 697. [2019-10-02 12:44:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-10-02 12:44:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 958 transitions. [2019-10-02 12:44:13,751 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 958 transitions. Word has length 254 [2019-10-02 12:44:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:13,754 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 958 transitions. [2019-10-02 12:44:13,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:44:13,754 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 958 transitions. [2019-10-02 12:44:13,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 12:44:13,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:13,767 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:13,768 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1323106751, now seen corresponding path program 1 times [2019-10-02 12:44:13,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:13,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:13,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:13,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:44:14,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:14,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:44:14,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:44:14,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:44:14,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:14,143 INFO L87 Difference]: Start difference. First operand 697 states and 958 transitions. Second operand 3 states. [2019-10-02 12:44:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:14,183 INFO L93 Difference]: Finished difference Result 1415 states and 1990 transitions. [2019-10-02 12:44:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:44:14,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-02 12:44:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:14,190 INFO L225 Difference]: With dead ends: 1415 [2019-10-02 12:44:14,191 INFO L226 Difference]: Without dead ends: 783 [2019-10-02 12:44:14,193 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:44:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-10-02 12:44:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 782. [2019-10-02 12:44:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-10-02 12:44:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1102 transitions. [2019-10-02 12:44:14,225 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1102 transitions. Word has length 255 [2019-10-02 12:44:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:14,225 INFO L475 AbstractCegarLoop]: Abstraction has 782 states and 1102 transitions. [2019-10-02 12:44:14,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:44:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1102 transitions. [2019-10-02 12:44:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:44:14,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:14,232 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:14,233 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:14,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1302871583, now seen corresponding path program 1 times [2019-10-02 12:44:14,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:14,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:14,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:14,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:44:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:14,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 12:44:14,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:44:14,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:44:14,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:44:14,746 INFO L87 Difference]: Start difference. First operand 782 states and 1102 transitions. Second operand 19 states. [2019-10-02 12:44:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:21,353 INFO L93 Difference]: Finished difference Result 2650 states and 3737 transitions. [2019-10-02 12:44:21,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 12:44:21,354 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 258 [2019-10-02 12:44:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:21,378 INFO L225 Difference]: With dead ends: 2650 [2019-10-02 12:44:21,378 INFO L226 Difference]: Without dead ends: 2299 [2019-10-02 12:44:21,383 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 12:44:21,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-10-02 12:44:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2262. [2019-10-02 12:44:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2019-10-02 12:44:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 3204 transitions. [2019-10-02 12:44:21,521 INFO L78 Accepts]: Start accepts. Automaton has 2262 states and 3204 transitions. Word has length 258 [2019-10-02 12:44:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:21,522 INFO L475 AbstractCegarLoop]: Abstraction has 2262 states and 3204 transitions. [2019-10-02 12:44:21,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:44:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2262 states and 3204 transitions. [2019-10-02 12:44:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:44:21,534 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:21,534 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:21,535 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:21,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:21,535 INFO L82 PathProgramCache]: Analyzing trace with hash -150304222, now seen corresponding path program 1 times [2019-10-02 12:44:21,535 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:21,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:21,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:21,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:44:21,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:44:21,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:44:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:44:21,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:44:21,914 INFO L87 Difference]: Start difference. First operand 2262 states and 3204 transitions. Second operand 18 states. [2019-10-02 12:44:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:22,580 INFO L93 Difference]: Finished difference Result 3915 states and 5505 transitions. [2019-10-02 12:44:22,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:44:22,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 259 [2019-10-02 12:44:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:22,610 INFO L225 Difference]: With dead ends: 3915 [2019-10-02 12:44:22,611 INFO L226 Difference]: Without dead ends: 2444 [2019-10-02 12:44:22,621 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:44:22,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2444 states. [2019-10-02 12:44:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2444 to 2444. [2019-10-02 12:44:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2444 states. [2019-10-02 12:44:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3473 transitions. [2019-10-02 12:44:22,846 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3473 transitions. Word has length 259 [2019-10-02 12:44:22,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:22,848 INFO L475 AbstractCegarLoop]: Abstraction has 2444 states and 3473 transitions. [2019-10-02 12:44:22,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:44:22,848 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3473 transitions. [2019-10-02 12:44:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:44:22,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:22,862 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:22,863 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:22,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:22,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1524612594, now seen corresponding path program 1 times [2019-10-02 12:44:22,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:22,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:22,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:44:23,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:23,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 12:44:23,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:44:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:44:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:44:23,276 INFO L87 Difference]: Start difference. First operand 2444 states and 3473 transitions. Second operand 15 states. [2019-10-02 12:44:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:27,364 INFO L93 Difference]: Finished difference Result 4117 states and 5799 transitions. [2019-10-02 12:44:27,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 12:44:27,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 259 [2019-10-02 12:44:27,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:27,382 INFO L225 Difference]: With dead ends: 4117 [2019-10-02 12:44:27,383 INFO L226 Difference]: Without dead ends: 2544 [2019-10-02 12:44:27,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 12:44:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2019-10-02 12:44:27,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2514. [2019-10-02 12:44:27,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-10-02 12:44:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3589 transitions. [2019-10-02 12:44:27,510 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3589 transitions. Word has length 259 [2019-10-02 12:44:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:27,510 INFO L475 AbstractCegarLoop]: Abstraction has 2514 states and 3589 transitions. [2019-10-02 12:44:27,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:44:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3589 transitions. [2019-10-02 12:44:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:44:27,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:27,521 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:27,521 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash 500619753, now seen corresponding path program 1 times [2019-10-02 12:44:27,522 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:27,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:27,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:27,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:27,760 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 12:44:27,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:27,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:44:27,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:44:27,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:44:27,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:44:27,762 INFO L87 Difference]: Start difference. First operand 2514 states and 3589 transitions. Second operand 5 states. [2019-10-02 12:44:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:29,522 INFO L93 Difference]: Finished difference Result 6250 states and 8975 transitions. [2019-10-02 12:44:29,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:44:29,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-10-02 12:44:29,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:29,569 INFO L225 Difference]: With dead ends: 6250 [2019-10-02 12:44:29,570 INFO L226 Difference]: Without dead ends: 5415 [2019-10-02 12:44:29,580 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:44:29,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2019-10-02 12:44:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5397. [2019-10-02 12:44:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5397 states. [2019-10-02 12:44:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5397 states to 5397 states and 7750 transitions. [2019-10-02 12:44:29,937 INFO L78 Accepts]: Start accepts. Automaton has 5397 states and 7750 transitions. Word has length 259 [2019-10-02 12:44:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:29,938 INFO L475 AbstractCegarLoop]: Abstraction has 5397 states and 7750 transitions. [2019-10-02 12:44:29,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:44:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5397 states and 7750 transitions. [2019-10-02 12:44:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:44:29,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:29,958 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:29,959 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1958504696, now seen corresponding path program 1 times [2019-10-02 12:44:29,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:29,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:29,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:29,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:29,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:44:30,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:44:30,273 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:44:30,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:31,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 3344 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:44:31,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:44:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:44:31,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:44:31,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:44:31,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:44:31,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:44:31,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:44:31,296 INFO L87 Difference]: Start difference. First operand 5397 states and 7750 transitions. Second operand 14 states. [2019-10-02 12:44:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:37,494 INFO L93 Difference]: Finished difference Result 19178 states and 30187 transitions. [2019-10-02 12:44:37,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:44:37,495 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 259 [2019-10-02 12:44:37,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:37,609 INFO L225 Difference]: With dead ends: 19178 [2019-10-02 12:44:37,610 INFO L226 Difference]: Without dead ends: 13817 [2019-10-02 12:44:37,647 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:44:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13817 states. [2019-10-02 12:44:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13817 to 13811. [2019-10-02 12:44:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13811 states. [2019-10-02 12:44:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13811 states to 13811 states and 21290 transitions. [2019-10-02 12:44:39,095 INFO L78 Accepts]: Start accepts. Automaton has 13811 states and 21290 transitions. Word has length 259 [2019-10-02 12:44:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:39,096 INFO L475 AbstractCegarLoop]: Abstraction has 13811 states and 21290 transitions. [2019-10-02 12:44:39,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:44:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13811 states and 21290 transitions. [2019-10-02 12:44:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-10-02 12:44:39,116 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:39,117 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:39,117 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash 762786188, now seen corresponding path program 1 times [2019-10-02 12:44:39,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:39,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:39,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:39,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:39,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:44:39,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:44:39,818 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:44:39,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:40,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 3347 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:44:40,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:44:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:44:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:44:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-10-02 12:44:40,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 12:44:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 12:44:40,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:44:40,990 INFO L87 Difference]: Start difference. First operand 13811 states and 21290 transitions. Second operand 31 states. [2019-10-02 12:44:45,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:45,412 INFO L93 Difference]: Finished difference Result 27797 states and 43958 transitions. [2019-10-02 12:44:45,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 12:44:45,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 262 [2019-10-02 12:44:45,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:45,499 INFO L225 Difference]: With dead ends: 27797 [2019-10-02 12:44:45,500 INFO L226 Difference]: Without dead ends: 14037 [2019-10-02 12:44:45,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 12:44:45,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14037 states. [2019-10-02 12:44:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14037 to 14017. [2019-10-02 12:44:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14017 states. [2019-10-02 12:44:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14017 states to 14017 states and 21521 transitions. [2019-10-02 12:44:46,259 INFO L78 Accepts]: Start accepts. Automaton has 14017 states and 21521 transitions. Word has length 262 [2019-10-02 12:44:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:46,261 INFO L475 AbstractCegarLoop]: Abstraction has 14017 states and 21521 transitions. [2019-10-02 12:44:46,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 12:44:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14017 states and 21521 transitions. [2019-10-02 12:44:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 12:44:46,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:46,284 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:46,284 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash 192503318, now seen corresponding path program 1 times [2019-10-02 12:44:46,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:46,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:46,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:46,571 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:44:46,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:44:46,572 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:44:46,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:47,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 3363 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:44:47,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:44:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:44:48,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:44:48,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-10-02 12:44:48,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:44:48,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:44:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:44:48,317 INFO L87 Difference]: Start difference. First operand 14017 states and 21521 transitions. Second operand 17 states. [2019-10-02 12:44:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:50,437 INFO L93 Difference]: Finished difference Result 28583 states and 45418 transitions. [2019-10-02 12:44:50,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 12:44:50,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 267 [2019-10-02 12:44:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:50,521 INFO L225 Difference]: With dead ends: 28583 [2019-10-02 12:44:50,522 INFO L226 Difference]: Without dead ends: 14627 [2019-10-02 12:44:50,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:44:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14627 states. [2019-10-02 12:44:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14627 to 14147. [2019-10-02 12:44:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14147 states. [2019-10-02 12:44:51,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14147 states to 14147 states and 21702 transitions. [2019-10-02 12:44:51,469 INFO L78 Accepts]: Start accepts. Automaton has 14147 states and 21702 transitions. Word has length 267 [2019-10-02 12:44:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:51,469 INFO L475 AbstractCegarLoop]: Abstraction has 14147 states and 21702 transitions. [2019-10-02 12:44:51,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:44:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 14147 states and 21702 transitions. [2019-10-02 12:44:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-02 12:44:51,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:51,498 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:51,498 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:51,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash -750066457, now seen corresponding path program 1 times [2019-10-02 12:44:51,499 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:51,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:51,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:51,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:44:51,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:51,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:44:51,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:44:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:44:51,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:44:51,833 INFO L87 Difference]: Start difference. First operand 14147 states and 21702 transitions. Second operand 13 states. [2019-10-02 12:44:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:56,000 INFO L93 Difference]: Finished difference Result 41444 states and 67791 transitions. [2019-10-02 12:44:56,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:44:56,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 275 [2019-10-02 12:44:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:56,154 INFO L225 Difference]: With dead ends: 41444 [2019-10-02 12:44:56,155 INFO L226 Difference]: Without dead ends: 28601 [2019-10-02 12:44:56,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:44:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28601 states. [2019-10-02 12:44:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28601 to 28478. [2019-10-02 12:44:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28478 states. [2019-10-02 12:44:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28478 states to 28478 states and 43581 transitions. [2019-10-02 12:44:57,595 INFO L78 Accepts]: Start accepts. Automaton has 28478 states and 43581 transitions. Word has length 275 [2019-10-02 12:44:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:44:57,596 INFO L475 AbstractCegarLoop]: Abstraction has 28478 states and 43581 transitions. [2019-10-02 12:44:57,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:44:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 28478 states and 43581 transitions. [2019-10-02 12:44:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-02 12:44:57,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:44:57,642 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:44:57,642 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:44:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:44:57,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2105310391, now seen corresponding path program 1 times [2019-10-02 12:44:57,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:44:57,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:44:57,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:57,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:44:57,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:44:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:44:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:44:57,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:44:57,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:44:57,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:44:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:44:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:44:57,799 INFO L87 Difference]: Start difference. First operand 28478 states and 43581 transitions. Second operand 3 states. [2019-10-02 12:44:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:44:58,574 INFO L93 Difference]: Finished difference Result 57857 states and 88859 transitions. [2019-10-02 12:44:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:44:58,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-10-02 12:44:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:44:58,724 INFO L225 Difference]: With dead ends: 57857 [2019-10-02 12:44:58,724 INFO L226 Difference]: Without dead ends: 29468 [2019-10-02 12:44:58,812 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:44:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29468 states. [2019-10-02 12:45:01,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29468 to 29462. [2019-10-02 12:45:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29462 states. [2019-10-02 12:45:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29462 states to 29462 states and 45351 transitions. [2019-10-02 12:45:01,642 INFO L78 Accepts]: Start accepts. Automaton has 29462 states and 45351 transitions. Word has length 273 [2019-10-02 12:45:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:01,642 INFO L475 AbstractCegarLoop]: Abstraction has 29462 states and 45351 transitions. [2019-10-02 12:45:01,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:45:01,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29462 states and 45351 transitions. [2019-10-02 12:45:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 12:45:01,677 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:01,678 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:01,678 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 538876379, now seen corresponding path program 1 times [2019-10-02 12:45:01,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:01,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:01,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:45:01,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:01,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:45:01,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:45:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:45:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:45:01,953 INFO L87 Difference]: Start difference. First operand 29462 states and 45351 transitions. Second operand 13 states. [2019-10-02 12:45:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:02,920 INFO L93 Difference]: Finished difference Result 57261 states and 91701 transitions. [2019-10-02 12:45:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:45:02,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 276 [2019-10-02 12:45:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:03,087 INFO L225 Difference]: With dead ends: 57261 [2019-10-02 12:45:03,088 INFO L226 Difference]: Without dead ends: 32472 [2019-10-02 12:45:03,208 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:45:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2019-10-02 12:45:04,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 32192. [2019-10-02 12:45:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32192 states. [2019-10-02 12:45:04,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32192 states to 32192 states and 50424 transitions. [2019-10-02 12:45:04,623 INFO L78 Accepts]: Start accepts. Automaton has 32192 states and 50424 transitions. Word has length 276 [2019-10-02 12:45:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:04,624 INFO L475 AbstractCegarLoop]: Abstraction has 32192 states and 50424 transitions. [2019-10-02 12:45:04,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:45:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 32192 states and 50424 transitions. [2019-10-02 12:45:04,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 12:45:04,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:04,652 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:04,652 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:04,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1748004018, now seen corresponding path program 1 times [2019-10-02 12:45:04,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:04,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:04,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:04,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:45:04,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:04,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:45:04,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:45:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:45:04,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:45:04,893 INFO L87 Difference]: Start difference. First operand 32192 states and 50424 transitions. Second operand 11 states. [2019-10-02 12:45:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:05,871 INFO L93 Difference]: Finished difference Result 61275 states and 100177 transitions. [2019-10-02 12:45:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:45:05,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 277 [2019-10-02 12:45:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:06,056 INFO L225 Difference]: With dead ends: 61275 [2019-10-02 12:45:06,057 INFO L226 Difference]: Without dead ends: 32592 [2019-10-02 12:45:06,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:45:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32592 states. [2019-10-02 12:45:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32592 to 32312. [2019-10-02 12:45:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32312 states. [2019-10-02 12:45:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32312 states to 32312 states and 50544 transitions. [2019-10-02 12:45:07,697 INFO L78 Accepts]: Start accepts. Automaton has 32312 states and 50544 transitions. Word has length 277 [2019-10-02 12:45:07,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:07,698 INFO L475 AbstractCegarLoop]: Abstraction has 32312 states and 50544 transitions. [2019-10-02 12:45:07,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:45:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 32312 states and 50544 transitions. [2019-10-02 12:45:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-02 12:45:07,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:07,730 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:07,730 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -991140152, now seen corresponding path program 1 times [2019-10-02 12:45:07,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:07,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:07,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:45:07,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:07,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:07,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:07,926 INFO L87 Difference]: Start difference. First operand 32312 states and 50544 transitions. Second operand 6 states. [2019-10-02 12:45:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:10,079 INFO L93 Difference]: Finished difference Result 94178 states and 151724 transitions. [2019-10-02 12:45:10,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:10,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 276 [2019-10-02 12:45:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:10,419 INFO L225 Difference]: With dead ends: 94178 [2019-10-02 12:45:10,419 INFO L226 Difference]: Without dead ends: 65375 [2019-10-02 12:45:10,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:45:10,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65375 states. [2019-10-02 12:45:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65375 to 65232. [2019-10-02 12:45:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65232 states. [2019-10-02 12:45:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65232 states to 65232 states and 102017 transitions. [2019-10-02 12:45:14,900 INFO L78 Accepts]: Start accepts. Automaton has 65232 states and 102017 transitions. Word has length 276 [2019-10-02 12:45:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:14,901 INFO L475 AbstractCegarLoop]: Abstraction has 65232 states and 102017 transitions. [2019-10-02 12:45:14,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 65232 states and 102017 transitions. [2019-10-02 12:45:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 12:45:14,951 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:14,952 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:14,952 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash 577325562, now seen corresponding path program 1 times [2019-10-02 12:45:14,952 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:14,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:14,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:45:15,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:15,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:45:15,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:45:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:45:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:45:15,175 INFO L87 Difference]: Start difference. First operand 65232 states and 102017 transitions. Second operand 6 states. [2019-10-02 12:45:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:19,006 INFO L93 Difference]: Finished difference Result 190038 states and 305747 transitions. [2019-10-02 12:45:19,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:45:19,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 278 [2019-10-02 12:45:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:19,546 INFO L225 Difference]: With dead ends: 190038 [2019-10-02 12:45:19,546 INFO L226 Difference]: Without dead ends: 131735 [2019-10-02 12:45:23,001 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:45:23,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131735 states. [2019-10-02 12:45:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131735 to 130732. [2019-10-02 12:45:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130732 states. [2019-10-02 12:45:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130732 states to 130732 states and 204457 transitions. [2019-10-02 12:45:27,905 INFO L78 Accepts]: Start accepts. Automaton has 130732 states and 204457 transitions. Word has length 278 [2019-10-02 12:45:27,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:27,906 INFO L475 AbstractCegarLoop]: Abstraction has 130732 states and 204457 transitions. [2019-10-02 12:45:27,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:45:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 130732 states and 204457 transitions. [2019-10-02 12:45:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 12:45:28,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:28,013 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:28,013 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:28,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1308703698, now seen corresponding path program 1 times [2019-10-02 12:45:28,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:28,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:28,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:28,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:28,254 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:45:28,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:28,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:45:28,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:45:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:45:28,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:45:28,257 INFO L87 Difference]: Start difference. First operand 130732 states and 204457 transitions. Second operand 11 states. [2019-10-02 12:45:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:36,510 INFO L93 Difference]: Finished difference Result 252839 states and 406299 transitions. [2019-10-02 12:45:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:45:36,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 279 [2019-10-02 12:45:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:37,077 INFO L225 Difference]: With dead ends: 252839 [2019-10-02 12:45:37,077 INFO L226 Difference]: Without dead ends: 140532 [2019-10-02 12:45:37,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:45:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140532 states. [2019-10-02 12:45:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140532 to 139892. [2019-10-02 12:45:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139892 states. [2019-10-02 12:45:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139892 states to 139892 states and 221109 transitions. [2019-10-02 12:45:47,269 INFO L78 Accepts]: Start accepts. Automaton has 139892 states and 221109 transitions. Word has length 279 [2019-10-02 12:45:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:45:47,270 INFO L475 AbstractCegarLoop]: Abstraction has 139892 states and 221109 transitions. [2019-10-02 12:45:47,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:45:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 139892 states and 221109 transitions. [2019-10-02 12:45:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:45:47,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:45:47,359 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:45:47,359 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:45:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:45:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2134922381, now seen corresponding path program 1 times [2019-10-02 12:45:47,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:45:47,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:45:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:47,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:45:47,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:45:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:45:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:45:47,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:45:47,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:45:47,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:45:47,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:45:47,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:45:47,671 INFO L87 Difference]: Start difference. First operand 139892 states and 221109 transitions. Second operand 13 states. [2019-10-02 12:45:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:45:56,857 INFO L93 Difference]: Finished difference Result 268455 states and 441079 transitions. [2019-10-02 12:45:56,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:45:56,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2019-10-02 12:45:56,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:45:57,456 INFO L225 Difference]: With dead ends: 268455 [2019-10-02 12:45:57,456 INFO L226 Difference]: Without dead ends: 142332 [2019-10-02 12:45:57,761 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:45:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142332 states. [2019-10-02 12:46:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142332 to 141692. [2019-10-02 12:46:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141692 states. [2019-10-02 12:46:04,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141692 states to 141692 states and 223629 transitions. [2019-10-02 12:46:04,063 INFO L78 Accepts]: Start accepts. Automaton has 141692 states and 223629 transitions. Word has length 280 [2019-10-02 12:46:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:04,063 INFO L475 AbstractCegarLoop]: Abstraction has 141692 states and 223629 transitions. [2019-10-02 12:46:04,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:46:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 141692 states and 223629 transitions. [2019-10-02 12:46:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 12:46:05,027 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:05,028 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:05,028 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:05,028 INFO L82 PathProgramCache]: Analyzing trace with hash -811298620, now seen corresponding path program 1 times [2019-10-02 12:46:05,028 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:05,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:05,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:05,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:46:05,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:05,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:46:05,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:46:05,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:46:05,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:46:05,251 INFO L87 Difference]: Start difference. First operand 141692 states and 223629 transitions. Second operand 11 states. [2019-10-02 12:46:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:13,223 INFO L93 Difference]: Finished difference Result 265239 states and 428959 transitions. [2019-10-02 12:46:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:46:13,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 278 [2019-10-02 12:46:13,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:14,398 INFO L225 Difference]: With dead ends: 265239 [2019-10-02 12:46:14,399 INFO L226 Difference]: Without dead ends: 141972 [2019-10-02 12:46:14,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:46:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141972 states. [2019-10-02 12:46:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141972 to 140972. [2019-10-02 12:46:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140972 states. [2019-10-02 12:46:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140972 states to 140972 states and 221495 transitions. [2019-10-02 12:46:21,003 INFO L78 Accepts]: Start accepts. Automaton has 140972 states and 221495 transitions. Word has length 278 [2019-10-02 12:46:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:21,004 INFO L475 AbstractCegarLoop]: Abstraction has 140972 states and 221495 transitions. [2019-10-02 12:46:21,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:46:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 140972 states and 221495 transitions. [2019-10-02 12:46:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:46:21,095 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:21,096 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:21,096 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:21,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2104676520, now seen corresponding path program 1 times [2019-10-02 12:46:21,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:21,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 12:46:21,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:46:21,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:46:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:46:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:46:21,367 INFO L87 Difference]: Start difference. First operand 140972 states and 221495 transitions. Second operand 13 states. [2019-10-02 12:46:32,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:32,720 INFO L93 Difference]: Finished difference Result 269175 states and 441305 transitions. [2019-10-02 12:46:32,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:46:32,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2019-10-02 12:46:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:33,264 INFO L225 Difference]: With dead ends: 269175 [2019-10-02 12:46:33,265 INFO L226 Difference]: Without dead ends: 141972 [2019-10-02 12:46:33,546 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:46:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141972 states. [2019-10-02 12:46:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141972 to 140972. [2019-10-02 12:46:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140972 states. [2019-10-02 12:46:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140972 states to 140972 states and 220895 transitions. [2019-10-02 12:46:39,836 INFO L78 Accepts]: Start accepts. Automaton has 140972 states and 220895 transitions. Word has length 280 [2019-10-02 12:46:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:46:39,837 INFO L475 AbstractCegarLoop]: Abstraction has 140972 states and 220895 transitions. [2019-10-02 12:46:39,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:46:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 140972 states and 220895 transitions. [2019-10-02 12:46:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 12:46:39,928 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:46:39,929 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:46:39,929 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:46:39,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:46:39,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1515693877, now seen corresponding path program 1 times [2019-10-02 12:46:39,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:46:39,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:46:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:39,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:46:39,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:46:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:46:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:46:40,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:46:40,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:46:40,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:46:40,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:46:40,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:46:40,117 INFO L87 Difference]: Start difference. First operand 140972 states and 220895 transitions. Second operand 6 states. [2019-10-02 12:46:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:46:52,173 INFO L93 Difference]: Finished difference Result 406418 states and 651581 transitions. [2019-10-02 12:46:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:46:52,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 281 [2019-10-02 12:46:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:46:53,299 INFO L225 Difference]: With dead ends: 406418 [2019-10-02 12:46:53,300 INFO L226 Difference]: Without dead ends: 250685 [2019-10-02 12:46:53,691 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:46:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250685 states. [2019-10-02 12:47:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250685 to 249440. [2019-10-02 12:47:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249440 states. [2019-10-02 12:47:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249440 states to 249440 states and 391549 transitions. [2019-10-02 12:47:10,350 INFO L78 Accepts]: Start accepts. Automaton has 249440 states and 391549 transitions. Word has length 281 [2019-10-02 12:47:10,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:10,351 INFO L475 AbstractCegarLoop]: Abstraction has 249440 states and 391549 transitions. [2019-10-02 12:47:10,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:47:10,351 INFO L276 IsEmpty]: Start isEmpty. Operand 249440 states and 391549 transitions. [2019-10-02 12:47:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 12:47:10,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:10,501 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:10,501 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1523514862, now seen corresponding path program 1 times [2019-10-02 12:47:10,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:10,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:10,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:10,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:10,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:47:10,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:10,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:47:10,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:47:10,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:47:10,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:47:10,635 INFO L87 Difference]: Start difference. First operand 249440 states and 391549 transitions. Second operand 3 states. [2019-10-02 12:47:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:47:26,788 INFO L93 Difference]: Finished difference Result 514003 states and 810639 transitions. [2019-10-02 12:47:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:47:26,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 281 [2019-10-02 12:47:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:47:28,012 INFO L225 Difference]: With dead ends: 514003 [2019-10-02 12:47:28,012 INFO L226 Difference]: Without dead ends: 264650 [2019-10-02 12:47:28,523 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:47:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264650 states. [2019-10-02 12:47:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264650 to 264608. [2019-10-02 12:47:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264608 states. [2019-10-02 12:47:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264608 states to 264608 states and 418765 transitions. [2019-10-02 12:47:47,565 INFO L78 Accepts]: Start accepts. Automaton has 264608 states and 418765 transitions. Word has length 281 [2019-10-02 12:47:47,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:47:47,566 INFO L475 AbstractCegarLoop]: Abstraction has 264608 states and 418765 transitions. [2019-10-02 12:47:47,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:47:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 264608 states and 418765 transitions. [2019-10-02 12:47:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 12:47:47,768 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:47:47,768 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:47:47,768 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:47:47,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:47:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1949836234, now seen corresponding path program 1 times [2019-10-02 12:47:47,769 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:47:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:47:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:47:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:47:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:47:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 12:47:47,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:47:47,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:47:47,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:47:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:47:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:47:47,919 INFO L87 Difference]: Start difference. First operand 264608 states and 418765 transitions. Second operand 3 states. [2019-10-02 12:48:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:07,432 INFO L93 Difference]: Finished difference Result 558355 states and 889983 transitions. [2019-10-02 12:48:07,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:48:07,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-10-02 12:48:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:09,086 INFO L225 Difference]: With dead ends: 558355 [2019-10-02 12:48:09,087 INFO L226 Difference]: Without dead ends: 293834 [2019-10-02 12:48:09,577 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:48:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293834 states. [2019-10-02 12:48:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293834 to 293792. [2019-10-02 12:48:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293792 states. [2019-10-02 12:48:30,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293792 states to 293792 states and 470509 transitions. [2019-10-02 12:48:30,168 INFO L78 Accepts]: Start accepts. Automaton has 293792 states and 470509 transitions. Word has length 282 [2019-10-02 12:48:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:48:30,168 INFO L475 AbstractCegarLoop]: Abstraction has 293792 states and 470509 transitions. [2019-10-02 12:48:30,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:48:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 293792 states and 470509 transitions. [2019-10-02 12:48:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 12:48:30,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:48:30,492 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:48:30,493 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:48:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:48:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 490091854, now seen corresponding path program 1 times [2019-10-02 12:48:30,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:48:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:48:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:48:30,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:48:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:48:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:48:32,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:48:32,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 12:48:32,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 12:48:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 12:48:32,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-10-02 12:48:32,332 INFO L87 Difference]: Start difference. First operand 293792 states and 470509 transitions. Second operand 30 states. [2019-10-02 12:48:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:48:51,526 INFO L93 Difference]: Finished difference Result 518940 states and 827458 transitions. [2019-10-02 12:48:51,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:48:51,527 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 283 [2019-10-02 12:48:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:48:52,823 INFO L225 Difference]: With dead ends: 518940 [2019-10-02 12:48:52,823 INFO L226 Difference]: Without dead ends: 303093 [2019-10-02 12:48:53,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:48:54,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303093 states. [2019-10-02 12:49:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303093 to 302292. [2019-10-02 12:49:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302292 states. [2019-10-02 12:49:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302292 states to 302292 states and 482039 transitions. [2019-10-02 12:49:15,413 INFO L78 Accepts]: Start accepts. Automaton has 302292 states and 482039 transitions. Word has length 283 [2019-10-02 12:49:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:15,414 INFO L475 AbstractCegarLoop]: Abstraction has 302292 states and 482039 transitions. [2019-10-02 12:49:15,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 12:49:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 302292 states and 482039 transitions. [2019-10-02 12:49:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:49:15,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:15,729 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:15,729 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2120362568, now seen corresponding path program 1 times [2019-10-02 12:49:15,730 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:15,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:49:15,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:15,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:49:15,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:49:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:49:15,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:49:15,879 INFO L87 Difference]: Start difference. First operand 302292 states and 482039 transitions. Second operand 5 states. [2019-10-02 12:49:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:49:35,801 INFO L93 Difference]: Finished difference Result 538643 states and 859317 transitions. [2019-10-02 12:49:35,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:49:35,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 280 [2019-10-02 12:49:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:49:37,358 INFO L225 Difference]: With dead ends: 538643 [2019-10-02 12:49:37,359 INFO L226 Difference]: Without dead ends: 307850 [2019-10-02 12:49:37,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:49:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307850 states. [2019-10-02 12:49:51,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307850 to 305092. [2019-10-02 12:49:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305092 states. [2019-10-02 12:49:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305092 states to 305092 states and 485945 transitions. [2019-10-02 12:49:53,631 INFO L78 Accepts]: Start accepts. Automaton has 305092 states and 485945 transitions. Word has length 280 [2019-10-02 12:49:53,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:49:53,632 INFO L475 AbstractCegarLoop]: Abstraction has 305092 states and 485945 transitions. [2019-10-02 12:49:53,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:49:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 305092 states and 485945 transitions. [2019-10-02 12:49:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 12:49:53,950 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:49:53,950 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:49:53,951 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:49:53,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:49:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1338137984, now seen corresponding path program 1 times [2019-10-02 12:49:53,951 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:49:53,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:49:53,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:53,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:49:53,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:49:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:49:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:49:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:49:54,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:49:54,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:49:54,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:49:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:49:54,172 INFO L87 Difference]: Start difference. First operand 305092 states and 485945 transitions. Second operand 13 states. [2019-10-02 12:50:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:50:14,597 INFO L93 Difference]: Finished difference Result 538461 states and 848327 transitions. [2019-10-02 12:50:14,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:50:14,597 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 280 [2019-10-02 12:50:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:50:16,484 INFO L225 Difference]: With dead ends: 538461 [2019-10-02 12:50:16,485 INFO L226 Difference]: Without dead ends: 304868 [2019-10-02 12:50:16,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:50:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304868 states. [2019-10-02 12:50:42,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304868 to 304308. [2019-10-02 12:50:42,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304308 states. [2019-10-02 12:50:43,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304308 states to 304308 states and 484461 transitions. [2019-10-02 12:50:44,017 INFO L78 Accepts]: Start accepts. Automaton has 304308 states and 484461 transitions. Word has length 280 [2019-10-02 12:50:44,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:50:44,017 INFO L475 AbstractCegarLoop]: Abstraction has 304308 states and 484461 transitions. [2019-10-02 12:50:44,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:50:44,017 INFO L276 IsEmpty]: Start isEmpty. Operand 304308 states and 484461 transitions. [2019-10-02 12:50:44,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-02 12:50:44,320 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:50:44,321 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:50:44,321 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:50:44,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:50:44,321 INFO L82 PathProgramCache]: Analyzing trace with hash 682083082, now seen corresponding path program 1 times [2019-10-02 12:50:44,321 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:50:44,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:50:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:44,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:50:44,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:50:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:50:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:50:44,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:50:44,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:50:44,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:50:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:50:44,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:50:44,520 INFO L87 Difference]: Start difference. First operand 304308 states and 484461 transitions. Second operand 10 states. [2019-10-02 12:51:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:01,800 INFO L93 Difference]: Finished difference Result 305151 states and 485723 transitions. [2019-10-02 12:51:01,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:51:01,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 287 [2019-10-02 12:51:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:03,140 INFO L225 Difference]: With dead ends: 305151 [2019-10-02 12:51:03,140 INFO L226 Difference]: Without dead ends: 305148 [2019-10-02 12:51:03,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:51:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305148 states. [2019-10-02 12:51:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305148 to 305148. [2019-10-02 12:51:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305148 states. [2019-10-02 12:51:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305148 states to 305148 states and 485171 transitions. [2019-10-02 12:51:21,011 INFO L78 Accepts]: Start accepts. Automaton has 305148 states and 485171 transitions. Word has length 287 [2019-10-02 12:51:21,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:51:21,012 INFO L475 AbstractCegarLoop]: Abstraction has 305148 states and 485171 transitions. [2019-10-02 12:51:21,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:51:21,012 INFO L276 IsEmpty]: Start isEmpty. Operand 305148 states and 485171 transitions. [2019-10-02 12:51:21,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-10-02 12:51:21,292 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:51:21,292 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:51:21,292 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:51:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:51:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1463894383, now seen corresponding path program 1 times [2019-10-02 12:51:21,293 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:51:21,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:51:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:21,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:51:21,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:51:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:51:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 12:51:21,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:51:21,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:51:21,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:51:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:51:21,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:51:21,452 INFO L87 Difference]: Start difference. First operand 305148 states and 485171 transitions. Second operand 6 states. [2019-10-02 12:51:50,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:51:50,638 INFO L93 Difference]: Finished difference Result 846784 states and 1358431 transitions. [2019-10-02 12:51:50,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:51:50,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 285 [2019-10-02 12:51:50,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:51:53,559 INFO L225 Difference]: With dead ends: 846784 [2019-10-02 12:51:53,559 INFO L226 Difference]: Without dead ends: 613135 [2019-10-02 12:51:55,267 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:51:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613135 states. [2019-10-02 12:52:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613135 to 607350. [2019-10-02 12:52:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607350 states. [2019-10-02 12:52:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607350 states to 607350 states and 974715 transitions. [2019-10-02 12:52:58,660 INFO L78 Accepts]: Start accepts. Automaton has 607350 states and 974715 transitions. Word has length 285 [2019-10-02 12:52:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:52:58,660 INFO L475 AbstractCegarLoop]: Abstraction has 607350 states and 974715 transitions. [2019-10-02 12:52:58,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:52:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 607350 states and 974715 transitions. [2019-10-02 12:52:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 12:52:59,514 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:52:59,514 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:52:59,514 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:52:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:52:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 152020290, now seen corresponding path program 1 times [2019-10-02 12:52:59,515 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:52:59,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:52:59,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:59,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:52:59,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:52:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:52:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:52:59,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:52:59,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:52:59,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:52:59,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:52:59,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:52:59,708 INFO L87 Difference]: Start difference. First operand 607350 states and 974715 transitions. Second operand 8 states.