java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec8_product16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:40:02,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:40:02,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:40:02,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:40:02,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:40:02,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:40:02,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:40:02,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:40:02,614 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:40:02,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:40:02,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:40:02,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:40:02,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:40:02,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:40:02,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:40:02,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:40:02,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:40:02,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:40:02,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:40:02,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:40:02,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:40:02,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:40:02,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:40:02,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:40:02,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:40:02,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:40:02,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:40:02,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:40:02,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:40:02,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:40:02,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:40:02,647 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:40:02,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:40:02,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:40:02,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:40:02,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:40:02,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:40:02,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:40:02,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:40:02,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:40:02,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:40:02,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:40:02,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:40:02,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:40:02,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:40:02,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:40:02,668 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:40:02,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:40:02,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:40:02,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:40:02,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:40:02,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:40:02,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:40:02,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:40:02,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:40:02,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:40:02,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:40:02,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:40:02,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:40:02,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:40:02,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:40:02,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:40:02,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:40:02,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:40:02,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:40:02,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:40:02,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:40:02,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:40:02,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:40:02,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:40:02,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:40:02,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:40:02,725 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:40:02,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:40:02,732 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:40:02,733 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:40:02,734 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec8_product16.cil.c [2019-09-08 05:40:02,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42e386e0/3df85928b6c64dc4a965994a736c3064/FLAGa6907cd9b [2019-09-08 05:40:03,438 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:40:03,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec8_product16.cil.c [2019-09-08 05:40:03,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42e386e0/3df85928b6c64dc4a965994a736c3064/FLAGa6907cd9b [2019-09-08 05:40:03,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42e386e0/3df85928b6c64dc4a965994a736c3064 [2019-09-08 05:40:03,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:40:03,673 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:40:03,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:40:03,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:40:03,677 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:40:03,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:40:03" (1/1) ... [2019-09-08 05:40:03,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78da3abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:03, skipping insertion in model container [2019-09-08 05:40:03,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:40:03" (1/1) ... [2019-09-08 05:40:03,692 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:40:03,774 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:40:04,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:40:04,591 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:40:04,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:40:04,791 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:40:04,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04 WrapperNode [2019-09-08 05:40:04,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:40:04,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:40:04,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:40:04,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:40:04,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... [2019-09-08 05:40:04,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:40:04,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:40:04,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:40:04,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:40:04,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:40:05,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:40:05,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:40:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:40:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:40:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:40:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:40:05,029 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:40:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:40:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:40:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:40:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:40:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:40:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:40:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:40:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:40:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:40:05,031 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:40:05,032 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:40:05,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:40:05,033 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:40:05,034 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:40:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:40:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:40:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:40:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:40:05,035 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:40:05,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:40:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:40:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:40:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:40:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:40:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:40:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:40:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:40:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:40:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:40:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:40:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:40:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:40:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:40:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:40:05,039 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:40:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:40:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:40:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:40:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:40:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:40:05,040 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:40:05,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:40:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:40:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:40:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:40:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:40:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:40:05,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:40:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:40:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:40:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:40:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:40:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:40:05,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:40:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:40:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:40:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:40:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:40:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:40:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:40:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:40:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:40:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:40:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:40:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:40:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:40:05,046 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:40:05,047 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:40:05,048 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:40:05,048 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:40:05,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:40:05,048 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:40:05,048 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:40:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:40:05,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:40:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:40:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:40:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:40:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:40:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:40:05,049 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:40:05,050 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:40:05,051 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:40:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:40:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:40:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:40:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:40:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:40:05,052 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:40:05,053 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:40:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:40:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:40:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:40:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:40:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:40:05,054 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:40:05,055 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:40:05,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:40:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:40:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:40:05,059 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:40:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:40:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:40:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:40:05,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__1 [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptAutoResponder_spec__2 [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:40:05,064 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:40:05,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:40:05,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:40:07,032 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:40:07,033 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:40:07,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:40:07 BoogieIcfgContainer [2019-09-08 05:40:07,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:40:07,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:40:07,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:40:07,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:40:07,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:40:03" (1/3) ... [2019-09-08 05:40:07,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2ec2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:40:07, skipping insertion in model container [2019-09-08 05:40:07,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:40:04" (2/3) ... [2019-09-08 05:40:07,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2ec2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:40:07, skipping insertion in model container [2019-09-08 05:40:07,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:40:07" (3/3) ... [2019-09-08 05:40:07,044 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec8_product16.cil.c [2019-09-08 05:40:07,054 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:40:07,066 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:40:07,085 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:40:07,139 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:40:07,140 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:40:07,140 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:40:07,140 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:40:07,140 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:40:07,140 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:40:07,140 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:40:07,141 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:40:07,141 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:40:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states. [2019-09-08 05:40:07,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 05:40:07,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:07,200 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:07,204 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1079816034, now seen corresponding path program 1 times [2019-09-08 05:40:07,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:07,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:07,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:07,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:07,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:40:07,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:07,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:40:07,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:40:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:40:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:40:07,905 INFO L87 Difference]: Start difference. First operand 480 states. Second operand 2 states. [2019-09-08 05:40:07,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:07,989 INFO L93 Difference]: Finished difference Result 702 states and 921 transitions. [2019-09-08 05:40:07,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:40:07,991 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 145 [2019-09-08 05:40:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:08,031 INFO L225 Difference]: With dead ends: 702 [2019-09-08 05:40:08,032 INFO L226 Difference]: Without dead ends: 457 [2019-09-08 05:40:08,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:40:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-08 05:40:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 457. [2019-09-08 05:40:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-09-08 05:40:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 605 transitions. [2019-09-08 05:40:08,203 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 605 transitions. Word has length 145 [2019-09-08 05:40:08,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:08,206 INFO L475 AbstractCegarLoop]: Abstraction has 457 states and 605 transitions. [2019-09-08 05:40:08,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:40:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 605 transitions. [2019-09-08 05:40:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 05:40:08,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:08,224 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:08,225 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:08,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1252139373, now seen corresponding path program 1 times [2019-09-08 05:40:08,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:08,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:08,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:40:08,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:08,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:08,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:08,622 INFO L87 Difference]: Start difference. First operand 457 states and 605 transitions. Second operand 3 states. [2019-09-08 05:40:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:08,671 INFO L93 Difference]: Finished difference Result 685 states and 890 transitions. [2019-09-08 05:40:08,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:08,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-08 05:40:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:08,677 INFO L225 Difference]: With dead ends: 685 [2019-09-08 05:40:08,677 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 05:40:08,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 05:40:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2019-09-08 05:40:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-09-08 05:40:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 607 transitions. [2019-09-08 05:40:08,701 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 607 transitions. Word has length 146 [2019-09-08 05:40:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:08,702 INFO L475 AbstractCegarLoop]: Abstraction has 459 states and 607 transitions. [2019-09-08 05:40:08,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 607 transitions. [2019-09-08 05:40:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 05:40:08,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:08,705 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:08,706 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:08,706 INFO L82 PathProgramCache]: Analyzing trace with hash -88146113, now seen corresponding path program 1 times [2019-09-08 05:40:08,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:08,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:08,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:08,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:08,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:40:08,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:08,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:08,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:08,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:08,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:08,853 INFO L87 Difference]: Start difference. First operand 459 states and 607 transitions. Second operand 3 states. [2019-09-08 05:40:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:08,895 INFO L93 Difference]: Finished difference Result 894 states and 1212 transitions. [2019-09-08 05:40:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:08,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-09-08 05:40:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:08,901 INFO L225 Difference]: With dead ends: 894 [2019-09-08 05:40:08,901 INFO L226 Difference]: Without dead ends: 500 [2019-09-08 05:40:08,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:08,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-08 05:40:08,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 499. [2019-09-08 05:40:08,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-08 05:40:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 676 transitions. [2019-09-08 05:40:08,930 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 676 transitions. Word has length 152 [2019-09-08 05:40:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:08,932 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 676 transitions. [2019-09-08 05:40:08,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 676 transitions. [2019-09-08 05:40:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 05:40:08,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:08,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:08,936 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash -981912952, now seen corresponding path program 1 times [2019-09-08 05:40:08,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:08,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:08,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:40:09,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:09,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:40:09,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:40:09,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:40:09,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:09,183 INFO L87 Difference]: Start difference. First operand 499 states and 676 transitions. Second operand 3 states. [2019-09-08 05:40:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:09,226 INFO L93 Difference]: Finished difference Result 788 states and 1053 transitions. [2019-09-08 05:40:09,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:40:09,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 05:40:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:09,237 INFO L225 Difference]: With dead ends: 788 [2019-09-08 05:40:09,237 INFO L226 Difference]: Without dead ends: 565 [2019-09-08 05:40:09,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:40:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-09-08 05:40:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-09-08 05:40:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-08 05:40:09,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 764 transitions. [2019-09-08 05:40:09,290 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 764 transitions. Word has length 153 [2019-09-08 05:40:09,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:09,291 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 764 transitions. [2019-09-08 05:40:09,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:40:09,291 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 764 transitions. [2019-09-08 05:40:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-08 05:40:09,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:09,300 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:09,300 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:09,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash -766929263, now seen corresponding path program 1 times [2019-09-08 05:40:09,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:09,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:09,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:09,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:09,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 05:40:09,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:40:09,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:40:09,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:40:10,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:10,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:40:10,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:40:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:40:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:40:10,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [22] total 29 [2019-09-08 05:40:10,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 05:40:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 05:40:10,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=746, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:40:10,874 INFO L87 Difference]: Start difference. First operand 565 states and 764 transitions. Second operand 29 states. [2019-09-08 05:40:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:36,467 INFO L93 Difference]: Finished difference Result 2780 states and 3793 transitions. [2019-09-08 05:40:36,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-09-08 05:40:36,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 260 [2019-09-08 05:40:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:36,482 INFO L225 Difference]: With dead ends: 2780 [2019-09-08 05:40:36,483 INFO L226 Difference]: Without dead ends: 2245 [2019-09-08 05:40:36,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5340 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1357, Invalid=15935, Unknown=0, NotChecked=0, Total=17292 [2019-09-08 05:40:36,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-09-08 05:40:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1942. [2019-09-08 05:40:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-09-08 05:40:36,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2652 transitions. [2019-09-08 05:40:36,635 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2652 transitions. Word has length 260 [2019-09-08 05:40:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:36,638 INFO L475 AbstractCegarLoop]: Abstraction has 1942 states and 2652 transitions. [2019-09-08 05:40:36,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 05:40:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2652 transitions. [2019-09-08 05:40:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-08 05:40:36,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:36,649 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:36,649 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:36,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1380535270, now seen corresponding path program 1 times [2019-09-08 05:40:36,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:36,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:36,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:36,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:36,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 05:40:36,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:36,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:40:36,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:40:36,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:40:36,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:40:36,871 INFO L87 Difference]: Start difference. First operand 1942 states and 2652 transitions. Second operand 5 states. [2019-09-08 05:40:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:36,971 INFO L93 Difference]: Finished difference Result 3146 states and 4205 transitions. [2019-09-08 05:40:36,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:40:36,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265 [2019-09-08 05:40:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:36,983 INFO L225 Difference]: With dead ends: 3146 [2019-09-08 05:40:36,984 INFO L226 Difference]: Without dead ends: 1890 [2019-09-08 05:40:36,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:40:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2019-09-08 05:40:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1880. [2019-09-08 05:40:37,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1880 states. [2019-09-08 05:40:37,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2554 transitions. [2019-09-08 05:40:37,078 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2554 transitions. Word has length 265 [2019-09-08 05:40:37,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:37,079 INFO L475 AbstractCegarLoop]: Abstraction has 1880 states and 2554 transitions. [2019-09-08 05:40:37,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:40:37,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2554 transitions. [2019-09-08 05:40:37,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 05:40:37,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:37,089 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:37,089 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1662913944, now seen corresponding path program 1 times [2019-09-08 05:40:37,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:37,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:37,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:37,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:37,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 05:40:37,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:40:37,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:40:37,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:38,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 2937 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:40:38,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:40:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 05:40:38,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:40:38,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [18] total 23 [2019-09-08 05:40:38,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 05:40:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 05:40:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-09-08 05:40:38,407 INFO L87 Difference]: Start difference. First operand 1880 states and 2554 transitions. Second operand 23 states. [2019-09-08 05:40:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:58,163 INFO L93 Difference]: Finished difference Result 4162 states and 5675 transitions. [2019-09-08 05:40:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-09-08 05:40:58,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 262 [2019-09-08 05:40:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:58,180 INFO L225 Difference]: With dead ends: 4162 [2019-09-08 05:40:58,180 INFO L226 Difference]: Without dead ends: 2329 [2019-09-08 05:40:58,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4310 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1185, Invalid=12621, Unknown=0, NotChecked=0, Total=13806 [2019-09-08 05:40:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2019-09-08 05:40:58,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1884. [2019-09-08 05:40:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2019-09-08 05:40:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2559 transitions. [2019-09-08 05:40:58,298 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 2559 transitions. Word has length 262 [2019-09-08 05:40:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:40:58,299 INFO L475 AbstractCegarLoop]: Abstraction has 1884 states and 2559 transitions. [2019-09-08 05:40:58,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 05:40:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 2559 transitions. [2019-09-08 05:40:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 05:40:58,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:58,310 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:58,311 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:58,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:58,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1712123979, now seen corresponding path program 1 times [2019-09-08 05:40:58,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:58,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:58,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:58,602 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:40:58,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:40:58,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:40:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:59,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 2938 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:40:59,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:40:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 05:40:59,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:40:59,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 21 [2019-09-08 05:40:59,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:40:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:40:59,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:40:59,611 INFO L87 Difference]: Start difference. First operand 1884 states and 2559 transitions. Second operand 21 states. [2019-09-08 05:41:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:01,799 INFO L93 Difference]: Finished difference Result 3853 states and 5268 transitions. [2019-09-08 05:41:01,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:41:01,800 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 263 [2019-09-08 05:41:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:01,813 INFO L225 Difference]: With dead ends: 3853 [2019-09-08 05:41:01,813 INFO L226 Difference]: Without dead ends: 1921 [2019-09-08 05:41:01,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:41:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2019-09-08 05:41:01,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1851. [2019-09-08 05:41:01,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1851 states. [2019-09-08 05:41:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 2488 transitions. [2019-09-08 05:41:01,914 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 2488 transitions. Word has length 263 [2019-09-08 05:41:01,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:01,915 INFO L475 AbstractCegarLoop]: Abstraction has 1851 states and 2488 transitions. [2019-09-08 05:41:01,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:41:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 2488 transitions. [2019-09-08 05:41:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 05:41:01,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:01,924 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:01,925 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:01,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:01,925 INFO L82 PathProgramCache]: Analyzing trace with hash -90598132, now seen corresponding path program 1 times [2019-09-08 05:41:01,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:01,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:01,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:01,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-08 05:41:02,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:41:02,281 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:41:02,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:41:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:02,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 2939 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:41:02,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:41:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 05:41:03,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:41:03,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2019-09-08 05:41:03,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:41:03,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:41:03,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:41:03,197 INFO L87 Difference]: Start difference. First operand 1851 states and 2488 transitions. Second operand 16 states. [2019-09-08 05:41:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:06,411 INFO L93 Difference]: Finished difference Result 3692 states and 4981 transitions. [2019-09-08 05:41:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:41:06,414 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 264 [2019-09-08 05:41:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:06,424 INFO L225 Difference]: With dead ends: 3692 [2019-09-08 05:41:06,425 INFO L226 Difference]: Without dead ends: 1882 [2019-09-08 05:41:06,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-09-08 05:41:06,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-09-08 05:41:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1845. [2019-09-08 05:41:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1845 states. [2019-09-08 05:41:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2467 transitions. [2019-09-08 05:41:06,521 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2467 transitions. Word has length 264 [2019-09-08 05:41:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:06,522 INFO L475 AbstractCegarLoop]: Abstraction has 1845 states and 2467 transitions. [2019-09-08 05:41:06,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:41:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2467 transitions. [2019-09-08 05:41:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 05:41:06,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:06,534 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:06,534 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash 946843307, now seen corresponding path program 1 times [2019-09-08 05:41:06,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:06,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:06,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:06,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:06,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:06,732 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 05:41:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:41:06,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:41:06,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:41:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:07,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 2942 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:41:07,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:41:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:41:07,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:41:07,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-09-08 05:41:07,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:41:07,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:41:07,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:41:07,446 INFO L87 Difference]: Start difference. First operand 1845 states and 2467 transitions. Second operand 10 states. [2019-09-08 05:41:11,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:11,374 INFO L93 Difference]: Finished difference Result 5138 states and 6871 transitions. [2019-09-08 05:41:11,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 05:41:11,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 267 [2019-09-08 05:41:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:11,404 INFO L225 Difference]: With dead ends: 5138 [2019-09-08 05:41:11,404 INFO L226 Difference]: Without dead ends: 3369 [2019-09-08 05:41:11,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-09-08 05:41:11,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2019-09-08 05:41:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3162. [2019-09-08 05:41:11,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3162 states. [2019-09-08 05:41:11,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 4217 transitions. [2019-09-08 05:41:11,574 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 4217 transitions. Word has length 267 [2019-09-08 05:41:11,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:11,574 INFO L475 AbstractCegarLoop]: Abstraction has 3162 states and 4217 transitions. [2019-09-08 05:41:11,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:41:11,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 4217 transitions. [2019-09-08 05:41:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 05:41:11,589 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:11,589 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:11,589 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash -132339523, now seen corresponding path program 1 times [2019-09-08 05:41:11,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:11,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:11,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:11,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-08 05:41:11,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:11,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:41:11,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:41:11,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:41:11,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:41:11,957 INFO L87 Difference]: Start difference. First operand 3162 states and 4217 transitions. Second operand 11 states. [2019-09-08 05:41:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:15,684 INFO L93 Difference]: Finished difference Result 4298 states and 5625 transitions. [2019-09-08 05:41:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:41:15,687 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 266 [2019-09-08 05:41:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:15,708 INFO L225 Difference]: With dead ends: 4298 [2019-09-08 05:41:15,708 INFO L226 Difference]: Without dead ends: 3338 [2019-09-08 05:41:15,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:41:15,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2019-09-08 05:41:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2698. [2019-09-08 05:41:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2698 states. [2019-09-08 05:41:15,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2698 states to 2698 states and 3569 transitions. [2019-09-08 05:41:15,872 INFO L78 Accepts]: Start accepts. Automaton has 2698 states and 3569 transitions. Word has length 266 [2019-09-08 05:41:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:15,873 INFO L475 AbstractCegarLoop]: Abstraction has 2698 states and 3569 transitions. [2019-09-08 05:41:15,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:41:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2698 states and 3569 transitions. [2019-09-08 05:41:15,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 05:41:15,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:15,885 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:15,885 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:15,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:15,886 INFO L82 PathProgramCache]: Analyzing trace with hash -971141918, now seen corresponding path program 1 times [2019-09-08 05:41:15,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:15,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:15,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:15,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:41:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:41:16,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:41:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:41:16,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:16,184 INFO L87 Difference]: Start difference. First operand 2698 states and 3569 transitions. Second operand 9 states. [2019-09-08 05:41:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:16,511 INFO L93 Difference]: Finished difference Result 3229 states and 4286 transitions. [2019-09-08 05:41:16,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:41:16,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 332 [2019-09-08 05:41:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:16,539 INFO L225 Difference]: With dead ends: 3229 [2019-09-08 05:41:16,539 INFO L226 Difference]: Without dead ends: 2859 [2019-09-08 05:41:16,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:41:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-09-08 05:41:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2839. [2019-09-08 05:41:16,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2839 states. [2019-09-08 05:41:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3784 transitions. [2019-09-08 05:41:16,754 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3784 transitions. Word has length 332 [2019-09-08 05:41:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:16,758 INFO L475 AbstractCegarLoop]: Abstraction has 2839 states and 3784 transitions. [2019-09-08 05:41:16,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:41:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3784 transitions. [2019-09-08 05:41:16,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-09-08 05:41:16,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:16,777 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:16,777 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1777983184, now seen corresponding path program 1 times [2019-09-08 05:41:16,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:16,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:41:17,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:17,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:41:17,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:41:17,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:41:17,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:41:17,119 INFO L87 Difference]: Start difference. First operand 2839 states and 3784 transitions. Second operand 7 states. [2019-09-08 05:41:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:19,094 INFO L93 Difference]: Finished difference Result 7215 states and 9443 transitions. [2019-09-08 05:41:19,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:41:19,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 329 [2019-09-08 05:41:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:19,163 INFO L225 Difference]: With dead ends: 7215 [2019-09-08 05:41:19,164 INFO L226 Difference]: Without dead ends: 6187 [2019-09-08 05:41:19,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:41:19,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6187 states. [2019-09-08 05:41:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6187 to 5600. [2019-09-08 05:41:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2019-09-08 05:41:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 7395 transitions. [2019-09-08 05:41:19,633 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 7395 transitions. Word has length 329 [2019-09-08 05:41:19,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:19,634 INFO L475 AbstractCegarLoop]: Abstraction has 5600 states and 7395 transitions. [2019-09-08 05:41:19,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:41:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 7395 transitions. [2019-09-08 05:41:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 05:41:19,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:19,670 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:19,671 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:19,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1784970270, now seen corresponding path program 1 times [2019-09-08 05:41:19,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:19,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:19,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:19,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:19,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:41:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:41:20,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:41:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:41:20,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:20,231 INFO L87 Difference]: Start difference. First operand 5600 states and 7395 transitions. Second operand 9 states. [2019-09-08 05:41:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:20,648 INFO L93 Difference]: Finished difference Result 5997 states and 7904 transitions. [2019-09-08 05:41:20,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:41:20,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 330 [2019-09-08 05:41:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:20,683 INFO L225 Difference]: With dead ends: 5997 [2019-09-08 05:41:20,684 INFO L226 Difference]: Without dead ends: 5614 [2019-09-08 05:41:20,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:41:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5614 states. [2019-09-08 05:41:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5614 to 5600. [2019-09-08 05:41:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2019-09-08 05:41:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 7379 transitions. [2019-09-08 05:41:21,118 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 7379 transitions. Word has length 330 [2019-09-08 05:41:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:21,119 INFO L475 AbstractCegarLoop]: Abstraction has 5600 states and 7379 transitions. [2019-09-08 05:41:21,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:41:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 7379 transitions. [2019-09-08 05:41:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 05:41:21,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:21,152 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:21,152 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:21,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:21,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1996263458, now seen corresponding path program 1 times [2019-09-08 05:41:21,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:21,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:21,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:21,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:21,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:41:21,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:21,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:41:21,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:41:21,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:41:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:41:21,494 INFO L87 Difference]: Start difference. First operand 5600 states and 7379 transitions. Second operand 7 states. [2019-09-08 05:41:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:23,953 INFO L93 Difference]: Finished difference Result 14503 states and 18765 transitions. [2019-09-08 05:41:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:41:23,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 331 [2019-09-08 05:41:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:24,024 INFO L225 Difference]: With dead ends: 14503 [2019-09-08 05:41:24,024 INFO L226 Difference]: Without dead ends: 12807 [2019-09-08 05:41:24,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:41:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12807 states. [2019-09-08 05:41:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12807 to 12055. [2019-09-08 05:41:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12055 states. [2019-09-08 05:41:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12055 states to 12055 states and 15760 transitions. [2019-09-08 05:41:24,666 INFO L78 Accepts]: Start accepts. Automaton has 12055 states and 15760 transitions. Word has length 331 [2019-09-08 05:41:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:24,667 INFO L475 AbstractCegarLoop]: Abstraction has 12055 states and 15760 transitions. [2019-09-08 05:41:24,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:41:24,667 INFO L276 IsEmpty]: Start isEmpty. Operand 12055 states and 15760 transitions. [2019-09-08 05:41:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 05:41:24,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:24,727 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:24,727 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:24,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1048434086, now seen corresponding path program 1 times [2019-09-08 05:41:24,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:24,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:24,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:41:25,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:25,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:41:25,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:41:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:41:25,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:41:25,021 INFO L87 Difference]: Start difference. First operand 12055 states and 15760 transitions. Second operand 9 states. [2019-09-08 05:41:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:25,496 INFO L93 Difference]: Finished difference Result 12648 states and 16506 transitions. [2019-09-08 05:41:25,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:41:25,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 333 [2019-09-08 05:41:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:25,545 INFO L225 Difference]: With dead ends: 12648 [2019-09-08 05:41:25,545 INFO L226 Difference]: Without dead ends: 12059 [2019-09-08 05:41:25,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:41:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12059 states. [2019-09-08 05:41:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12059 to 12025. [2019-09-08 05:41:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12025 states. [2019-09-08 05:41:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12025 states to 12025 states and 15679 transitions. [2019-09-08 05:41:26,258 INFO L78 Accepts]: Start accepts. Automaton has 12025 states and 15679 transitions. Word has length 333 [2019-09-08 05:41:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:26,258 INFO L475 AbstractCegarLoop]: Abstraction has 12025 states and 15679 transitions. [2019-09-08 05:41:26,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:41:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 12025 states and 15679 transitions. [2019-09-08 05:41:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 05:41:26,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:26,297 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:26,297 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1381918946, now seen corresponding path program 1 times [2019-09-08 05:41:26,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:26,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:26,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 05:41:26,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:26,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:41:26,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:41:26,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:41:26,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:41:26,508 INFO L87 Difference]: Start difference. First operand 12025 states and 15679 transitions. Second operand 7 states. [2019-09-08 05:41:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:29,648 INFO L93 Difference]: Finished difference Result 26136 states and 33879 transitions. [2019-09-08 05:41:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:41:29,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 334 [2019-09-08 05:41:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:29,711 INFO L225 Difference]: With dead ends: 26136 [2019-09-08 05:41:29,711 INFO L226 Difference]: Without dead ends: 21651 [2019-09-08 05:41:29,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:41:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21651 states. [2019-09-08 05:41:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21651 to 20559. [2019-09-08 05:41:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20559 states. [2019-09-08 05:41:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20559 states to 20559 states and 27085 transitions. [2019-09-08 05:41:30,719 INFO L78 Accepts]: Start accepts. Automaton has 20559 states and 27085 transitions. Word has length 334 [2019-09-08 05:41:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:30,719 INFO L475 AbstractCegarLoop]: Abstraction has 20559 states and 27085 transitions. [2019-09-08 05:41:30,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:41:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20559 states and 27085 transitions. [2019-09-08 05:41:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 05:41:30,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:30,785 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:30,785 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:30,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1606088021, now seen corresponding path program 1 times [2019-09-08 05:41:30,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:30,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:30,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:30,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:41:30,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:30,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:30,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:30,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:30,968 INFO L87 Difference]: Start difference. First operand 20559 states and 27085 transitions. Second operand 3 states. [2019-09-08 05:41:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:31,610 INFO L93 Difference]: Finished difference Result 42996 states and 57722 transitions. [2019-09-08 05:41:31,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:31,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-09-08 05:41:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:31,691 INFO L225 Difference]: With dead ends: 42996 [2019-09-08 05:41:31,692 INFO L226 Difference]: Without dead ends: 22524 [2019-09-08 05:41:31,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:31,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22524 states. [2019-09-08 05:41:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22524 to 22503. [2019-09-08 05:41:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22503 states. [2019-09-08 05:41:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22503 states to 22503 states and 30667 transitions. [2019-09-08 05:41:32,744 INFO L78 Accepts]: Start accepts. Automaton has 22503 states and 30667 transitions. Word has length 345 [2019-09-08 05:41:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:32,745 INFO L475 AbstractCegarLoop]: Abstraction has 22503 states and 30667 transitions. [2019-09-08 05:41:32,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 22503 states and 30667 transitions. [2019-09-08 05:41:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-09-08 05:41:32,807 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:32,807 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:32,808 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:32,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:32,808 INFO L82 PathProgramCache]: Analyzing trace with hash -128190020, now seen corresponding path program 1 times [2019-09-08 05:41:32,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:32,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:32,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:32,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:32,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:41:33,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:33,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:33,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:33,183 INFO L87 Difference]: Start difference. First operand 22503 states and 30667 transitions. Second operand 3 states. [2019-09-08 05:41:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:33,785 INFO L93 Difference]: Finished difference Result 48588 states and 68084 transitions. [2019-09-08 05:41:33,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:33,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2019-09-08 05:41:33,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:33,893 INFO L225 Difference]: With dead ends: 48588 [2019-09-08 05:41:33,893 INFO L226 Difference]: Without dead ends: 26172 [2019-09-08 05:41:33,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26172 states. [2019-09-08 05:41:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26172 to 26151. [2019-09-08 05:41:35,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26151 states. [2019-09-08 05:41:35,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26151 states to 26151 states and 37399 transitions. [2019-09-08 05:41:35,249 INFO L78 Accepts]: Start accepts. Automaton has 26151 states and 37399 transitions. Word has length 343 [2019-09-08 05:41:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:35,249 INFO L475 AbstractCegarLoop]: Abstraction has 26151 states and 37399 transitions. [2019-09-08 05:41:35,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26151 states and 37399 transitions. [2019-09-08 05:41:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-09-08 05:41:35,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:35,309 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:35,309 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 320063059, now seen corresponding path program 1 times [2019-09-08 05:41:35,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:35,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:35,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:35,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:41:35,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:35,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:35,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:35,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:35,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:35,472 INFO L87 Difference]: Start difference. First operand 26151 states and 37399 transitions. Second operand 3 states. [2019-09-08 05:41:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:37,386 INFO L93 Difference]: Finished difference Result 59244 states and 87608 transitions. [2019-09-08 05:41:37,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:37,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-09-08 05:41:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:37,476 INFO L225 Difference]: With dead ends: 59244 [2019-09-08 05:41:37,476 INFO L226 Difference]: Without dead ends: 33180 [2019-09-08 05:41:37,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:37,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33180 states. [2019-09-08 05:41:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33180 to 33159. [2019-09-08 05:41:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33159 states. [2019-09-08 05:41:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33159 states to 33159 states and 50095 transitions. [2019-09-08 05:41:38,806 INFO L78 Accepts]: Start accepts. Automaton has 33159 states and 50095 transitions. Word has length 347 [2019-09-08 05:41:38,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:38,807 INFO L475 AbstractCegarLoop]: Abstraction has 33159 states and 50095 transitions. [2019-09-08 05:41:38,807 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 33159 states and 50095 transitions. [2019-09-08 05:41:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-09-08 05:41:38,894 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:38,895 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:38,895 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1800992636, now seen corresponding path program 1 times [2019-09-08 05:41:38,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:38,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-08 05:41:39,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:39,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:41:39,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:41:39,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:41:39,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:39,254 INFO L87 Difference]: Start difference. First operand 33159 states and 50095 transitions. Second operand 3 states. [2019-09-08 05:41:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:41,106 INFO L93 Difference]: Finished difference Result 79692 states and 124544 transitions. [2019-09-08 05:41:41,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:41:41,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-09-08 05:41:41,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:41,230 INFO L225 Difference]: With dead ends: 79692 [2019-09-08 05:41:41,231 INFO L226 Difference]: Without dead ends: 46620 [2019-09-08 05:41:41,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:41:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46620 states. [2019-09-08 05:41:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46620 to 46599. [2019-09-08 05:41:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46599 states. [2019-09-08 05:41:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46599 states to 46599 states and 74143 transitions. [2019-09-08 05:41:43,443 INFO L78 Accepts]: Start accepts. Automaton has 46599 states and 74143 transitions. Word has length 345 [2019-09-08 05:41:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:43,444 INFO L475 AbstractCegarLoop]: Abstraction has 46599 states and 74143 transitions. [2019-09-08 05:41:43,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:41:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 46599 states and 74143 transitions. [2019-09-08 05:41:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2019-09-08 05:41:43,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:43,550 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:43,550 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1158923164, now seen corresponding path program 1 times [2019-09-08 05:41:43,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:43,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:43,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:43,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 05:41:43,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:41:43,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:41:43,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:41:43,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:41:43,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:41:43,963 INFO L87 Difference]: Start difference. First operand 46599 states and 74143 transitions. Second operand 18 states. [2019-09-08 05:41:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:46,960 INFO L93 Difference]: Finished difference Result 47151 states and 74765 transitions. [2019-09-08 05:41:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:41:46,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 353 [2019-09-08 05:41:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:47,048 INFO L225 Difference]: With dead ends: 47151 [2019-09-08 05:41:47,049 INFO L226 Difference]: Without dead ends: 44190 [2019-09-08 05:41:47,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:41:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44190 states. [2019-09-08 05:41:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44190 to 43242. [2019-09-08 05:41:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43242 states. [2019-09-08 05:41:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43242 states to 43242 states and 69937 transitions. [2019-09-08 05:41:48,680 INFO L78 Accepts]: Start accepts. Automaton has 43242 states and 69937 transitions. Word has length 353 [2019-09-08 05:41:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:48,681 INFO L475 AbstractCegarLoop]: Abstraction has 43242 states and 69937 transitions. [2019-09-08 05:41:48,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:41:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 43242 states and 69937 transitions. [2019-09-08 05:41:48,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-08 05:41:48,787 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:41:48,787 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:41:48,788 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:41:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:41:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1029431187, now seen corresponding path program 1 times [2019-09-08 05:41:48,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:41:48,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:41:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:48,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:48,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:41:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 05:41:49,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:41:49,265 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:41:49,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:41:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:41:49,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 3261 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:41:49,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:41:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:41:49,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:41:49,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 05:41:49,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 05:41:49,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 05:41:49,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 05:41:49,928 INFO L87 Difference]: Start difference. First operand 43242 states and 69937 transitions. Second operand 14 states. [2019-09-08 05:41:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:41:58,225 INFO L93 Difference]: Finished difference Result 102009 states and 160609 transitions. [2019-09-08 05:41:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 05:41:58,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 349 [2019-09-08 05:41:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:41:58,426 INFO L225 Difference]: With dead ends: 102009 [2019-09-08 05:41:58,426 INFO L226 Difference]: Without dead ends: 58847 [2019-09-08 05:41:58,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:41:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58847 states. [2019-09-08 05:42:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58847 to 55449. [2019-09-08 05:42:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55449 states. [2019-09-08 05:42:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55449 states to 55449 states and 85661 transitions. [2019-09-08 05:42:01,360 INFO L78 Accepts]: Start accepts. Automaton has 55449 states and 85661 transitions. Word has length 349 [2019-09-08 05:42:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:01,360 INFO L475 AbstractCegarLoop]: Abstraction has 55449 states and 85661 transitions. [2019-09-08 05:42:01,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 05:42:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 55449 states and 85661 transitions. [2019-09-08 05:42:01,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-09-08 05:42:01,505 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:01,505 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:01,506 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:01,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:01,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1868822270, now seen corresponding path program 1 times [2019-09-08 05:42:01,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:01,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:01,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:01,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:01,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 05:42:02,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:42:02,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:42:02,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:42:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:02,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 3260 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:42:02,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:42:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-08 05:42:04,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:42:04,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 4] total 28 [2019-09-08 05:42:04,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 05:42:04,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 05:42:04,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2019-09-08 05:42:04,727 INFO L87 Difference]: Start difference. First operand 55449 states and 85661 transitions. Second operand 28 states. [2019-09-08 05:42:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:07,724 INFO L93 Difference]: Finished difference Result 70316 states and 107716 transitions. [2019-09-08 05:42:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 05:42:07,725 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 348 [2019-09-08 05:42:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:07,922 INFO L225 Difference]: With dead ends: 70316 [2019-09-08 05:42:07,922 INFO L226 Difference]: Without dead ends: 54090 [2019-09-08 05:42:07,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=1384, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 05:42:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54090 states. [2019-09-08 05:42:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54090 to 53808. [2019-09-08 05:42:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53808 states. [2019-09-08 05:42:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53808 states to 53808 states and 83110 transitions. [2019-09-08 05:42:10,384 INFO L78 Accepts]: Start accepts. Automaton has 53808 states and 83110 transitions. Word has length 348 [2019-09-08 05:42:10,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:10,385 INFO L475 AbstractCegarLoop]: Abstraction has 53808 states and 83110 transitions. [2019-09-08 05:42:10,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 05:42:10,385 INFO L276 IsEmpty]: Start isEmpty. Operand 53808 states and 83110 transitions. [2019-09-08 05:42:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-09-08 05:42:10,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:10,532 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:10,533 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:10,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1626087875, now seen corresponding path program 1 times [2019-09-08 05:42:10,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:10,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:10,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:10,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 05:42:11,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:11,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:42:11,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:42:11,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:42:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:42:11,128 INFO L87 Difference]: Start difference. First operand 53808 states and 83110 transitions. Second operand 18 states. [2019-09-08 05:42:14,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:14,221 INFO L93 Difference]: Finished difference Result 54204 states and 83611 transitions. [2019-09-08 05:42:14,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:42:14,221 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 361 [2019-09-08 05:42:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:14,358 INFO L225 Difference]: With dead ends: 54204 [2019-09-08 05:42:14,358 INFO L226 Difference]: Without dead ends: 54150 [2019-09-08 05:42:14,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:42:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54150 states. [2019-09-08 05:42:18,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54150 to 54064. [2019-09-08 05:42:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54064 states. [2019-09-08 05:42:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54064 states to 54064 states and 83436 transitions. [2019-09-08 05:42:18,206 INFO L78 Accepts]: Start accepts. Automaton has 54064 states and 83436 transitions. Word has length 361 [2019-09-08 05:42:18,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:18,206 INFO L475 AbstractCegarLoop]: Abstraction has 54064 states and 83436 transitions. [2019-09-08 05:42:18,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:42:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 54064 states and 83436 transitions. [2019-09-08 05:42:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-09-08 05:42:18,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:18,345 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:18,346 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash -800037893, now seen corresponding path program 1 times [2019-09-08 05:42:18,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:18,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:18,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:18,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-08 05:42:18,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:18,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 05:42:18,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:42:18,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:42:18,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:42:18,628 INFO L87 Difference]: Start difference. First operand 54064 states and 83436 transitions. Second operand 13 states. [2019-09-08 05:42:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:23,174 INFO L93 Difference]: Finished difference Result 54582 states and 83998 transitions. [2019-09-08 05:42:23,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 05:42:23,174 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 358 [2019-09-08 05:42:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:23,322 INFO L225 Difference]: With dead ends: 54582 [2019-09-08 05:42:23,322 INFO L226 Difference]: Without dead ends: 54536 [2019-09-08 05:42:23,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2019-09-08 05:42:23,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54536 states. [2019-09-08 05:42:26,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54536 to 53370. [2019-09-08 05:42:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53370 states. [2019-09-08 05:42:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53370 states to 53370 states and 82613 transitions. [2019-09-08 05:42:27,039 INFO L78 Accepts]: Start accepts. Automaton has 53370 states and 82613 transitions. Word has length 358 [2019-09-08 05:42:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:27,040 INFO L475 AbstractCegarLoop]: Abstraction has 53370 states and 82613 transitions. [2019-09-08 05:42:27,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:42:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 53370 states and 82613 transitions. [2019-09-08 05:42:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-09-08 05:42:27,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:27,175 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:27,175 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1751883545, now seen corresponding path program 1 times [2019-09-08 05:42:27,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:27,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:27,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:27,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:27,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 05:42:27,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:27,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:42:27,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:42:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:42:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:42:27,472 INFO L87 Difference]: Start difference. First operand 53370 states and 82613 transitions. Second operand 18 states. [2019-09-08 05:42:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:30,335 INFO L93 Difference]: Finished difference Result 53468 states and 82735 transitions. [2019-09-08 05:42:30,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 05:42:30,335 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 359 [2019-09-08 05:42:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:30,469 INFO L225 Difference]: With dead ends: 53468 [2019-09-08 05:42:30,469 INFO L226 Difference]: Without dead ends: 53398 [2019-09-08 05:42:30,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:42:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53398 states. [2019-09-08 05:42:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53398 to 53352. [2019-09-08 05:42:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53352 states. [2019-09-08 05:42:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53352 states to 53352 states and 82574 transitions. [2019-09-08 05:42:34,298 INFO L78 Accepts]: Start accepts. Automaton has 53352 states and 82574 transitions. Word has length 359 [2019-09-08 05:42:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:34,298 INFO L475 AbstractCegarLoop]: Abstraction has 53352 states and 82574 transitions. [2019-09-08 05:42:34,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:42:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 53352 states and 82574 transitions. [2019-09-08 05:42:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-08 05:42:34,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:34,429 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:34,429 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash -491164915, now seen corresponding path program 1 times [2019-09-08 05:42:34,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:34,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:34,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-08 05:42:34,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:42:34,590 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:42:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:42:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:35,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 3332 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:42:35,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:42:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-08 05:42:35,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:42:35,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-08 05:42:35,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:42:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:42:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:42:35,223 INFO L87 Difference]: Start difference. First operand 53352 states and 82574 transitions. Second operand 8 states. [2019-09-08 05:42:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:37,242 INFO L93 Difference]: Finished difference Result 68195 states and 100814 transitions. [2019-09-08 05:42:37,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:42:37,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 369 [2019-09-08 05:42:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:37,409 INFO L225 Difference]: With dead ends: 68195 [2019-09-08 05:42:37,409 INFO L226 Difference]: Without dead ends: 52751 [2019-09-08 05:42:37,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:42:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52751 states. [2019-09-08 05:42:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52751 to 52045. [2019-09-08 05:42:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52045 states. [2019-09-08 05:42:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52045 states to 52045 states and 80804 transitions. [2019-09-08 05:42:40,028 INFO L78 Accepts]: Start accepts. Automaton has 52045 states and 80804 transitions. Word has length 369 [2019-09-08 05:42:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:40,029 INFO L475 AbstractCegarLoop]: Abstraction has 52045 states and 80804 transitions. [2019-09-08 05:42:40,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:42:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 52045 states and 80804 transitions. [2019-09-08 05:42:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-08 05:42:40,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:40,156 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:40,156 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash -955774832, now seen corresponding path program 1 times [2019-09-08 05:42:40,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:40,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:40,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:40,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 05:42:40,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:40,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:42:40,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:42:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:42:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:42:40,340 INFO L87 Difference]: Start difference. First operand 52045 states and 80804 transitions. Second operand 6 states. [2019-09-08 05:42:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:43,599 INFO L93 Difference]: Finished difference Result 103483 states and 160694 transitions. [2019-09-08 05:42:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:42:43,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 366 [2019-09-08 05:42:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:43,770 INFO L225 Difference]: With dead ends: 103483 [2019-09-08 05:42:43,770 INFO L226 Difference]: Without dead ends: 52066 [2019-09-08 05:42:43,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:42:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52066 states. [2019-09-08 05:42:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52066 to 52045. [2019-09-08 05:42:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52045 states. [2019-09-08 05:42:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52045 states to 52045 states and 80419 transitions. [2019-09-08 05:42:46,232 INFO L78 Accepts]: Start accepts. Automaton has 52045 states and 80419 transitions. Word has length 366 [2019-09-08 05:42:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:42:46,233 INFO L475 AbstractCegarLoop]: Abstraction has 52045 states and 80419 transitions. [2019-09-08 05:42:46,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:42:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 52045 states and 80419 transitions. [2019-09-08 05:42:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 05:42:46,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:46,375 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:46,376 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1487760705, now seen corresponding path program 1 times [2019-09-08 05:42:46,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:46,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:46,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-08 05:42:46,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:42:46,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 05:42:46,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:42:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:47,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 3346 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 05:42:47,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:42:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-09-08 05:42:47,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:42:47,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-09-08 05:42:47,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:42:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:42:47,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:42:47,319 INFO L87 Difference]: Start difference. First operand 52045 states and 80419 transitions. Second operand 13 states. [2019-09-08 05:42:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:57,440 INFO L93 Difference]: Finished difference Result 102829 states and 141856 transitions. [2019-09-08 05:42:57,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 05:42:57,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 376 [2019-09-08 05:42:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:57,638 INFO L225 Difference]: With dead ends: 102829 [2019-09-08 05:42:57,638 INFO L226 Difference]: Without dead ends: 69211 [2019-09-08 05:42:57,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2019-09-08 05:42:57,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69211 states. [2019-09-08 05:43:00,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69211 to 63628. [2019-09-08 05:43:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63628 states. [2019-09-08 05:43:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63628 states to 63628 states and 95031 transitions. [2019-09-08 05:43:00,647 INFO L78 Accepts]: Start accepts. Automaton has 63628 states and 95031 transitions. Word has length 376 [2019-09-08 05:43:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:00,648 INFO L475 AbstractCegarLoop]: Abstraction has 63628 states and 95031 transitions. [2019-09-08 05:43:00,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:43:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 63628 states and 95031 transitions. [2019-09-08 05:43:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-09-08 05:43:00,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:00,892 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:00,892 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:00,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:00,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1794972302, now seen corresponding path program 1 times [2019-09-08 05:43:00,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:00,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:00,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:00,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:43:01,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:43:01,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:43:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:43:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:01,050 INFO L87 Difference]: Start difference. First operand 63628 states and 95031 transitions. Second operand 3 states. [2019-09-08 05:43:04,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:04,258 INFO L93 Difference]: Finished difference Result 151275 states and 233905 transitions. [2019-09-08 05:43:04,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:43:04,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 371 [2019-09-08 05:43:04,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:04,533 INFO L225 Difference]: With dead ends: 151275 [2019-09-08 05:43:04,534 INFO L226 Difference]: Without dead ends: 89925 [2019-09-08 05:43:04,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89925 states. [2019-09-08 05:43:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89925 to 89904. [2019-09-08 05:43:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89904 states. [2019-09-08 05:43:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89904 states to 89904 states and 141604 transitions. [2019-09-08 05:43:12,252 INFO L78 Accepts]: Start accepts. Automaton has 89904 states and 141604 transitions. Word has length 371 [2019-09-08 05:43:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:12,253 INFO L475 AbstractCegarLoop]: Abstraction has 89904 states and 141604 transitions. [2019-09-08 05:43:12,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:43:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 89904 states and 141604 transitions. [2019-09-08 05:43:12,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2019-09-08 05:43:12,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:12,618 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:12,619 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:12,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1048911267, now seen corresponding path program 1 times [2019-09-08 05:43:12,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:12,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:12,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:12,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:43:12,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:12,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:43:12,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:43:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:43:12,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:12,795 INFO L87 Difference]: Start difference. First operand 89904 states and 141604 transitions. Second operand 3 states. [2019-09-08 05:43:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:18,622 INFO L93 Difference]: Finished difference Result 229845 states and 372880 transitions. [2019-09-08 05:43:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:43:18,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 372 [2019-09-08 05:43:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:19,059 INFO L225 Difference]: With dead ends: 229845 [2019-09-08 05:43:19,059 INFO L226 Difference]: Without dead ends: 142730 [2019-09-08 05:43:19,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142730 states. [2019-09-08 05:43:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142730 to 142629. [2019-09-08 05:43:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142629 states. [2019-09-08 05:43:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142629 states to 142629 states and 233923 transitions. [2019-09-08 05:43:29,939 INFO L78 Accepts]: Start accepts. Automaton has 142629 states and 233923 transitions. Word has length 372 [2019-09-08 05:43:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:29,940 INFO L475 AbstractCegarLoop]: Abstraction has 142629 states and 233923 transitions. [2019-09-08 05:43:29,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:43:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 142629 states and 233923 transitions. [2019-09-08 05:43:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-09-08 05:43:30,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:30,467 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:30,468 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 498086798, now seen corresponding path program 1 times [2019-09-08 05:43:30,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:30,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:30,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:30,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:30,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:43:31,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:31,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:43:31,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:43:31,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:43:31,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:31,325 INFO L87 Difference]: Start difference. First operand 142629 states and 233923 transitions. Second operand 3 states. [2019-09-08 05:43:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:43:45,231 INFO L93 Difference]: Finished difference Result 379626 states and 633388 transitions. [2019-09-08 05:43:45,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:43:45,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 373 [2019-09-08 05:43:45,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:43:46,107 INFO L225 Difference]: With dead ends: 379626 [2019-09-08 05:43:46,107 INFO L226 Difference]: Without dead ends: 240510 [2019-09-08 05:43:46,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240510 states. [2019-09-08 05:44:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240510 to 240489. [2019-09-08 05:44:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240489 states. [2019-09-08 05:44:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240489 states to 240489 states and 401810 transitions. [2019-09-08 05:44:04,326 INFO L78 Accepts]: Start accepts. Automaton has 240489 states and 401810 transitions. Word has length 373 [2019-09-08 05:44:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:44:04,326 INFO L475 AbstractCegarLoop]: Abstraction has 240489 states and 401810 transitions. [2019-09-08 05:44:04,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:44:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 240489 states and 401810 transitions. [2019-09-08 05:44:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-08 05:44:06,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:44:06,444 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:44:06,444 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:44:06,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:44:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash -751260827, now seen corresponding path program 1 times [2019-09-08 05:44:06,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:44:06,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:44:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:06,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:44:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:44:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:44:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:44:06,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:44:06,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:44:06,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:44:06,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:44:06,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:44:06,583 INFO L87 Difference]: Start difference. First operand 240489 states and 401810 transitions. Second operand 3 states. [2019-09-08 05:44:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:38,021 INFO L93 Difference]: Finished difference Result 661274 states and 1120630 transitions. [2019-09-08 05:44:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:44:38,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-09-08 05:44:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:39,570 INFO L225 Difference]: With dead ends: 661274 [2019-09-08 05:44:39,570 INFO L226 Difference]: Without dead ends: 425503 [2019-09-08 05:44:40,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:44:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425503 states. [2019-09-08 05:45:16,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425503 to 425482. [2019-09-08 05:45:16,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425482 states. [2019-09-08 05:45:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425482 states to 425482 states and 719923 transitions. [2019-09-08 05:45:17,171 INFO L78 Accepts]: Start accepts. Automaton has 425482 states and 719923 transitions. Word has length 374 [2019-09-08 05:45:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:45:17,172 INFO L475 AbstractCegarLoop]: Abstraction has 425482 states and 719923 transitions. [2019-09-08 05:45:17,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:45:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 425482 states and 719923 transitions. [2019-09-08 05:45:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-09-08 05:45:27,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:45:27,576 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:45:27,576 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:45:27,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:45:27,576 INFO L82 PathProgramCache]: Analyzing trace with hash -932447026, now seen corresponding path program 1 times [2019-09-08 05:45:27,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:45:27,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:45:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:27,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:45:27,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:45:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:45:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 05:45:27,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:45:27,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:45:27,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:45:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:45:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:45:27,772 INFO L87 Difference]: Start difference. First operand 425482 states and 719923 transitions. Second operand 3 states. [2019-09-08 05:46:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:46:13,040 INFO L93 Difference]: Finished difference Result 805357 states and 1354356 transitions. [2019-09-08 05:46:13,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:46:13,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2019-09-08 05:46:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:46:16,946 INFO L225 Difference]: With dead ends: 805357 [2019-09-08 05:46:16,946 INFO L226 Difference]: Without dead ends: 776945 [2019-09-08 05:46:17,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:46:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776945 states. [2019-09-08 05:47:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776945 to 775385. [2019-09-08 05:47:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775385 states. [2019-09-08 05:47:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775385 states to 775385 states and 1308479 transitions. [2019-09-08 05:47:36,439 INFO L78 Accepts]: Start accepts. Automaton has 775385 states and 1308479 transitions. Word has length 375 [2019-09-08 05:47:36,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:47:36,440 INFO L475 AbstractCegarLoop]: Abstraction has 775385 states and 1308479 transitions. [2019-09-08 05:47:36,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:47:36,440 INFO L276 IsEmpty]: Start isEmpty. Operand 775385 states and 1308479 transitions. [2019-09-08 05:47:54,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-09-08 05:47:54,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:47:54,689 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:47:54,690 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:47:54,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:47:54,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1980580315, now seen corresponding path program 1 times [2019-09-08 05:47:54,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:47:54,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:47:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:54,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:54,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:47:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 05:47:55,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:47:55,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:47:55,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:47:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:47:57,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 3359 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:47:57,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:47:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 05:47:57,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:47:57,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 21 [2019-09-08 05:47:57,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:47:57,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:47:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:47:57,207 INFO L87 Difference]: Start difference. First operand 775385 states and 1308479 transitions. Second operand 21 states. [2019-09-08 05:48:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:48:28,088 INFO L93 Difference]: Finished difference Result 775659 states and 1308824 transitions. [2019-09-08 05:48:28,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 05:48:28,088 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 376 [2019-09-08 05:48:28,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:48:29,415 INFO L225 Difference]: With dead ends: 775659 [2019-09-08 05:48:29,415 INFO L226 Difference]: Without dead ends: 381222 [2019-09-08 05:48:30,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 05:48:30,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381222 states. [2019-09-08 05:49:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381222 to 378102. [2019-09-08 05:49:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378102 states. [2019-09-08 05:49:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378102 states to 378102 states and 634548 transitions. [2019-09-08 05:49:09,445 INFO L78 Accepts]: Start accepts. Automaton has 378102 states and 634548 transitions. Word has length 376 [2019-09-08 05:49:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:49:09,445 INFO L475 AbstractCegarLoop]: Abstraction has 378102 states and 634548 transitions. [2019-09-08 05:49:09,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:49:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 378102 states and 634548 transitions. [2019-09-08 05:49:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 05:49:12,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:49:12,869 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:49:12,869 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:49:12,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:49:12,869 INFO L82 PathProgramCache]: Analyzing trace with hash -122732832, now seen corresponding path program 1 times [2019-09-08 05:49:12,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:49:12,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:49:12,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:12,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:12,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:49:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-08 05:49:13,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:49:13,032 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:49:13,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:49:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:49:13,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 3399 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:49:13,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:49:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 05:49:13,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:49:13,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-08 05:49:13,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:49:13,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:49:13,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:49:13,679 INFO L87 Difference]: Start difference. First operand 378102 states and 634548 transitions. Second operand 10 states. [2019-09-08 05:49:46,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:49:46,884 INFO L93 Difference]: Finished difference Result 567375 states and 983836 transitions. [2019-09-08 05:49:46,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:49:46,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 390 [2019-09-08 05:49:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:49:48,113 INFO L225 Difference]: With dead ends: 567375 [2019-09-08 05:49:48,113 INFO L226 Difference]: Without dead ends: 377895 [2019-09-08 05:49:48,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 394 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:49:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377895 states. [2019-09-08 05:50:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377895 to 375509. [2019-09-08 05:50:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375509 states. [2019-09-08 05:50:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375509 states to 375509 states and 649213 transitions. [2019-09-08 05:50:26,264 INFO L78 Accepts]: Start accepts. Automaton has 375509 states and 649213 transitions. Word has length 390 [2019-09-08 05:50:26,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:50:26,265 INFO L475 AbstractCegarLoop]: Abstraction has 375509 states and 649213 transitions. [2019-09-08 05:50:26,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:50:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 375509 states and 649213 transitions.