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_spec11_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:34:33,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:34:33,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:34:33,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:34:33,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:34:33,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:34:33,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:34:33,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:34:33,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:34:33,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:34:33,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:34:33,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:34:33,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:34:33,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:34:33,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:34:33,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:34:33,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:34:33,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:34:33,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:34:33,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:34:33,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:34:33,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:34:33,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:34:33,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:34:33,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:34:33,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:34:33,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:34:33,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:34:33,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:34:33,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:34:33,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:34:33,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:34:33,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:34:33,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:34:33,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:34:33,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:34:33,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:34:33,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:34:33,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:34:33,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:34:33,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:34:33,544 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 04:34:33,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:34:33,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:34:33,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:34:33,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:34:33,560 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:34:33,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:34:33,560 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:34:33,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:34:33,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:34:33,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:34:33,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:34:33,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:34:33,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:34:33,562 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:34:33,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:34:33,562 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:34:33,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:34:33,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:34:33,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:34:33,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:34:33,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:34:33,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:34:33,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:34:33,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:34:33,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:34:33,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:34:33,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:34:33,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:34:33,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:34:33,592 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:34:33,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:34:33,608 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:34:33,609 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:34:33,610 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:34:33,611 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product32.cil.c [2019-09-08 04:34:33,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c733216b7/d589317e8e1448a680ebe4b7a1b3277b/FLAGbec623983 [2019-09-08 04:34:34,264 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:34:34,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product32.cil.c [2019-09-08 04:34:34,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c733216b7/d589317e8e1448a680ebe4b7a1b3277b/FLAGbec623983 [2019-09-08 04:34:34,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c733216b7/d589317e8e1448a680ebe4b7a1b3277b [2019-09-08 04:34:34,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:34:34,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:34:34,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:34:34,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:34:34,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:34:34,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:34:34" (1/1) ... [2019-09-08 04:34:34,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a4700a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:34, skipping insertion in model container [2019-09-08 04:34:34,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:34:34" (1/1) ... [2019-09-08 04:34:34,602 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:34:34,678 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:34:35,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:34:35,450 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:34:35,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:34:35,711 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:34:35,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35 WrapperNode [2019-09-08 04:34:35,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:34:35,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:34:35,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:34:35,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:34:35,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (1/1) ... [2019-09-08 04:34:35,908 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:34:35,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:34:35,909 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:34:35,909 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:34:35,910 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (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 04:34:35,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:34:35,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:34:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:34:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:34:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:34:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:34:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:34:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:34:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:34:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:34:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:34:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:34:35,981 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:34:35,981 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:34:35,981 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:34:35,981 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:34:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:34:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:34:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:34:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:34:35,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:34:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:34:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:34:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:34:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:34:35,983 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:34:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:34:35,985 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:34:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:34:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:34:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:34:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:34:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:34:35,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:34:35,987 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:34:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:34:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:34:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:34:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:34:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 04:34:35,988 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:34:35,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:34:35,990 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 04:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:34:35,991 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:34:35,992 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:34:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:34:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:34:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:34:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:34:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:34:35,993 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:34:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:34:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:34:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:34:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:34:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:34:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:34:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:34:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:34:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:34:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:34:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:34:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:34:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:34:35,997 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:34:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:34:35,999 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:34:36,000 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:34:36,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:34:36,002 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:34:36,003 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:34:36,004 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:34:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:34:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:34:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:34:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:34:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:34:36,005 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:34:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:34:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:34:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:34:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:34:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:34:36,006 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:34:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:34:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:34:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:34:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:34:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:34:36,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:34:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:34:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:34:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:34:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:34:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:34:36,008 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:34:36,009 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:34:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:34:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:34:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:34:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 04:34:36,010 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-08 04:34:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:34:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:34:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:34:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:34:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:34:36,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:34:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:34:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:34:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:34:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:34:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:34:36,012 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:34:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:34:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:34:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:34:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:34:36,013 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:34:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:34:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:34:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:34:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:34:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:34:36,014 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:34:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:34:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:34:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:34:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:34:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:34:36,015 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:34:36,016 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 04:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-09-08 04:34:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:34:36,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:34:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:34:36,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:34:38,071 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:34:38,071 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:34:38,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:34:38 BoogieIcfgContainer [2019-09-08 04:34:38,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:34:38,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:34:38,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:34:38,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:34:38,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:34:34" (1/3) ... [2019-09-08 04:34:38,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152298b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:34:38, skipping insertion in model container [2019-09-08 04:34:38,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:34:35" (2/3) ... [2019-09-08 04:34:38,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152298b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:34:38, skipping insertion in model container [2019-09-08 04:34:38,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:34:38" (3/3) ... [2019-09-08 04:34:38,083 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product32.cil.c [2019-09-08 04:34:38,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:34:38,109 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:34:38,128 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:34:38,191 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:34:38,195 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:34:38,196 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:34:38,196 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:34:38,197 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:34:38,204 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:34:38,204 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:34:38,204 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:34:38,204 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:34:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states. [2019-09-08 04:34:38,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 04:34:38,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:38,288 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:38,291 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:38,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:38,297 INFO L82 PathProgramCache]: Analyzing trace with hash 524711374, now seen corresponding path program 1 times [2019-09-08 04:34:38,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:38,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:38,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:39,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:39,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:34:39,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:34:39,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:34:39,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:34:39,088 INFO L87 Difference]: Start difference. First operand 634 states. Second operand 2 states. [2019-09-08 04:34:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:39,165 INFO L93 Difference]: Finished difference Result 898 states and 1221 transitions. [2019-09-08 04:34:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:34:39,166 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 225 [2019-09-08 04:34:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:39,190 INFO L225 Difference]: With dead ends: 898 [2019-09-08 04:34:39,191 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 04:34:39,198 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 04:34:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 04:34:39,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-09-08 04:34:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-09-08 04:34:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 787 transitions. [2019-09-08 04:34:39,301 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 787 transitions. Word has length 225 [2019-09-08 04:34:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:39,304 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 787 transitions. [2019-09-08 04:34:39,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:34:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 787 transitions. [2019-09-08 04:34:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 04:34:39,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:39,312 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:39,313 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 426124943, now seen corresponding path program 1 times [2019-09-08 04:34:39,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:39,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:39,668 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:39,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:39,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:34:39,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:34:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:34:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:34:39,706 INFO L87 Difference]: Start difference. First operand 577 states and 787 transitions. Second operand 3 states. [2019-09-08 04:34:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:39,753 INFO L93 Difference]: Finished difference Result 881 states and 1182 transitions. [2019-09-08 04:34:39,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:34:39,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-09-08 04:34:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:39,760 INFO L225 Difference]: With dead ends: 881 [2019-09-08 04:34:39,760 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 04:34:39,764 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 04:34:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 04:34:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 579. [2019-09-08 04:34:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-08 04:34:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 789 transitions. [2019-09-08 04:34:39,812 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 789 transitions. Word has length 226 [2019-09-08 04:34:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:39,813 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 789 transitions. [2019-09-08 04:34:39,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:34:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 789 transitions. [2019-09-08 04:34:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-08 04:34:39,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:39,831 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:39,831 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash -478434401, now seen corresponding path program 1 times [2019-09-08 04:34:39,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:39,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:39,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:39,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:40,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:40,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:34:40,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:34:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:34:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:34:40,067 INFO L87 Difference]: Start difference. First operand 579 states and 789 transitions. Second operand 3 states. [2019-09-08 04:34:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:40,118 INFO L93 Difference]: Finished difference Result 1136 states and 1579 transitions. [2019-09-08 04:34:40,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:34:40,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-09-08 04:34:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:40,124 INFO L225 Difference]: With dead ends: 1136 [2019-09-08 04:34:40,124 INFO L226 Difference]: Without dead ends: 622 [2019-09-08 04:34:40,126 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 04:34:40,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-09-08 04:34:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 621. [2019-09-08 04:34:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 04:34:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 861 transitions. [2019-09-08 04:34:40,154 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 861 transitions. Word has length 236 [2019-09-08 04:34:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:40,155 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 861 transitions. [2019-09-08 04:34:40,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:34:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 861 transitions. [2019-09-08 04:34:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 04:34:40,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:40,161 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:40,161 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:40,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 28118044, now seen corresponding path program 1 times [2019-09-08 04:34:40,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:40,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:40,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:40,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:40,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:40,470 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:40,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:40,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:34:40,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:34:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:34:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:34:40,475 INFO L87 Difference]: Start difference. First operand 621 states and 861 transitions. Second operand 3 states. [2019-09-08 04:34:40,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:40,518 INFO L93 Difference]: Finished difference Result 1259 states and 1790 transitions. [2019-09-08 04:34:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:34:40,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-08 04:34:40,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:40,526 INFO L225 Difference]: With dead ends: 1259 [2019-09-08 04:34:40,527 INFO L226 Difference]: Without dead ends: 703 [2019-09-08 04:34:40,529 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 04:34:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-09-08 04:34:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 702. [2019-09-08 04:34:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 04:34:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 999 transitions. [2019-09-08 04:34:40,573 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 999 transitions. Word has length 237 [2019-09-08 04:34:40,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:40,574 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 999 transitions. [2019-09-08 04:34:40,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:34:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 999 transitions. [2019-09-08 04:34:40,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 04:34:40,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:40,583 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:40,584 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash 280680863, now seen corresponding path program 1 times [2019-09-08 04:34:40,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:40,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:40,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:40,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:40,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:40,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:40,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:34:40,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:34:40,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:34:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:34:40,778 INFO L87 Difference]: Start difference. First operand 702 states and 999 transitions. Second operand 3 states. [2019-09-08 04:34:40,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:40,830 INFO L93 Difference]: Finished difference Result 1496 states and 2194 transitions. [2019-09-08 04:34:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:34:40,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-08 04:34:40,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:40,837 INFO L225 Difference]: With dead ends: 1496 [2019-09-08 04:34:40,837 INFO L226 Difference]: Without dead ends: 859 [2019-09-08 04:34:40,839 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 04:34:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-09-08 04:34:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 858. [2019-09-08 04:34:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2019-09-08 04:34:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1263 transitions. [2019-09-08 04:34:40,881 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1263 transitions. Word has length 238 [2019-09-08 04:34:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:40,881 INFO L475 AbstractCegarLoop]: Abstraction has 858 states and 1263 transitions. [2019-09-08 04:34:40,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:34:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1263 transitions. [2019-09-08 04:34:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-08 04:34:40,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:40,888 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:40,889 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:40,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 407261724, now seen corresponding path program 1 times [2019-09-08 04:34:40,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:40,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:40,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:41,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:41,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:34:41,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:34:41,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:34:41,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:34:41,191 INFO L87 Difference]: Start difference. First operand 858 states and 1263 transitions. Second operand 3 states. [2019-09-08 04:34:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:41,267 INFO L93 Difference]: Finished difference Result 1952 states and 2966 transitions. [2019-09-08 04:34:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:34:41,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-08 04:34:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:41,277 INFO L225 Difference]: With dead ends: 1952 [2019-09-08 04:34:41,278 INFO L226 Difference]: Without dead ends: 1159 [2019-09-08 04:34:41,281 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 04:34:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2019-09-08 04:34:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1158. [2019-09-08 04:34:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2019-09-08 04:34:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1767 transitions. [2019-09-08 04:34:41,339 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1767 transitions. Word has length 239 [2019-09-08 04:34:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:41,340 INFO L475 AbstractCegarLoop]: Abstraction has 1158 states and 1767 transitions. [2019-09-08 04:34:41,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:34:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1767 transitions. [2019-09-08 04:34:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 04:34:41,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:41,355 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:41,355 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1311842207, now seen corresponding path program 1 times [2019-09-08 04:34:41,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:41,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:41,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:41,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:41,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:34:41,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:41,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:34:41,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:34:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:34:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:34:41,615 INFO L87 Difference]: Start difference. First operand 1158 states and 1767 transitions. Second operand 3 states. [2019-09-08 04:34:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:41,691 INFO L93 Difference]: Finished difference Result 2828 states and 4438 transitions. [2019-09-08 04:34:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:34:41,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-08 04:34:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:41,705 INFO L225 Difference]: With dead ends: 2828 [2019-09-08 04:34:41,705 INFO L226 Difference]: Without dead ends: 1735 [2019-09-08 04:34:41,711 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 04:34:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-09-08 04:34:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1734. [2019-09-08 04:34:41,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-09-08 04:34:41,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2727 transitions. [2019-09-08 04:34:41,797 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2727 transitions. Word has length 240 [2019-09-08 04:34:41,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:41,797 INFO L475 AbstractCegarLoop]: Abstraction has 1734 states and 2727 transitions. [2019-09-08 04:34:41,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:34:41,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2727 transitions. [2019-09-08 04:34:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 04:34:41,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:41,810 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:41,811 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:41,811 INFO L82 PathProgramCache]: Analyzing trace with hash 689298150, now seen corresponding path program 1 times [2019-09-08 04:34:41,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:41,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:41,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:41,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:34:42,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:42,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:34:42,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:34:42,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:34:42,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:34:42,341 INFO L87 Difference]: Start difference. First operand 1734 states and 2727 transitions. Second operand 19 states. [2019-09-08 04:34:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:47,984 INFO L93 Difference]: Finished difference Result 4365 states and 6833 transitions. [2019-09-08 04:34:47,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 04:34:47,994 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 242 [2019-09-08 04:34:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:48,040 INFO L225 Difference]: With dead ends: 4365 [2019-09-08 04:34:48,040 INFO L226 Difference]: Without dead ends: 4077 [2019-09-08 04:34:48,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:34:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2019-09-08 04:34:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 4040. [2019-09-08 04:34:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4040 states. [2019-09-08 04:34:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4040 states to 4040 states and 6381 transitions. [2019-09-08 04:34:48,310 INFO L78 Accepts]: Start accepts. Automaton has 4040 states and 6381 transitions. Word has length 242 [2019-09-08 04:34:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:48,311 INFO L475 AbstractCegarLoop]: Abstraction has 4040 states and 6381 transitions. [2019-09-08 04:34:48,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:34:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4040 states and 6381 transitions. [2019-09-08 04:34:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:34:48,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:48,347 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:48,348 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -179274695, now seen corresponding path program 1 times [2019-09-08 04:34:48,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:48,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:48,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:48,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 04:34:48,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:48,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:34:48,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:34:48,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:34:48,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:34:48,702 INFO L87 Difference]: Start difference. First operand 4040 states and 6381 transitions. Second operand 13 states. [2019-09-08 04:34:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:49,335 INFO L93 Difference]: Finished difference Result 5393 states and 8281 transitions. [2019-09-08 04:34:49,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:34:49,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 243 [2019-09-08 04:34:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:49,367 INFO L225 Difference]: With dead ends: 5393 [2019-09-08 04:34:49,367 INFO L226 Difference]: Without dead ends: 4174 [2019-09-08 04:34:49,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:34:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4174 states. [2019-09-08 04:34:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4174 to 4174. [2019-09-08 04:34:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4174 states. [2019-09-08 04:34:49,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4174 states to 4174 states and 6598 transitions. [2019-09-08 04:34:49,656 INFO L78 Accepts]: Start accepts. Automaton has 4174 states and 6598 transitions. Word has length 243 [2019-09-08 04:34:49,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:49,656 INFO L475 AbstractCegarLoop]: Abstraction has 4174 states and 6598 transitions. [2019-09-08 04:34:49,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:34:49,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4174 states and 6598 transitions. [2019-09-08 04:34:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:34:49,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:49,682 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:49,682 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash 381795678, now seen corresponding path program 1 times [2019-09-08 04:34:49,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:49,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:49,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:34:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:34:50,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:34:50,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:34:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:34:50,075 INFO L87 Difference]: Start difference. First operand 4174 states and 6598 transitions. Second operand 18 states. [2019-09-08 04:34:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:50,682 INFO L93 Difference]: Finished difference Result 5523 states and 8474 transitions. [2019-09-08 04:34:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:34:50,683 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 243 [2019-09-08 04:34:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:50,710 INFO L225 Difference]: With dead ends: 5523 [2019-09-08 04:34:50,710 INFO L226 Difference]: Without dead ends: 4230 [2019-09-08 04:34:50,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:34:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2019-09-08 04:34:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 4230. [2019-09-08 04:34:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2019-09-08 04:34:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 6662 transitions. [2019-09-08 04:34:50,925 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 6662 transitions. Word has length 243 [2019-09-08 04:34:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:50,926 INFO L475 AbstractCegarLoop]: Abstraction has 4230 states and 6662 transitions. [2019-09-08 04:34:50,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:34:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 6662 transitions. [2019-09-08 04:34:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:34:50,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:50,952 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:50,952 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 766207055, now seen corresponding path program 1 times [2019-09-08 04:34:50,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:50,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:50,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:50,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:50,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:34:51,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:51,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:34:51,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:34:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:34:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:34:51,464 INFO L87 Difference]: Start difference. First operand 4230 states and 6662 transitions. Second operand 15 states. [2019-09-08 04:34:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:55,400 INFO L93 Difference]: Finished difference Result 5661 states and 8673 transitions. [2019-09-08 04:34:55,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:34:55,401 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 243 [2019-09-08 04:34:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:55,432 INFO L225 Difference]: With dead ends: 5661 [2019-09-08 04:34:55,433 INFO L226 Difference]: Without dead ends: 4332 [2019-09-08 04:34:55,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:34:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2019-09-08 04:34:55,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4300. [2019-09-08 04:34:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4300 states. [2019-09-08 04:34:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 6775 transitions. [2019-09-08 04:34:55,643 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 6775 transitions. Word has length 243 [2019-09-08 04:34:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:55,646 INFO L475 AbstractCegarLoop]: Abstraction has 4300 states and 6775 transitions. [2019-09-08 04:34:55,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:34:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 6775 transitions. [2019-09-08 04:34:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:34:55,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:55,668 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:55,669 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:55,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 632036331, now seen corresponding path program 1 times [2019-09-08 04:34:55,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:55,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:55,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:55,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:55,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 04:34:55,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:55,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:34:55,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:34:55,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:34:55,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:34:55,883 INFO L87 Difference]: Start difference. First operand 4300 states and 6775 transitions. Second operand 5 states. [2019-09-08 04:34:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:57,157 INFO L93 Difference]: Finished difference Result 8557 states and 13403 transitions. [2019-09-08 04:34:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:34:57,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2019-09-08 04:34:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:57,205 INFO L225 Difference]: With dead ends: 8557 [2019-09-08 04:34:57,205 INFO L226 Difference]: Without dead ends: 7844 [2019-09-08 04:34:57,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:34:57,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7844 states. [2019-09-08 04:34:57,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7844 to 7830. [2019-09-08 04:34:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7830 states. [2019-09-08 04:34:57,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7830 states to 7830 states and 12347 transitions. [2019-09-08 04:34:57,678 INFO L78 Accepts]: Start accepts. Automaton has 7830 states and 12347 transitions. Word has length 243 [2019-09-08 04:34:57,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:57,679 INFO L475 AbstractCegarLoop]: Abstraction has 7830 states and 12347 transitions. [2019-09-08 04:34:57,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:34:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7830 states and 12347 transitions. [2019-09-08 04:34:57,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:34:57,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:57,717 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:57,717 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:57,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1570567946, now seen corresponding path program 1 times [2019-09-08 04:34:57,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:57,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:57,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:57,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:57,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:34:57,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:34:57,921 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:34:57,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:58,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 3245 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:34:58,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:34:58,741 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 04:34:58,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:34:58,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 04:34:58,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:34:58,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:34:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:34:58,752 INFO L87 Difference]: Start difference. First operand 7830 states and 12347 transitions. Second operand 14 states. [2019-09-08 04:35:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:04,367 INFO L93 Difference]: Finished difference Result 22820 states and 37526 transitions. [2019-09-08 04:35:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 04:35:04,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 243 [2019-09-08 04:35:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:04,495 INFO L225 Difference]: With dead ends: 22820 [2019-09-08 04:35:04,495 INFO L226 Difference]: Without dead ends: 15026 [2019-09-08 04:35:04,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:35:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15026 states. [2019-09-08 04:35:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15026 to 15020. [2019-09-08 04:35:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15020 states. [2019-09-08 04:35:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15020 states to 15020 states and 24147 transitions. [2019-09-08 04:35:05,684 INFO L78 Accepts]: Start accepts. Automaton has 15020 states and 24147 transitions. Word has length 243 [2019-09-08 04:35:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:05,684 INFO L475 AbstractCegarLoop]: Abstraction has 15020 states and 24147 transitions. [2019-09-08 04:35:05,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:35:05,684 INFO L276 IsEmpty]: Start isEmpty. Operand 15020 states and 24147 transitions. [2019-09-08 04:35:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 04:35:05,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:05,728 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:05,728 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2133949908, now seen corresponding path program 1 times [2019-09-08 04:35:05,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:05,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:05,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:05,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:05,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:35:06,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:35:06,347 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) [2019-09-08 04:35:06,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:35:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:06,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 3248 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:35:06,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:35:07,218 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 04:35:07,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:35:07,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [26] total 31 [2019-09-08 04:35:07,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-08 04:35:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-08 04:35:07,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:35:07,240 INFO L87 Difference]: Start difference. First operand 15020 states and 24147 transitions. Second operand 31 states. [2019-09-08 04:35:11,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:11,737 INFO L93 Difference]: Finished difference Result 30215 states and 49701 transitions. [2019-09-08 04:35:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 04:35:11,738 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 246 [2019-09-08 04:35:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:11,823 INFO L225 Difference]: With dead ends: 30215 [2019-09-08 04:35:11,823 INFO L226 Difference]: Without dead ends: 15246 [2019-09-08 04:35:11,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2019-09-08 04:35:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15246 states. [2019-09-08 04:35:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15246 to 15214. [2019-09-08 04:35:12,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15214 states. [2019-09-08 04:35:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15214 states to 15214 states and 24361 transitions. [2019-09-08 04:35:12,906 INFO L78 Accepts]: Start accepts. Automaton has 15214 states and 24361 transitions. Word has length 246 [2019-09-08 04:35:12,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:12,907 INFO L475 AbstractCegarLoop]: Abstraction has 15214 states and 24361 transitions. [2019-09-08 04:35:12,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-08 04:35:12,907 INFO L276 IsEmpty]: Start isEmpty. Operand 15214 states and 24361 transitions. [2019-09-08 04:35:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 04:35:12,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:12,933 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:12,933 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 274602073, now seen corresponding path program 1 times [2019-09-08 04:35:12,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:12,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:12,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:12,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:12,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:35:13,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:35:13,152 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 04:35:13,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:13,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 3264 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:35:13,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:35:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:35:13,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:35:13,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 04:35:13,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:35:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:35:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:35:13,844 INFO L87 Difference]: Start difference. First operand 15214 states and 24361 transitions. Second operand 17 states. [2019-09-08 04:35:16,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:16,491 INFO L93 Difference]: Finished difference Result 30977 states and 51080 transitions. [2019-09-08 04:35:16,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:35:16,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 251 [2019-09-08 04:35:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:16,581 INFO L225 Difference]: With dead ends: 30977 [2019-09-08 04:35:16,582 INFO L226 Difference]: Without dead ends: 15824 [2019-09-08 04:35:16,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:35:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15824 states. [2019-09-08 04:35:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15824 to 15344. [2019-09-08 04:35:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15344 states. [2019-09-08 04:35:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15344 states to 15344 states and 24512 transitions. [2019-09-08 04:35:17,487 INFO L78 Accepts]: Start accepts. Automaton has 15344 states and 24512 transitions. Word has length 251 [2019-09-08 04:35:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:17,487 INFO L475 AbstractCegarLoop]: Abstraction has 15344 states and 24512 transitions. [2019-09-08 04:35:17,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:35:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 15344 states and 24512 transitions. [2019-09-08 04:35:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 04:35:17,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:17,516 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:17,516 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2001097422, now seen corresponding path program 1 times [2019-09-08 04:35:17,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:17,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:17,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:35:18,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:18,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 04:35:18,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 04:35:18,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 04:35:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-09-08 04:35:18,119 INFO L87 Difference]: Start difference. First operand 15344 states and 24512 transitions. Second operand 30 states. [2019-09-08 04:35:18,540 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-09-08 04:35:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:19,669 INFO L93 Difference]: Finished difference Result 26800 states and 42877 transitions. [2019-09-08 04:35:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:35:19,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 259 [2019-09-08 04:35:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:19,752 INFO L225 Difference]: With dead ends: 26800 [2019-09-08 04:35:19,753 INFO L226 Difference]: Without dead ends: 15805 [2019-09-08 04:35:19,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:35:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15805 states. [2019-09-08 04:35:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15805 to 15804. [2019-09-08 04:35:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15804 states. [2019-09-08 04:35:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15804 states to 15804 states and 25132 transitions. [2019-09-08 04:35:20,597 INFO L78 Accepts]: Start accepts. Automaton has 15804 states and 25132 transitions. Word has length 259 [2019-09-08 04:35:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:20,597 INFO L475 AbstractCegarLoop]: Abstraction has 15804 states and 25132 transitions. [2019-09-08 04:35:20,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 04:35:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 15804 states and 25132 transitions. [2019-09-08 04:35:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 04:35:20,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:20,623 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:20,623 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:20,624 INFO L82 PathProgramCache]: Analyzing trace with hash -428730896, now seen corresponding path program 1 times [2019-09-08 04:35:20,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:20,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:20,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:20,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:20,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:35:20,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:20,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:35:20,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:35:20,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:35:20,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:35:20,799 INFO L87 Difference]: Start difference. First operand 15804 states and 25132 transitions. Second operand 5 states. [2019-09-08 04:35:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:21,281 INFO L93 Difference]: Finished difference Result 27538 states and 43914 transitions. [2019-09-08 04:35:21,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:35:21,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 256 [2019-09-08 04:35:21,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:21,351 INFO L225 Difference]: With dead ends: 27538 [2019-09-08 04:35:21,351 INFO L226 Difference]: Without dead ends: 16131 [2019-09-08 04:35:21,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:35:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16131 states. [2019-09-08 04:35:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16131 to 15950. [2019-09-08 04:35:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15950 states. [2019-09-08 04:35:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15950 states to 15950 states and 25313 transitions. [2019-09-08 04:35:22,237 INFO L78 Accepts]: Start accepts. Automaton has 15950 states and 25313 transitions. Word has length 256 [2019-09-08 04:35:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:22,238 INFO L475 AbstractCegarLoop]: Abstraction has 15950 states and 25313 transitions. [2019-09-08 04:35:22,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:35:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15950 states and 25313 transitions. [2019-09-08 04:35:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 04:35:22,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:22,269 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:22,269 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2064899592, now seen corresponding path program 1 times [2019-09-08 04:35:22,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:22,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:22,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:35:22,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:22,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:35:22,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:35:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:35:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:35:22,475 INFO L87 Difference]: Start difference. First operand 15950 states and 25313 transitions. Second operand 5 states. [2019-09-08 04:35:22,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:22,888 INFO L93 Difference]: Finished difference Result 25146 states and 39198 transitions. [2019-09-08 04:35:22,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:35:22,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2019-09-08 04:35:22,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:22,930 INFO L225 Difference]: With dead ends: 25146 [2019-09-08 04:35:22,931 INFO L226 Difference]: Without dead ends: 13476 [2019-09-08 04:35:22,981 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 04:35:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13476 states. [2019-09-08 04:35:23,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13476 to 13466. [2019-09-08 04:35:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13466 states. [2019-09-08 04:35:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13466 states to 13466 states and 21262 transitions. [2019-09-08 04:35:23,913 INFO L78 Accepts]: Start accepts. Automaton has 13466 states and 21262 transitions. Word has length 258 [2019-09-08 04:35:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:23,914 INFO L475 AbstractCegarLoop]: Abstraction has 13466 states and 21262 transitions. [2019-09-08 04:35:23,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:35:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13466 states and 21262 transitions. [2019-09-08 04:35:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-08 04:35:23,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:23,938 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:23,938 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:23,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1744049062, now seen corresponding path program 1 times [2019-09-08 04:35:23,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:23,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:35:24,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:35:24,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:35:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:35:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:35:24,128 INFO L87 Difference]: Start difference. First operand 13466 states and 21262 transitions. Second operand 6 states. [2019-09-08 04:35:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:25,632 INFO L93 Difference]: Finished difference Result 36200 states and 57902 transitions. [2019-09-08 04:35:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:35:25,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 257 [2019-09-08 04:35:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:25,757 INFO L225 Difference]: With dead ends: 36200 [2019-09-08 04:35:25,757 INFO L226 Difference]: Without dead ends: 27027 [2019-09-08 04:35:25,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:35:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27027 states. [2019-09-08 04:35:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27027 to 26697. [2019-09-08 04:35:27,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26697 states. [2019-09-08 04:35:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26697 states to 26697 states and 42774 transitions. [2019-09-08 04:35:27,126 INFO L78 Accepts]: Start accepts. Automaton has 26697 states and 42774 transitions. Word has length 257 [2019-09-08 04:35:27,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:27,126 INFO L475 AbstractCegarLoop]: Abstraction has 26697 states and 42774 transitions. [2019-09-08 04:35:27,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:35:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand 26697 states and 42774 transitions. [2019-09-08 04:35:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-09-08 04:35:27,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:27,164 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:27,164 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash 811807764, now seen corresponding path program 1 times [2019-09-08 04:35:27,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:27,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:35:27,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:27,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:35:27,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:35:27,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:35:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:35:27,355 INFO L87 Difference]: Start difference. First operand 26697 states and 42774 transitions. Second operand 10 states. [2019-09-08 04:35:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:27,850 INFO L93 Difference]: Finished difference Result 26796 states and 42920 transitions. [2019-09-08 04:35:27,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:35:27,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 263 [2019-09-08 04:35:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:27,954 INFO L225 Difference]: With dead ends: 26796 [2019-09-08 04:35:27,955 INFO L226 Difference]: Without dead ends: 26793 [2019-09-08 04:35:27,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:35:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26793 states. [2019-09-08 04:35:29,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26793 to 26793. [2019-09-08 04:35:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26793 states. [2019-09-08 04:35:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26793 states to 26793 states and 42854 transitions. [2019-09-08 04:35:29,955 INFO L78 Accepts]: Start accepts. Automaton has 26793 states and 42854 transitions. Word has length 263 [2019-09-08 04:35:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:29,955 INFO L475 AbstractCegarLoop]: Abstraction has 26793 states and 42854 transitions. [2019-09-08 04:35:29,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:35:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 26793 states and 42854 transitions. [2019-09-08 04:35:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 04:35:29,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:29,985 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:29,985 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash -157253147, now seen corresponding path program 1 times [2019-09-08 04:35:29,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:29,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:29,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:29,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 04:35:30,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:30,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:35:30,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:35:30,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:35:30,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:35:30,191 INFO L87 Difference]: Start difference. First operand 26793 states and 42854 transitions. Second operand 8 states. [2019-09-08 04:35:36,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:36,174 INFO L93 Difference]: Finished difference Result 80945 states and 137704 transitions. [2019-09-08 04:35:36,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:35:36,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 278 [2019-09-08 04:35:36,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:36,462 INFO L225 Difference]: With dead ends: 80945 [2019-09-08 04:35:36,463 INFO L226 Difference]: Without dead ends: 54241 [2019-09-08 04:35:36,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:35:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54241 states. [2019-09-08 04:35:39,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54241 to 35637. [2019-09-08 04:35:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35637 states. [2019-09-08 04:35:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35637 states to 35637 states and 62912 transitions. [2019-09-08 04:35:40,007 INFO L78 Accepts]: Start accepts. Automaton has 35637 states and 62912 transitions. Word has length 278 [2019-09-08 04:35:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:40,007 INFO L475 AbstractCegarLoop]: Abstraction has 35637 states and 62912 transitions. [2019-09-08 04:35:40,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:35:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 35637 states and 62912 transitions. [2019-09-08 04:35:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 04:35:40,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:40,123 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:40,123 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash 489909110, now seen corresponding path program 1 times [2019-09-08 04:35:40,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:40,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:40,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 04:35:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:35:40,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:35:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:35:40,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:35:40,343 INFO L87 Difference]: Start difference. First operand 35637 states and 62912 transitions. Second operand 8 states. [2019-09-08 04:35:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:47,891 INFO L93 Difference]: Finished difference Result 108281 states and 207394 transitions. [2019-09-08 04:35:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:35:47,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 279 [2019-09-08 04:35:47,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:48,383 INFO L225 Difference]: With dead ends: 108281 [2019-09-08 04:35:48,384 INFO L226 Difference]: Without dead ends: 72733 [2019-09-08 04:35:48,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:35:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72733 states. [2019-09-08 04:35:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72733 to 53505. [2019-09-08 04:35:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53505 states. [2019-09-08 04:35:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53505 states to 53505 states and 107360 transitions. [2019-09-08 04:35:53,538 INFO L78 Accepts]: Start accepts. Automaton has 53505 states and 107360 transitions. Word has length 279 [2019-09-08 04:35:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:35:53,538 INFO L475 AbstractCegarLoop]: Abstraction has 53505 states and 107360 transitions. [2019-09-08 04:35:53,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:35:53,539 INFO L276 IsEmpty]: Start isEmpty. Operand 53505 states and 107360 transitions. [2019-09-08 04:35:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 04:35:53,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:35:53,732 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:35:53,732 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:35:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:35:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash -559903615, now seen corresponding path program 1 times [2019-09-08 04:35:53,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:35:53,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:35:53,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:53,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:35:53,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:35:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:35:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-08 04:35:53,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:35:53,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:35:53,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:35:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:35:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:35:53,914 INFO L87 Difference]: Start difference. First operand 53505 states and 107360 transitions. Second operand 8 states. [2019-09-08 04:36:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:36:04,126 INFO L93 Difference]: Finished difference Result 163361 states and 359704 transitions. [2019-09-08 04:36:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:36:04,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 280 [2019-09-08 04:36:04,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:36:04,848 INFO L225 Difference]: With dead ends: 163361 [2019-09-08 04:36:04,848 INFO L226 Difference]: Without dead ends: 109945 [2019-09-08 04:36:05,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:36:05,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109945 states. [2019-09-08 04:36:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109945 to 89433. [2019-09-08 04:36:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89433 states. [2019-09-08 04:36:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89433 states to 89433 states and 204710 transitions. [2019-09-08 04:36:11,067 INFO L78 Accepts]: Start accepts. Automaton has 89433 states and 204710 transitions. Word has length 280 [2019-09-08 04:36:11,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:36:11,067 INFO L475 AbstractCegarLoop]: Abstraction has 89433 states and 204710 transitions. [2019-09-08 04:36:11,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:36:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand 89433 states and 204710 transitions. [2019-09-08 04:36:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 04:36:11,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:36:11,565 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:36:11,565 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:36:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:36:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash 992734491, now seen corresponding path program 1 times [2019-09-08 04:36:11,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:36:11,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:36:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:36:11,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:36:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:36:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:36:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 04:36:11,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:36:11,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:36:11,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:36:11,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:36:11,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:36:11,747 INFO L87 Difference]: Start difference. First operand 89433 states and 204710 transitions. Second operand 8 states. [2019-09-08 04:36:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:36:21,359 INFO L93 Difference]: Finished difference Result 198740 states and 445941 transitions. [2019-09-08 04:36:21,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:36:21,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 276 [2019-09-08 04:36:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:36:22,295 INFO L225 Difference]: With dead ends: 198740 [2019-09-08 04:36:22,295 INFO L226 Difference]: Without dead ends: 180360 [2019-09-08 04:36:22,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:36:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180360 states. [2019-09-08 04:36:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180360 to 180209. [2019-09-08 04:36:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180209 states. [2019-09-08 04:36:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180209 states to 180209 states and 415527 transitions. [2019-09-08 04:36:35,932 INFO L78 Accepts]: Start accepts. Automaton has 180209 states and 415527 transitions. Word has length 276 [2019-09-08 04:36:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:36:35,932 INFO L475 AbstractCegarLoop]: Abstraction has 180209 states and 415527 transitions. [2019-09-08 04:36:35,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:36:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 180209 states and 415527 transitions. [2019-09-08 04:36:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:36:36,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:36:36,972 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:36:36,973 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:36:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:36:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2007281477, now seen corresponding path program 1 times [2019-09-08 04:36:36,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:36:36,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:36:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:36:36,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:36:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:36:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:36:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 04:36:37,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:36:37,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:36:37,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:36:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:36:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:36:37,234 INFO L87 Difference]: Start difference. First operand 180209 states and 415527 transitions. Second operand 15 states. [2019-09-08 04:36:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:36:51,075 INFO L93 Difference]: Finished difference Result 209297 states and 463424 transitions. [2019-09-08 04:36:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 04:36:51,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2019-09-08 04:36:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:36:52,067 INFO L225 Difference]: With dead ends: 209297 [2019-09-08 04:36:52,067 INFO L226 Difference]: Without dead ends: 179990 [2019-09-08 04:36:52,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 04:36:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179990 states. [2019-09-08 04:37:08,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179990 to 179316. [2019-09-08 04:37:08,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179316 states. [2019-09-08 04:37:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179316 states to 179316 states and 413440 transitions. [2019-09-08 04:37:09,637 INFO L78 Accepts]: Start accepts. Automaton has 179316 states and 413440 transitions. Word has length 277 [2019-09-08 04:37:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:37:09,638 INFO L475 AbstractCegarLoop]: Abstraction has 179316 states and 413440 transitions. [2019-09-08 04:37:09,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:37:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 179316 states and 413440 transitions. [2019-09-08 04:37:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 04:37:17,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:37:17,552 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:37:17,552 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:37:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:37:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1451485010, now seen corresponding path program 1 times [2019-09-08 04:37:17,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:37:17,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:37:17,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:37:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:37:17,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:37:17,737 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:37:17,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:37:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:18,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 3359 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:37:18,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:37:18,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:37:18,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:37:18,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-08 04:37:18,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:37:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:37:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:37:18,417 INFO L87 Difference]: Start difference. First operand 179316 states and 413440 transitions. Second operand 13 states. [2019-09-08 04:37:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:37:31,751 INFO L93 Difference]: Finished difference Result 370450 states and 846718 transitions. [2019-09-08 04:37:31,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:37:31,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 277 [2019-09-08 04:37:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:37:32,842 INFO L225 Difference]: With dead ends: 370450 [2019-09-08 04:37:32,842 INFO L226 Difference]: Without dead ends: 191246 [2019-09-08 04:37:33,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:37:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191246 states. [2019-09-08 04:37:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191246 to 190064. [2019-09-08 04:37:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190064 states. [2019-09-08 04:37:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190064 states to 190064 states and 428281 transitions. [2019-09-08 04:37:53,365 INFO L78 Accepts]: Start accepts. Automaton has 190064 states and 428281 transitions. Word has length 277 [2019-09-08 04:37:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:37:53,366 INFO L475 AbstractCegarLoop]: Abstraction has 190064 states and 428281 transitions. [2019-09-08 04:37:53,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:37:53,366 INFO L276 IsEmpty]: Start isEmpty. Operand 190064 states and 428281 transitions. [2019-09-08 04:37:54,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 04:37:54,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:37:54,377 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:37:54,377 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:37:54,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:37:54,377 INFO L82 PathProgramCache]: Analyzing trace with hash 23430055, now seen corresponding path program 1 times [2019-09-08 04:37:54,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:37:54,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:37:54,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:54,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:37:54,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:54,593 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 04:37:54,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:37:54,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:37:54,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:37:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:37:54,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:37:54,595 INFO L87 Difference]: Start difference. First operand 190064 states and 428281 transitions. Second operand 6 states. [2019-09-08 04:38:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:38:16,413 INFO L93 Difference]: Finished difference Result 429648 states and 937901 transitions. [2019-09-08 04:38:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:38:16,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 303 [2019-09-08 04:38:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:38:24,916 INFO L225 Difference]: With dead ends: 429648 [2019-09-08 04:38:24,916 INFO L226 Difference]: Without dead ends: 381724 [2019-09-08 04:38:25,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:38:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381724 states. [2019-09-08 04:38:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381724 to 381113. [2019-09-08 04:38:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381113 states. [2019-09-08 04:39:02,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381113 states to 381113 states and 859235 transitions. [2019-09-08 04:39:02,474 INFO L78 Accepts]: Start accepts. Automaton has 381113 states and 859235 transitions. Word has length 303 [2019-09-08 04:39:02,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:39:02,475 INFO L475 AbstractCegarLoop]: Abstraction has 381113 states and 859235 transitions. [2019-09-08 04:39:02,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:39:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 381113 states and 859235 transitions. [2019-09-08 04:39:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 04:39:06,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:39:06,823 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:06,823 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:39:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:39:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash 626127443, now seen corresponding path program 1 times [2019-09-08 04:39:06,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:39:06,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:39:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:06,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:39:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:39:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:39:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:39:07,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:39:07,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 04:39:07,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 04:39:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 04:39:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-09-08 04:39:07,177 INFO L87 Difference]: Start difference. First operand 381113 states and 859235 transitions. Second operand 21 states. [2019-09-08 04:39:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:39:37,893 INFO L93 Difference]: Finished difference Result 551210 states and 1213365 transitions. [2019-09-08 04:39:37,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 04:39:37,893 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 302 [2019-09-08 04:39:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:39:40,467 INFO L225 Difference]: With dead ends: 551210 [2019-09-08 04:39:40,467 INFO L226 Difference]: Without dead ends: 528419 [2019-09-08 04:39:40,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=2518, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 04:39:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528419 states. [2019-09-08 04:40:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528419 to 527245. [2019-09-08 04:40:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527245 states. [2019-09-08 04:40:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527245 states to 527245 states and 1175769 transitions. [2019-09-08 04:40:52,957 INFO L78 Accepts]: Start accepts. Automaton has 527245 states and 1175769 transitions. Word has length 302 [2019-09-08 04:40:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:40:52,958 INFO L475 AbstractCegarLoop]: Abstraction has 527245 states and 1175769 transitions. [2019-09-08 04:40:52,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 04:40:52,958 INFO L276 IsEmpty]: Start isEmpty. Operand 527245 states and 1175769 transitions. [2019-09-08 04:40:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 04:40:57,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:40:57,334 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:40:57,334 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:40:57,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:40:57,335 INFO L82 PathProgramCache]: Analyzing trace with hash -731164123, now seen corresponding path program 1 times [2019-09-08 04:40:57,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:40:57,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:40:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:57,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:40:57,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:40:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:41:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 04:41:08,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:41:08,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:41:08,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:41:08,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:41:08,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:41:08,227 INFO L87 Difference]: Start difference. First operand 527245 states and 1175769 transitions. Second operand 7 states. [2019-09-08 04:42:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:42:22,876 INFO L93 Difference]: Finished difference Result 1127299 states and 2925003 transitions. [2019-09-08 04:42:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:42:22,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 305 [2019-09-08 04:42:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:42:30,790 INFO L225 Difference]: With dead ends: 1127299 [2019-09-08 04:42:30,791 INFO L226 Difference]: Without dead ends: 1062382 [2019-09-08 04:42:31,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:42:32,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062382 states.