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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec7_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:45:00,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:45:00,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:45:00,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:45:00,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:45:00,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:45:00,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:45:00,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:45:00,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:45:00,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:45:00,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:45:00,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:45:00,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:45:00,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:45:00,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:45:00,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:45:00,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:45:00,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:45:00,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:45:00,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:45:00,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:45:00,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:45:00,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:45:00,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:45:00,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:45:00,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:45:00,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:45:00,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:45:00,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:45:00,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:45:00,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:45:00,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:45:00,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:45:00,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:45:00,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:45:00,650 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:45:00,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:45:00,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:45:00,651 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:45:00,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:45:00,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:45:00,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 02:45:00,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:45:00,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:45:00,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:45:00,677 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:45:00,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:45:00,678 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:45:00,678 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:45:00,679 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:45:00,679 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:45:00,679 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:45:00,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:45:00,681 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:45:00,682 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:45:00,682 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:45:00,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:45:00,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:45:00,683 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:45:00,683 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:45:00,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:45:00,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:45:00,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:45:00,684 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:45:00,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:45:00,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:45:00,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:45:00,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:45:00,685 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:45:00,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:45:00,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:45:00,685 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:45:00,728 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:45:00,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:45:00,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:45:00,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:45:00,750 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:45:00,751 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product32.cil.c [2019-09-10 02:45:00,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa02d2054/c8aa2ad0c0d64b188932f914a48b2ee2/FLAGeaf848656 [2019-09-10 02:45:01,387 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:45:01,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product32.cil.c [2019-09-10 02:45:01,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa02d2054/c8aa2ad0c0d64b188932f914a48b2ee2/FLAGeaf848656 [2019-09-10 02:45:01,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa02d2054/c8aa2ad0c0d64b188932f914a48b2ee2 [2019-09-10 02:45:01,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:45:01,633 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:45:01,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:45:01,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:45:01,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:45:01,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:45:01" (1/1) ... [2019-09-10 02:45:01,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2337e66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:01, skipping insertion in model container [2019-09-10 02:45:01,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:45:01" (1/1) ... [2019-09-10 02:45:01,649 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:45:01,736 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:45:02,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:45:02,476 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:45:02,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:45:02,754 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:45:02,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02 WrapperNode [2019-09-10 02:45:02,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:45:02,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:45:02,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:45:02,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:45:02,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,871 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (1/1) ... [2019-09-10 02:45:02,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:45:02,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:45:02,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:45:02,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:45:02,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (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-10 02:45:03,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:45:03,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:45:03,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-10 02:45:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-10 02:45:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-10 02:45:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-09-10 02:45:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-10 02:45:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-10 02:45:03,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-10 02:45:03,047 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-10 02:45:03,047 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-10 02:45:03,047 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-10 02:45:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-10 02:45:03,048 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-10 02:45:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-10 02:45:03,049 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-10 02:45:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-10 02:45:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-10 02:45:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-10 02:45:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:45:03,050 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-10 02:45:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-10 02:45:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-10 02:45:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-10 02:45:03,051 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-10 02:45:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-10 02:45:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-10 02:45:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-10 02:45:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-10 02:45:03,052 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-10 02:45:03,053 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-10 02:45:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-10 02:45:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-10 02:45:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-10 02:45:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-10 02:45:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-10 02:45:03,054 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-10 02:45:03,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-10 02:45:03,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-10 02:45:03,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-10 02:45:03,055 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-10 02:45:03,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-10 02:45:03,056 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-10 02:45:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-10 02:45:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-10 02:45:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-10 02:45:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-10 02:45:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-10 02:45:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-10 02:45:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-10 02:45:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-10 02:45:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-10 02:45:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-10 02:45:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-10 02:45:03,059 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-10 02:45:03,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-10 02:45:03,060 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-10 02:45:03,061 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-10 02:45:03,061 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-10 02:45:03,061 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-10 02:45:03,061 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-10 02:45:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-10 02:45:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-10 02:45:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-10 02:45:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-10 02:45:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-10 02:45:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-10 02:45:03,063 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-10 02:45:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-10 02:45:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-10 02:45:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-10 02:45:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-10 02:45:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-10 02:45:03,064 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-10 02:45:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-10 02:45:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-10 02:45:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-10 02:45:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-10 02:45:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-10 02:45:03,065 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-10 02:45:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-10 02:45:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-10 02:45:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-10 02:45:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-10 02:45:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-10 02:45:03,066 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-10 02:45:03,067 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-10 02:45:03,068 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-10 02:45:03,068 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-10 02:45:03,068 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-10 02:45:03,068 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-10 02:45:03,069 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-10 02:45:03,069 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-10 02:45:03,069 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-10 02:45:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:45:03,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:45:03,071 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-10 02:45:03,071 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-10 02:45:03,071 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-10 02:45:03,072 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-10 02:45:03,072 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-10 02:45:03,073 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-10 02:45:03,073 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-10 02:45:03,073 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-10 02:45:03,073 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-10 02:45:03,073 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-10 02:45:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-10 02:45:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-10 02:45:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-10 02:45:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-10 02:45:03,074 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-10 02:45:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-10 02:45:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 02:45:03,075 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-10 02:45:03,076 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-09-10 02:45:03,079 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-10 02:45:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-10 02:45:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-10 02:45:03,080 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-10 02:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-10 02:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-10 02:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-10 02:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-10 02:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-10 02:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-10 02:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-10 02:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-10 02:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-10 02:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-10 02:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-10 02:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-10 02:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-10 02:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-10 02:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-10 02:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-10 02:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-10 02:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-10 02:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-10 02:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-10 02:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-10 02:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-10 02:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-10 02:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-10 02:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-10 02:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-10 02:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-10 02:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-10 02:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-10 02:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-10 02:45:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-10 02:45:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-10 02:45:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-10 02:45:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-10 02:45:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-10 02:45:03,094 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-10 02:45:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-10 02:45:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-10 02:45:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-10 02:45:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-10 02:45:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-10 02:45:03,095 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 02:45:03,096 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-10 02:45:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 02:45:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-10 02:45:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-10 02:45:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 02:45:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-10 02:45:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-10 02:45:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-10 02:45:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-10 02:45:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-10 02:45:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-10 02:45:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-10 02:45:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-10 02:45:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-10 02:45:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-10 02:45:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-10 02:45:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-10 02:45:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-10 02:45:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-10 02:45:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-10 02:45:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-10 02:45:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-10 02:45:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-10 02:45:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-10 02:45:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-10 02:45:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-10 02:45:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-10 02:45:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-10 02:45:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-10 02:45:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-10 02:45:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-10 02:45:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-10 02:45:03,103 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-10 02:45:03,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:45:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 02:45:03,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:45:05,036 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:45:05,036 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-10 02:45:05,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:45:05 BoogieIcfgContainer [2019-09-10 02:45:05,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:45:05,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:45:05,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:45:05,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:45:05,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:45:01" (1/3) ... [2019-09-10 02:45:05,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:45:05, skipping insertion in model container [2019-09-10 02:45:05,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:45:02" (2/3) ... [2019-09-10 02:45:05,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c11b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:45:05, skipping insertion in model container [2019-09-10 02:45:05,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:45:05" (3/3) ... [2019-09-10 02:45:05,048 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product32.cil.c [2019-09-10 02:45:05,058 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:45:05,072 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:45:05,093 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:45:05,123 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:45:05,124 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:45:05,124 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:45:05,124 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:45:05,128 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:45:05,128 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:45:05,128 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:45:05,128 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:45:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states. [2019-09-10 02:45:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-10 02:45:05,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:05,206 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:05,209 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash -311164788, now seen corresponding path program 1 times [2019-09-10 02:45:05,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:05,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:05,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:05,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:05,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:05,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:05,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-10 02:45:05,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:05,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:45:05,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:45:05,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:45:05,827 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 2 states. [2019-09-10 02:45:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:05,889 INFO L93 Difference]: Finished difference Result 585 states and 797 transitions. [2019-09-10 02:45:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:45:05,891 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-09-10 02:45:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:05,913 INFO L225 Difference]: With dead ends: 585 [2019-09-10 02:45:05,914 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 02:45:05,915 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-10 02:45:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 02:45:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-09-10 02:45:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-09-10 02:45:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 786 transitions. [2019-09-10 02:45:06,013 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 786 transitions. Word has length 191 [2019-09-10 02:45:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:06,016 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 786 transitions. [2019-09-10 02:45:06,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:45:06,016 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 786 transitions. [2019-09-10 02:45:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-10 02:45:06,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:06,021 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:06,022 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 544104814, now seen corresponding path program 1 times [2019-09-10 02:45:06,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:06,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:06,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:06,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:06,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:06,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:06,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:06,218 INFO L87 Difference]: Start difference. First operand 576 states and 786 transitions. Second operand 3 states. [2019-09-10 02:45:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:06,263 INFO L93 Difference]: Finished difference Result 579 states and 789 transitions. [2019-09-10 02:45:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:06,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-09-10 02:45:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:06,274 INFO L225 Difference]: With dead ends: 579 [2019-09-10 02:45:06,274 INFO L226 Difference]: Without dead ends: 579 [2019-09-10 02:45:06,275 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-10 02:45:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-09-10 02:45:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2019-09-10 02:45:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-09-10 02:45:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 788 transitions. [2019-09-10 02:45:06,317 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 788 transitions. Word has length 192 [2019-09-10 02:45:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:06,317 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 788 transitions. [2019-09-10 02:45:06,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 788 transitions. [2019-09-10 02:45:06,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-10 02:45:06,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:06,325 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:06,325 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1874665950, now seen corresponding path program 1 times [2019-09-10 02:45:06,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:06,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:06,541 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:06,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:06,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:06,545 INFO L87 Difference]: Start difference. First operand 578 states and 788 transitions. Second operand 3 states. [2019-09-10 02:45:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:06,581 INFO L93 Difference]: Finished difference Result 621 states and 861 transitions. [2019-09-10 02:45:06,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:06,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-09-10 02:45:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:06,588 INFO L225 Difference]: With dead ends: 621 [2019-09-10 02:45:06,588 INFO L226 Difference]: Without dead ends: 621 [2019-09-10 02:45:06,589 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-10 02:45:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-10 02:45:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-09-10 02:45:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-10 02:45:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 860 transitions. [2019-09-10 02:45:06,623 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 860 transitions. Word has length 202 [2019-09-10 02:45:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:06,624 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 860 transitions. [2019-09-10 02:45:06,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 860 transitions. [2019-09-10 02:45:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 02:45:06,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:06,632 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:45:06,632 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash -620463334, now seen corresponding path program 1 times [2019-09-10 02:45:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:06,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:06,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:06,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:06,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:06,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:06,832 INFO L87 Difference]: Start difference. First operand 620 states and 860 transitions. Second operand 3 states. [2019-09-10 02:45:06,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:06,853 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-09-10 02:45:06,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:06,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-09-10 02:45:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:06,858 INFO L225 Difference]: With dead ends: 702 [2019-09-10 02:45:06,858 INFO L226 Difference]: Without dead ends: 702 [2019-09-10 02:45:06,859 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-10 02:45:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-10 02:45:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 701. [2019-09-10 02:45:06,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-10 02:45:06,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 998 transitions. [2019-09-10 02:45:06,885 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 998 transitions. Word has length 203 [2019-09-10 02:45:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:06,886 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 998 transitions. [2019-09-10 02:45:06,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:06,886 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 998 transitions. [2019-09-10 02:45:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-10 02:45:06,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:06,891 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-10 02:45:06,891 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:06,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1948319678, now seen corresponding path program 1 times [2019-09-10 02:45:06,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:06,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:07,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:07,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:07,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:07,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:07,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:07,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:07,108 INFO L87 Difference]: Start difference. First operand 701 states and 998 transitions. Second operand 3 states. [2019-09-10 02:45:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:07,133 INFO L93 Difference]: Finished difference Result 858 states and 1263 transitions. [2019-09-10 02:45:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:07,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-09-10 02:45:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:07,139 INFO L225 Difference]: With dead ends: 858 [2019-09-10 02:45:07,139 INFO L226 Difference]: Without dead ends: 858 [2019-09-10 02:45:07,140 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-10 02:45:07,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-09-10 02:45:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 857. [2019-09-10 02:45:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-10 02:45:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1262 transitions. [2019-09-10 02:45:07,170 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1262 transitions. Word has length 204 [2019-09-10 02:45:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:07,171 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1262 transitions. [2019-09-10 02:45:07,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1262 transitions. [2019-09-10 02:45:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-10 02:45:07,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:07,178 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:07,178 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:07,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:07,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1879306950, now seen corresponding path program 1 times [2019-09-10 02:45:07,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:07,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:07,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:07,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:07,324 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:07,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:07,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:07,325 INFO L87 Difference]: Start difference. First operand 857 states and 1262 transitions. Second operand 3 states. [2019-09-10 02:45:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:07,348 INFO L93 Difference]: Finished difference Result 1158 states and 1767 transitions. [2019-09-10 02:45:07,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:07,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-10 02:45:07,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:07,356 INFO L225 Difference]: With dead ends: 1158 [2019-09-10 02:45:07,356 INFO L226 Difference]: Without dead ends: 1158 [2019-09-10 02:45:07,357 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-10 02:45:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-10 02:45:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2019-09-10 02:45:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-09-10 02:45:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1766 transitions. [2019-09-10 02:45:07,390 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1766 transitions. Word has length 205 [2019-09-10 02:45:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:07,390 INFO L475 AbstractCegarLoop]: Abstraction has 1157 states and 1766 transitions. [2019-09-10 02:45:07,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1766 transitions. [2019-09-10 02:45:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-10 02:45:07,397 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:07,397 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:07,397 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:07,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:07,398 INFO L82 PathProgramCache]: Analyzing trace with hash -59408994, now seen corresponding path program 1 times [2019-09-10 02:45:07,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:45:07,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:07,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 02:45:07,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:07,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 02:45:07,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 02:45:07,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 02:45:07,607 INFO L87 Difference]: Start difference. First operand 1157 states and 1766 transitions. Second operand 3 states. [2019-09-10 02:45:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:07,634 INFO L93 Difference]: Finished difference Result 1734 states and 2727 transitions. [2019-09-10 02:45:07,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 02:45:07,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-09-10 02:45:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:07,645 INFO L225 Difference]: With dead ends: 1734 [2019-09-10 02:45:07,645 INFO L226 Difference]: Without dead ends: 1734 [2019-09-10 02:45:07,646 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-10 02:45:07,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-09-10 02:45:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1733. [2019-09-10 02:45:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-09-10 02:45:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2726 transitions. [2019-09-10 02:45:07,712 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2726 transitions. Word has length 206 [2019-09-10 02:45:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:07,713 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2726 transitions. [2019-09-10 02:45:07,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 02:45:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2726 transitions. [2019-09-10 02:45:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-10 02:45:07,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:07,724 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:07,725 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:07,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1504076601, now seen corresponding path program 1 times [2019-09-10 02:45:07,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:07,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:07,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:08,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:08,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-10 02:45:08,243 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:08,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 02:45:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 02:45:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-10 02:45:08,245 INFO L87 Difference]: Start difference. First operand 1733 states and 2726 transitions. Second operand 19 states. [2019-09-10 02:45:13,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:13,714 INFO L93 Difference]: Finished difference Result 4073 states and 6429 transitions. [2019-09-10 02:45:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-10 02:45:13,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 208 [2019-09-10 02:45:13,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:13,742 INFO L225 Difference]: With dead ends: 4073 [2019-09-10 02:45:13,742 INFO L226 Difference]: Without dead ends: 4073 [2019-09-10 02:45:13,744 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-10 02:45:13,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-09-10 02:45:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 4036. [2019-09-10 02:45:13,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2019-09-10 02:45:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 6377 transitions. [2019-09-10 02:45:13,960 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 6377 transitions. Word has length 208 [2019-09-10 02:45:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:13,961 INFO L475 AbstractCegarLoop]: Abstraction has 4036 states and 6377 transitions. [2019-09-10 02:45:13,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 02:45:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 6377 transitions. [2019-09-10 02:45:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:13,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:13,988 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10 02:45:13,988 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash 499285188, now seen corresponding path program 1 times [2019-09-10 02:45:13,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:13,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:13,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:13,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:14,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:14,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 02:45:14,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:14,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:45:14,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:45:14,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:14,357 INFO L87 Difference]: Start difference. First operand 4036 states and 6377 transitions. Second operand 13 states. [2019-09-10 02:45:14,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:14,918 INFO L93 Difference]: Finished difference Result 4186 states and 6623 transitions. [2019-09-10 02:45:14,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:45:14,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 209 [2019-09-10 02:45:14,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:14,951 INFO L225 Difference]: With dead ends: 4186 [2019-09-10 02:45:14,951 INFO L226 Difference]: Without dead ends: 4170 [2019-09-10 02:45:14,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:45:14,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-09-10 02:45:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4170. [2019-09-10 02:45:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2019-09-10 02:45:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6594 transitions. [2019-09-10 02:45:15,109 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6594 transitions. Word has length 209 [2019-09-10 02:45:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:15,110 INFO L475 AbstractCegarLoop]: Abstraction has 4170 states and 6594 transitions. [2019-09-10 02:45:15,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:45:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6594 transitions. [2019-09-10 02:45:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:15,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:15,133 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:15,133 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:15,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1211410007, now seen corresponding path program 1 times [2019-09-10 02:45:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:15,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:15,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:15,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:45:15,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:15,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:45:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:45:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:45:15,590 INFO L87 Difference]: Start difference. First operand 4170 states and 6594 transitions. Second operand 15 states. [2019-09-10 02:45:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:19,450 INFO L93 Difference]: Finished difference Result 4288 states and 6784 transitions. [2019-09-10 02:45:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 02:45:19,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 209 [2019-09-10 02:45:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:19,475 INFO L225 Difference]: With dead ends: 4288 [2019-09-10 02:45:19,475 INFO L226 Difference]: Without dead ends: 4288 [2019-09-10 02:45:19,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 02:45:19,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-09-10 02:45:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4251. [2019-09-10 02:45:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4251 states. [2019-09-10 02:45:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6732 transitions. [2019-09-10 02:45:19,607 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6732 transitions. Word has length 209 [2019-09-10 02:45:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:19,608 INFO L475 AbstractCegarLoop]: Abstraction has 4251 states and 6732 transitions. [2019-09-10 02:45:19,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:45:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6732 transitions. [2019-09-10 02:45:19,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 02:45:19,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:19,627 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:19,627 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:19,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash -2077108254, now seen corresponding path program 1 times [2019-09-10 02:45:19,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:19,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:45:19,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:19,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:19,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:19,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:19,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:19,777 INFO L87 Difference]: Start difference. First operand 4251 states and 6732 transitions. Second operand 5 states. [2019-09-10 02:45:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:19,842 INFO L93 Difference]: Finished difference Result 3870 states and 6183 transitions. [2019-09-10 02:45:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:19,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-09-10 02:45:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:19,864 INFO L225 Difference]: With dead ends: 3870 [2019-09-10 02:45:19,864 INFO L226 Difference]: Without dead ends: 3867 [2019-09-10 02:45:19,865 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-10 02:45:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2019-09-10 02:45:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3867. [2019-09-10 02:45:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3867 states. [2019-09-10 02:45:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 6179 transitions. [2019-09-10 02:45:19,977 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 6179 transitions. Word has length 212 [2019-09-10 02:45:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:19,978 INFO L475 AbstractCegarLoop]: Abstraction has 3867 states and 6179 transitions. [2019-09-10 02:45:19,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 6179 transitions. [2019-09-10 02:45:19,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:19,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:19,995 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:19,996 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:19,996 INFO L82 PathProgramCache]: Analyzing trace with hash 493886152, now seen corresponding path program 1 times [2019-09-10 02:45:19,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:19,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:19,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:19,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-10 02:45:20,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:20,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-10 02:45:20,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:20,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:45:20,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:45:20,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:45:20,309 INFO L87 Difference]: Start difference. First operand 3867 states and 6179 transitions. Second operand 18 states. [2019-09-10 02:45:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:20,829 INFO L93 Difference]: Finished difference Result 3899 states and 6210 transitions. [2019-09-10 02:45:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 02:45:20,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 209 [2019-09-10 02:45:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:20,851 INFO L225 Difference]: With dead ends: 3899 [2019-09-10 02:45:20,852 INFO L226 Difference]: Without dead ends: 3899 [2019-09-10 02:45:20,852 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-10 02:45:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-09-10 02:45:20,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3897. [2019-09-10 02:45:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2019-09-10 02:45:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 6207 transitions. [2019-09-10 02:45:20,943 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 6207 transitions. Word has length 209 [2019-09-10 02:45:20,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:20,943 INFO L475 AbstractCegarLoop]: Abstraction has 3897 states and 6207 transitions. [2019-09-10 02:45:20,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:45:20,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 6207 transitions. [2019-09-10 02:45:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:20,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:20,965 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10 02:45:20,965 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:20,966 INFO L82 PathProgramCache]: Analyzing trace with hash -216412755, now seen corresponding path program 1 times [2019-09-10 02:45:20,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:20,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:20,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:21,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:21,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:21,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:21,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:21,140 INFO L87 Difference]: Start difference. First operand 3897 states and 6207 transitions. Second operand 5 states. [2019-09-10 02:45:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:22,348 INFO L93 Difference]: Finished difference Result 7048 states and 11206 transitions. [2019-09-10 02:45:22,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:45:22,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-09-10 02:45:22,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:22,391 INFO L225 Difference]: With dead ends: 7048 [2019-09-10 02:45:22,391 INFO L226 Difference]: Without dead ends: 7048 [2019-09-10 02:45:22,391 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-10 02:45:22,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2019-09-10 02:45:22,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 7034. [2019-09-10 02:45:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7034 states. [2019-09-10 02:45:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7034 states to 7034 states and 11187 transitions. [2019-09-10 02:45:22,568 INFO L78 Accepts]: Start accepts. Automaton has 7034 states and 11187 transitions. Word has length 209 [2019-09-10 02:45:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:22,569 INFO L475 AbstractCegarLoop]: Abstraction has 7034 states and 11187 transitions. [2019-09-10 02:45:22,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7034 states and 11187 transitions. [2019-09-10 02:45:22,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-10 02:45:22,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:22,600 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10 02:45:22,601 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:22,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -196075380, now seen corresponding path program 1 times [2019-09-10 02:45:22,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:22,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:22,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:22,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:22,848 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:22,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:22,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:45:22,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:22,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:45:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:45:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:45:22,851 INFO L87 Difference]: Start difference. First operand 7034 states and 11187 transitions. Second operand 7 states. [2019-09-10 02:45:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:25,112 INFO L93 Difference]: Finished difference Result 12704 states and 20243 transitions. [2019-09-10 02:45:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 02:45:25,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-09-10 02:45:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:25,168 INFO L225 Difference]: With dead ends: 12704 [2019-09-10 02:45:25,168 INFO L226 Difference]: Without dead ends: 12704 [2019-09-10 02:45:25,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:45:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-09-10 02:45:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12694. [2019-09-10 02:45:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12694 states. [2019-09-10 02:45:25,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12694 states to 12694 states and 20229 transitions. [2019-09-10 02:45:25,553 INFO L78 Accepts]: Start accepts. Automaton has 12694 states and 20229 transitions. Word has length 209 [2019-09-10 02:45:25,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:25,553 INFO L475 AbstractCegarLoop]: Abstraction has 12694 states and 20229 transitions. [2019-09-10 02:45:25,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:45:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12694 states and 20229 transitions. [2019-09-10 02:45:25,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 02:45:25,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:25,594 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10 02:45:25,594 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash -428249634, now seen corresponding path program 1 times [2019-09-10 02:45:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:25,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:25,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:26,653 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:26,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:26,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-10 02:45:26,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:26,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-10 02:45:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-10 02:45:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-10 02:45:26,655 INFO L87 Difference]: Start difference. First operand 12694 states and 20229 transitions. Second operand 28 states. [2019-09-10 02:45:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:27,629 INFO L93 Difference]: Finished difference Result 13045 states and 20727 transitions. [2019-09-10 02:45:27,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 02:45:27,630 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 210 [2019-09-10 02:45:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:27,677 INFO L225 Difference]: With dead ends: 13045 [2019-09-10 02:45:27,677 INFO L226 Difference]: Without dead ends: 13045 [2019-09-10 02:45:27,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 02:45:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13045 states. [2019-09-10 02:45:28,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13045 to 13020. [2019-09-10 02:45:28,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-09-10 02:45:28,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 20680 transitions. [2019-09-10 02:45:28,054 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 20680 transitions. Word has length 210 [2019-09-10 02:45:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:28,054 INFO L475 AbstractCegarLoop]: Abstraction has 13020 states and 20680 transitions. [2019-09-10 02:45:28,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-10 02:45:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 20680 transitions. [2019-09-10 02:45:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-10 02:45:28,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:28,072 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:45:28,073 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:28,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:28,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1086081098, now seen corresponding path program 1 times [2019-09-10 02:45:28,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:28,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:28,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:28,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:28,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:28,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:28,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-10 02:45:28,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:28,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:45:28,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:45:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:45:28,312 INFO L87 Difference]: Start difference. First operand 13020 states and 20680 transitions. Second operand 10 states. [2019-09-10 02:45:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:28,419 INFO L93 Difference]: Finished difference Result 13116 states and 20808 transitions. [2019-09-10 02:45:28,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:45:28,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-09-10 02:45:28,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:28,472 INFO L225 Difference]: With dead ends: 13116 [2019-09-10 02:45:28,472 INFO L226 Difference]: Without dead ends: 13116 [2019-09-10 02:45:28,473 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-10 02:45:28,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13116 states. [2019-09-10 02:45:28,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13116 to 13116. [2019-09-10 02:45:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13116 states. [2019-09-10 02:45:28,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13116 states to 13116 states and 20808 transitions. [2019-09-10 02:45:28,981 INFO L78 Accepts]: Start accepts. Automaton has 13116 states and 20808 transitions. Word has length 214 [2019-09-10 02:45:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:28,982 INFO L475 AbstractCegarLoop]: Abstraction has 13116 states and 20808 transitions. [2019-09-10 02:45:28,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:45:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 13116 states and 20808 transitions. [2019-09-10 02:45:28,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-10 02:45:28,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:28,999 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-10 02:45:29,000 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:29,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -268832971, now seen corresponding path program 1 times [2019-09-10 02:45:29,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:29,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:29,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:29,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:29,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:29,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:29,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:45:29,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:29,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:45:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:45:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:45:29,136 INFO L87 Difference]: Start difference. First operand 13116 states and 20808 transitions. Second operand 5 states. [2019-09-10 02:45:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:29,225 INFO L93 Difference]: Finished difference Result 13371 states and 21536 transitions. [2019-09-10 02:45:29,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:45:29,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-09-10 02:45:29,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:29,286 INFO L225 Difference]: With dead ends: 13371 [2019-09-10 02:45:29,286 INFO L226 Difference]: Without dead ends: 13371 [2019-09-10 02:45:29,287 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-10 02:45:29,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2019-09-10 02:45:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 13220. [2019-09-10 02:45:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13220 states. [2019-09-10 02:45:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13220 states to 13220 states and 20925 transitions. [2019-09-10 02:45:29,676 INFO L78 Accepts]: Start accepts. Automaton has 13220 states and 20925 transitions. Word has length 219 [2019-09-10 02:45:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:29,677 INFO L475 AbstractCegarLoop]: Abstraction has 13220 states and 20925 transitions. [2019-09-10 02:45:29,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:45:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13220 states and 20925 transitions. [2019-09-10 02:45:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-10 02:45:29,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:29,698 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:29,698 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:29,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1699876820, now seen corresponding path program 1 times [2019-09-10 02:45:29,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:29,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 02:45:29,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:29,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 02:45:29,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:29,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:45:29,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:45:29,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 02:45:29,861 INFO L87 Difference]: Start difference. First operand 13220 states and 20925 transitions. Second operand 6 states. [2019-09-10 02:45:30,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:30,680 INFO L93 Difference]: Finished difference Result 26559 states and 43143 transitions. [2019-09-10 02:45:30,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:45:30,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2019-09-10 02:45:30,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:30,775 INFO L225 Difference]: With dead ends: 26559 [2019-09-10 02:45:30,775 INFO L226 Difference]: Without dead ends: 26559 [2019-09-10 02:45:30,775 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-10 02:45:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26559 states. [2019-09-10 02:45:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26559 to 26229. [2019-09-10 02:45:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26229 states. [2019-09-10 02:45:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 42130 transitions. [2019-09-10 02:45:31,551 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 42130 transitions. Word has length 220 [2019-09-10 02:45:31,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:31,552 INFO L475 AbstractCegarLoop]: Abstraction has 26229 states and 42130 transitions. [2019-09-10 02:45:31,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:45:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 42130 transitions. [2019-09-10 02:45:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-10 02:45:31,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:31,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:31,601 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:31,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:31,601 INFO L82 PathProgramCache]: Analyzing trace with hash -367726315, now seen corresponding path program 1 times [2019-09-10 02:45:31,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:31,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:31,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:31,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:31,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:31,828 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:31,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:31,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:45:31,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:31,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:45:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:45:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:31,832 INFO L87 Difference]: Start difference. First operand 26229 states and 42130 transitions. Second operand 8 states. [2019-09-10 02:45:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:36,793 INFO L93 Difference]: Finished difference Result 53137 states and 91489 transitions. [2019-09-10 02:45:36,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:45:36,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-09-10 02:45:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:37,009 INFO L225 Difference]: With dead ends: 53137 [2019-09-10 02:45:37,010 INFO L226 Difference]: Without dead ends: 53137 [2019-09-10 02:45:37,011 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-10 02:45:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53137 states. [2019-09-10 02:45:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53137 to 35061. [2019-09-10 02:45:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35061 states. [2019-09-10 02:45:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35061 states to 35061 states and 62176 transitions. [2019-09-10 02:45:39,214 INFO L78 Accepts]: Start accepts. Automaton has 35061 states and 62176 transitions. Word has length 256 [2019-09-10 02:45:39,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:39,214 INFO L475 AbstractCegarLoop]: Abstraction has 35061 states and 62176 transitions. [2019-09-10 02:45:39,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:45:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 35061 states and 62176 transitions. [2019-09-10 02:45:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-10 02:45:39,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:39,296 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:39,297 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -188114519, now seen corresponding path program 1 times [2019-09-10 02:45:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:39,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:39,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:39,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:39,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:45:39,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:39,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:45:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:45:39,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:39,493 INFO L87 Difference]: Start difference. First operand 35061 states and 62176 transitions. Second operand 8 states. [2019-09-10 02:45:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:44,507 INFO L93 Difference]: Finished difference Result 71605 states and 139051 transitions. [2019-09-10 02:45:44,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:45:44,508 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 257 [2019-09-10 02:45:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:44,823 INFO L225 Difference]: With dead ends: 71605 [2019-09-10 02:45:44,823 INFO L226 Difference]: Without dead ends: 71605 [2019-09-10 02:45:44,823 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-10 02:45:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71605 states. [2019-09-10 02:45:47,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71605 to 52905. [2019-09-10 02:45:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52905 states. [2019-09-10 02:45:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52905 states to 52905 states and 106600 transitions. [2019-09-10 02:45:47,697 INFO L78 Accepts]: Start accepts. Automaton has 52905 states and 106600 transitions. Word has length 257 [2019-09-10 02:45:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:47,698 INFO L475 AbstractCegarLoop]: Abstraction has 52905 states and 106600 transitions. [2019-09-10 02:45:47,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:45:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 52905 states and 106600 transitions. [2019-09-10 02:45:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-10 02:45:47,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:47,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:47,842 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:47,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1761458961, now seen corresponding path program 1 times [2019-09-10 02:45:47,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:47,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:47,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:47,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:47,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:48,073 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:48,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:48,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:45:48,074 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:48,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:45:48,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:45:48,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:48,076 INFO L87 Difference]: Start difference. First operand 52905 states and 106600 transitions. Second operand 8 states. [2019-09-10 02:45:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:45:53,353 INFO L93 Difference]: Finished difference Result 108769 states and 242773 transitions. [2019-09-10 02:45:53,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 02:45:53,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 258 [2019-09-10 02:45:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:45:53,884 INFO L225 Difference]: With dead ends: 108769 [2019-09-10 02:45:53,884 INFO L226 Difference]: Without dead ends: 108769 [2019-09-10 02:45:53,885 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-10 02:45:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108769 states. [2019-09-10 02:45:58,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108769 to 88785. [2019-09-10 02:45:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88785 states. [2019-09-10 02:45:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88785 states to 88785 states and 203902 transitions. [2019-09-10 02:45:59,013 INFO L78 Accepts]: Start accepts. Automaton has 88785 states and 203902 transitions. Word has length 258 [2019-09-10 02:45:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:45:59,013 INFO L475 AbstractCegarLoop]: Abstraction has 88785 states and 203902 transitions. [2019-09-10 02:45:59,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:45:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 88785 states and 203902 transitions. [2019-09-10 02:45:59,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 02:45:59,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:45:59,393 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 02:45:59,393 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:45:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:45:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 340432954, now seen corresponding path program 1 times [2019-09-10 02:45:59,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:45:59,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:59,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:45:59,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:45:59,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:45:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:45:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 02:45:59,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:45:59,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 02:45:59,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:45:59,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:45:59,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:45:59,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 02:45:59,573 INFO L87 Difference]: Start difference. First operand 88785 states and 203902 transitions. Second operand 8 states. [2019-09-10 02:46:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:02,910 INFO L93 Difference]: Finished difference Result 179170 states and 415066 transitions. [2019-09-10 02:46:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 02:46:02,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-09-10 02:46:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:03,784 INFO L225 Difference]: With dead ends: 179170 [2019-09-10 02:46:03,784 INFO L226 Difference]: Without dead ends: 179170 [2019-09-10 02:46:03,785 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-10 02:46:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179170 states. [2019-09-10 02:46:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179170 to 179019. [2019-09-10 02:46:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179019 states. [2019-09-10 02:46:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179019 states to 179019 states and 414841 transitions. [2019-09-10 02:46:13,472 INFO L78 Accepts]: Start accepts. Automaton has 179019 states and 414841 transitions. Word has length 239 [2019-09-10 02:46:13,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:13,473 INFO L475 AbstractCegarLoop]: Abstraction has 179019 states and 414841 transitions. [2019-09-10 02:46:13,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:46:13,473 INFO L276 IsEmpty]: Start isEmpty. Operand 179019 states and 414841 transitions. [2019-09-10 02:46:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:46:14,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:14,248 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:14,248 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1337773327, now seen corresponding path program 1 times [2019-09-10 02:46:14,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:14,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:14,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:14,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:46:14,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:14,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 02:46:14,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:14,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 02:46:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 02:46:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:46:14,537 INFO L87 Difference]: Start difference. First operand 179019 states and 414841 transitions. Second operand 15 states. [2019-09-10 02:46:23,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:23,213 INFO L93 Difference]: Finished difference Result 178788 states and 414113 transitions. [2019-09-10 02:46:23,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 02:46:23,214 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 240 [2019-09-10 02:46:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:23,956 INFO L225 Difference]: With dead ends: 178788 [2019-09-10 02:46:23,956 INFO L226 Difference]: Without dead ends: 178788 [2019-09-10 02:46:23,957 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-10 02:46:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178788 states. [2019-09-10 02:46:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178788 to 178114. [2019-09-10 02:46:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178114 states. [2019-09-10 02:46:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178114 states to 178114 states and 412730 transitions. [2019-09-10 02:46:29,851 INFO L78 Accepts]: Start accepts. Automaton has 178114 states and 412730 transitions. Word has length 240 [2019-09-10 02:46:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:46:29,851 INFO L475 AbstractCegarLoop]: Abstraction has 178114 states and 412730 transitions. [2019-09-10 02:46:29,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 02:46:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 178114 states and 412730 transitions. [2019-09-10 02:46:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:46:30,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:46:30,675 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:46:30,676 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:46:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:46:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash -225115086, now seen corresponding path program 1 times [2019-09-10 02:46:30,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:46:30,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:30,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:46:30,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:46:30,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:46:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:46:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:46:30,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:46:30,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 02:46:30,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:46:30,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:46:30,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:46:30,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 02:46:30,860 INFO L87 Difference]: Start difference. First operand 178114 states and 412730 transitions. Second operand 7 states. [2019-09-10 02:46:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:46:43,266 INFO L93 Difference]: Finished difference Result 472792 states and 1165318 transitions. [2019-09-10 02:46:43,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:46:43,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-09-10 02:46:43,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:46:52,306 INFO L225 Difference]: With dead ends: 472792 [2019-09-10 02:46:52,307 INFO L226 Difference]: Without dead ends: 472792 [2019-09-10 02:46:52,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-10 02:46:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472792 states. [2019-09-10 02:47:03,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472792 to 356975. [2019-09-10 02:47:03,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356975 states. [2019-09-10 02:47:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356975 states to 356975 states and 841205 transitions. [2019-09-10 02:47:16,242 INFO L78 Accepts]: Start accepts. Automaton has 356975 states and 841205 transitions. Word has length 240 [2019-09-10 02:47:16,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:47:16,243 INFO L475 AbstractCegarLoop]: Abstraction has 356975 states and 841205 transitions. [2019-09-10 02:47:16,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:47:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 356975 states and 841205 transitions. [2019-09-10 02:47:30,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 02:47:30,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:47:30,246 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:47:30,246 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:47:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:47:30,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2050933252, now seen corresponding path program 2 times [2019-09-10 02:47:30,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:47:30,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:30,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:47:30,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:47:30,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:47:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:47:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 02:47:30,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:47:30,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:47:30,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:47:30,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:47:30,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:47:30,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10 02:47:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:47:30,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:47:31,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:47:31,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:47:31,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 3085 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:47:31,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:47:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 02:47:31,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:47:31,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:47:31,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-10 02:47:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-10 02:47:31,867 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:47:31,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 21 [2019-09-10 02:47:31,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:47:31,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:47:31,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:47:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-09-10 02:47:31,869 INFO L87 Difference]: Start difference. First operand 356975 states and 841205 transitions. Second operand 7 states. [2019-09-10 02:47:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:47:36,975 INFO L93 Difference]: Finished difference Result 357213 states and 841546 transitions. [2019-09-10 02:47:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:47:36,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-09-10 02:47:36,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:47:38,891 INFO L225 Difference]: With dead ends: 357213 [2019-09-10 02:47:38,892 INFO L226 Difference]: Without dead ends: 357209 [2019-09-10 02:47:38,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:47:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357209 states. [2019-09-10 02:47:58,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357209 to 357209. [2019-09-10 02:47:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357209 states. [2019-09-10 02:48:10,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357209 states to 357209 states and 841540 transitions. [2019-09-10 02:48:10,832 INFO L78 Accepts]: Start accepts. Automaton has 357209 states and 841540 transitions. Word has length 240 [2019-09-10 02:48:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:10,833 INFO L475 AbstractCegarLoop]: Abstraction has 357209 states and 841540 transitions. [2019-09-10 02:48:10,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:48:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 357209 states and 841540 transitions. [2019-09-10 02:48:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 02:48:14,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:48:14,386 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:48:14,387 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:48:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1960984290, now seen corresponding path program 1 times [2019-09-10 02:48:14,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:48:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:14,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:48:14,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:48:14,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:48:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:48:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-10 02:48:14,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:48:14,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:48:14,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-09-10 02:48:14,641 INFO L207 CegarAbsIntRunner]: [66], [69], [70], [73], [79], [103], [106], [116], [117], [119], [124], [128], [144], [147], [156], [157], [160], [161], [162], [164], [246], [249], [255], [274], [276], [280], [283], [284], [285], [288], [294], [330], [332], [334], [341], [348], [351], [360], [371], [373], [376], [380], [381], [383], [384], [387], [397], [433], [472], [473], [476], [485], [492], [661], [663], [664], [665], [701], [704], [718], [757], [758], [759], [761], [764], [767], [773], [774], [776], [779], [783], [807], [811], [814], [822], [825], [856], [858], [861], [863], [866], [868], [870], [873], [889], [898], [902], [904], [906], [909], [916], [923], [926], [928], [1064], [1066], [1083], [1087], [1090], [1104], [1212], [1266], [1288], [1299], [1302], [1303], [1306], [1310], [1314], [1340], [1343], [1345], [1414], [1417], [1423], [1458], [1461], [1463], [1466], [1475], [1481], [1484], [1493], [1687], [1689], [1691], [1693], [1694], [1722], [1723], [1724], [1726], [1736], [1737], [1738], [1739], [1740], [1741], [1744], [1745], [1746], [1747], [1748], [1750], [1751], [1752], [1753], [1766], [1767], [1768], [1769], [1774], [1782], [1783], [1786], [1787], [1798], [1814], [1815], [1816], [1836], [1837], [1850], [1851], [1852], [1854], [1855], [1860], [1861], [1862], [1863], [1864], [1865], [1866], [1867], [1868], [1870], [1871], [1872], [1873], [1888], [1889], [1890], [1891], [1892], [1893], [1894], [1895], [1896], [1897], [1898], [1899], [1900], [1906], [1907], [1924], [1926], [1927], [1944], [1946], [1947], [1948], [1950], [1951], [1952], [1953], [1954], [1955], [1956], [1976], [1977], [1978], [1979], [1980], [1981], [1982], [1983], [1984] [2019-09-10 02:48:14,707 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:48:14,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:48:14,916 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 02:48:14,918 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 202 root evaluator evaluations with a maximum evaluation depth of 0. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 376 variables. [2019-09-10 02:48:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:48:14,925 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 02:48:15,074 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 02:48:15,075 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 02:48:15,086 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-09-10 02:48:15,086 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 02:48:15,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 02:48:15,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-10 02:48:15,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:48:15,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 02:48:15,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 02:48:15,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 02:48:15,090 INFO L87 Difference]: Start difference. First operand 357209 states and 841540 transitions. Second operand 2 states. [2019-09-10 02:48:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:48:15,091 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 02:48:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 02:48:15,092 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 241 [2019-09-10 02:48:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:48:15,092 INFO L225 Difference]: With dead ends: 2 [2019-09-10 02:48:15,092 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 02:48:15,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 240 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-10 02:48:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 02:48:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 02:48:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 02:48:15,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 02:48:15,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-09-10 02:48:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:48:15,094 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 02:48:15,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 02:48:15,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 02:48:15,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 02:48:15,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:48:15 BoogieIcfgContainer [2019-09-10 02:48:15,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:48:15,106 INFO L168 Benchmark]: Toolchain (without parser) took 193472.07 ms. Allocated memory was 134.7 MB in the beginning and 5.8 GB in the end (delta: 5.7 GB). Free memory was 88.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 4.3 GB. Max. memory is 7.1 GB. [2019-09-10 02:48:15,108 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:48:15,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1121.97 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 88.3 MB in the beginning and 127.5 MB in the end (delta: -39.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:15,114 INFO L168 Benchmark]: Boogie Preprocessor took 222.75 ms. Allocated memory is still 201.9 MB. Free memory was 127.5 MB in the beginning and 118.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:15,115 INFO L168 Benchmark]: RCFGBuilder took 2059.28 ms. Allocated memory was 201.9 MB in the beginning and 258.5 MB in the end (delta: 56.6 MB). Free memory was 118.4 MB in the beginning and 138.0 MB in the end (delta: -19.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:48:15,116 INFO L168 Benchmark]: TraceAbstraction took 190063.08 ms. Allocated memory was 258.5 MB in the beginning and 5.8 GB in the end (delta: 5.6 GB). Free memory was 138.0 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. [2019-09-10 02:48:15,131 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1121.97 ms. Allocated memory was 134.7 MB in the beginning and 201.9 MB in the end (delta: 67.1 MB). Free memory was 88.3 MB in the beginning and 127.5 MB in the end (delta: -39.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 222.75 ms. Allocated memory is still 201.9 MB. Free memory was 127.5 MB in the beginning and 118.4 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2059.28 ms. Allocated memory was 201.9 MB in the beginning and 258.5 MB in the end (delta: 56.6 MB). Free memory was 118.4 MB in the beginning and 138.0 MB in the end (delta: -19.7 MB). Peak memory consumption was 77.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 190063.08 ms. Allocated memory was 258.5 MB in the beginning and 5.8 GB in the end (delta: 5.6 GB). Free memory was 138.0 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 4.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 258]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 118 procedures, 819 locations, 1 error locations. SAFE Result, 189.9s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 75.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23513 SDtfs, 18221 SDslu, 121807 SDs, 0 SdLazy, 33049 SolverSat, 4256 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 30.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1192 GetRequests, 843 SyntacticMatches, 2 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357209occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.05 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 85.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 174014 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5942 NumberOfCodeBlocks, 5923 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1842661 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3085 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 1108/1113 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...