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-673a906-m [2019-10-03 02:54:48,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:54:48,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:54:48,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:54:48,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:54:48,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:54:48,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:54:48,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:54:48,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:54:48,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:54:48,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:54:48,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:54:48,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:54:48,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:54:48,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:54:48,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:54:48,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:54:48,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:54:48,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:54:48,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:54:48,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:54:48,267 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:54:48,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:54:48,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:54:48,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:54:48,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:54:48,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:54:48,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:54:48,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:54:48,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:54:48,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:54:48,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:54:48,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:54:48,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:54:48,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:54:48,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:54:48,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:54:48,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:54:48,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:54:48,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:54:48,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:54:48,281 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-10-03 02:54:48,298 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:54:48,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:54:48,299 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:54:48,300 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:54:48,300 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:54:48,301 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:54:48,301 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:54:48,301 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:54:48,301 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:54:48,301 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:54:48,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:54:48,302 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:54:48,302 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:54:48,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:54:48,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:54:48,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:54:48,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:54:48,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:54:48,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:54:48,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:54:48,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:54:48,305 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:54:48,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:54:48,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:48,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:54:48,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:54:48,306 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:54:48,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:54:48,307 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:54:48,307 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:54:48,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:54:48,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:54:48,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:54:48,377 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:54:48,378 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:54:48,378 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-10-03 02:54:48,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f98511c/a67880a3efff40ab8da6d07bd98c0803/FLAG50f64d7f1 [2019-10-03 02:54:49,036 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:54:49,037 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product32.cil.c [2019-10-03 02:54:49,063 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f98511c/a67880a3efff40ab8da6d07bd98c0803/FLAG50f64d7f1 [2019-10-03 02:54:49,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6f98511c/a67880a3efff40ab8da6d07bd98c0803 [2019-10-03 02:54:49,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:54:49,299 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:54:49,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:49,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:54:49,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:54:49,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:49" (1/1) ... [2019-10-03 02:54:49,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d32cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:49, skipping insertion in model container [2019-10-03 02:54:49,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:49" (1/1) ... [2019-10-03 02:54:49,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:54:49,418 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:54:50,250 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:50,277 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:54:50,385 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:50,476 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:54:50,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50 WrapperNode [2019-10-03 02:54:50,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:50,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:54:50,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:54:50,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:54:50,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:54:50,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:54:50,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:54:50,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:54:50,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:54:50,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:54:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:54:50,782 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-10-03 02:54:50,783 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-03 02:54:50,783 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:54:50,783 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:54:50,783 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:54:50,784 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:54:50,784 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:54:50,785 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:54:50,785 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:54:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:54:50,786 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:54:50,787 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:54:50,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:54:50,787 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:54:50,788 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:54:50,788 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:54:50,789 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-10-03 02:54:50,789 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:54:50,789 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:54:50,789 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:54:50,789 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:54:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:54:50,790 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:54:50,791 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:54:50,791 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:54:50,791 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:54:50,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:54:50,791 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:54:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:54:50,793 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:54:50,793 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:54:50,793 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:54:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:54:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:54:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:54:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:54:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:54:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:54:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:54:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:54:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:54:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:54:50,795 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:54:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:54:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:54:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:54:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:54:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:54:50,796 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:54:50,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:54:50,797 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:54:50,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:50,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:50,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:54:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:54:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:54:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:54:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:54:50,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:54:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:54:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:54:50,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:54:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:54:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:54:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:54:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:54:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:54:50,800 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:54:50,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:54:50,801 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:54:50,801 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:54:50,802 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:54:50,802 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:54:50,802 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:54:50,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:54:50,804 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:54:50,805 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:54:50,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:54:50,805 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:54:50,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:54:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:54:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:54:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:54:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:54:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:54:50,806 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:54:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:54:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:54:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:54:50,807 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:50,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:54:50,808 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:54:50,808 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:54:50,808 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:54:50,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:54:50,809 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:54:50,809 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:54:50,809 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:54:50,809 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:54:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:54:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:54:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:54:50,810 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:54:50,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:54:50,811 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:54:50,812 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-03 02:54:50,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:54:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:54:50,813 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:54:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:54:50,814 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:54:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:54:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:54:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:54:50,816 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:54:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:54:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:54:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:54:50,817 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:54:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:54:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:54:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:54:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:54:50,818 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:54:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:54:50,819 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-10-03 02:54:50,820 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-03 02:54:50,823 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:54:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:54:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:54:50,824 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:54:50,831 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:54:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:54:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:54:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:54:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:54:50,832 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:54:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:54:50,833 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:54:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:54:50,834 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:54:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:54:50,835 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:54:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:54:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:54:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:54:50,836 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:54:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:54:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:54:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:54:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:54:50,837 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:54:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:54:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:54:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:54:50,838 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:54:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:54:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:54:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:54:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:54:50,839 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:54:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-03 02:54:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:54:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:54:50,840 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:54:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:54:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-10-03 02:54:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:54:50,841 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:54:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:54:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:54:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:54:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:54:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:54:50,842 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:54:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:54:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:54:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:54:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:54:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:54:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:54:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:54:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:54:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:54:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:54:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:54:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:54:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:54:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:54:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:54:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:54:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:54:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:54:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:54:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:54:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-03 02:54:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:54:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:54:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:54:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:54:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:54:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:54:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:54:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:54:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:54:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:54:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:54:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:54:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:54:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:54:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:54:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:54:50,850 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:54:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:54:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:54:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:54:50,851 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:54:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:54:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:54:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:54:50,852 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:54:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:54:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:54:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:54:50,853 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:54:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:54:50,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:54:53,203 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:54:53,203 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:54:53,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:53 BoogieIcfgContainer [2019-10-03 02:54:53,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:54:53,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:54:53,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:54:53,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:54:53,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:54:49" (1/3) ... [2019-10-03 02:54:53,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dc7263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:53, skipping insertion in model container [2019-10-03 02:54:53,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (2/3) ... [2019-10-03 02:54:53,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32dc7263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:53, skipping insertion in model container [2019-10-03 02:54:53,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:53" (3/3) ... [2019-10-03 02:54:53,217 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product32.cil.c [2019-10-03 02:54:53,228 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:54:53,246 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:54:53,269 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:54:53,299 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:54:53,299 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:54:53,299 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:54:53,299 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:54:53,299 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:54:53,299 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:54:53,300 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:54:53,300 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:54:53,331 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states. [2019-10-03 02:54:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-03 02:54:53,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:53,364 INFO L411 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-10-03 02:54:53,366 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:53,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash -311164788, now seen corresponding path program 1 times [2019-10-03 02:54:53,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:53,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:53,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:53,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:54,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:54:54,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:54,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:54,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:54,172 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 2 states. [2019-10-03 02:54:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:54,287 INFO L93 Difference]: Finished difference Result 585 states and 797 transitions. [2019-10-03 02:54:54,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:54,290 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 191 [2019-10-03 02:54:54,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:54,333 INFO L225 Difference]: With dead ends: 585 [2019-10-03 02:54:54,333 INFO L226 Difference]: Without dead ends: 576 [2019-10-03 02:54:54,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-03 02:54:54,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-03 02:54:54,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-03 02:54:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 786 transitions. [2019-10-03 02:54:54,482 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 786 transitions. Word has length 191 [2019-10-03 02:54:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:54,486 INFO L475 AbstractCegarLoop]: Abstraction has 576 states and 786 transitions. [2019-10-03 02:54:54,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:54,487 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 786 transitions. [2019-10-03 02:54:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-03 02:54:54,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:54,503 INFO L411 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-10-03 02:54:54,504 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 544104814, now seen corresponding path program 1 times [2019-10-03 02:54:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:54,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:54,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:54,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:54,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:54,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:54,795 INFO L87 Difference]: Start difference. First operand 576 states and 786 transitions. Second operand 3 states. [2019-10-03 02:54:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:54,832 INFO L93 Difference]: Finished difference Result 579 states and 789 transitions. [2019-10-03 02:54:54,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:54,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-03 02:54:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:54,837 INFO L225 Difference]: With dead ends: 579 [2019-10-03 02:54:54,837 INFO L226 Difference]: Without dead ends: 579 [2019-10-03 02:54:54,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-03 02:54:54,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2019-10-03 02:54:54,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2019-10-03 02:54:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 788 transitions. [2019-10-03 02:54:54,862 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 788 transitions. Word has length 192 [2019-10-03 02:54:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:54,862 INFO L475 AbstractCegarLoop]: Abstraction has 578 states and 788 transitions. [2019-10-03 02:54:54,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 788 transitions. [2019-10-03 02:54:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-03 02:54:54,867 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:54,868 INFO L411 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-10-03 02:54:54,868 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:54,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1874665950, now seen corresponding path program 1 times [2019-10-03 02:54:54,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:54,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:54,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,183 INFO L87 Difference]: Start difference. First operand 578 states and 788 transitions. Second operand 3 states. [2019-10-03 02:54:55,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,209 INFO L93 Difference]: Finished difference Result 621 states and 861 transitions. [2019-10-03 02:54:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:55,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 202 [2019-10-03 02:54:55,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,214 INFO L225 Difference]: With dead ends: 621 [2019-10-03 02:54:55,215 INFO L226 Difference]: Without dead ends: 621 [2019-10-03 02:54:55,215 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-03 02:54:55,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 620. [2019-10-03 02:54:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-03 02:54:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 860 transitions. [2019-10-03 02:54:55,236 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 860 transitions. Word has length 202 [2019-10-03 02:54:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:55,237 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 860 transitions. [2019-10-03 02:54:55,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:55,237 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 860 transitions. [2019-10-03 02:54:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:54:55,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:55,242 INFO L411 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-10-03 02:54:55,242 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash -620463334, now seen corresponding path program 1 times [2019-10-03 02:54:55,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:55,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:55,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,428 INFO L87 Difference]: Start difference. First operand 620 states and 860 transitions. Second operand 3 states. [2019-10-03 02:54:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,455 INFO L93 Difference]: Finished difference Result 702 states and 999 transitions. [2019-10-03 02:54:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:55,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-10-03 02:54:55,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,460 INFO L225 Difference]: With dead ends: 702 [2019-10-03 02:54:55,460 INFO L226 Difference]: Without dead ends: 702 [2019-10-03 02:54:55,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-10-03 02:54:55,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 701. [2019-10-03 02:54:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-10-03 02:54:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 998 transitions. [2019-10-03 02:54:55,493 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 998 transitions. Word has length 203 [2019-10-03 02:54:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:55,494 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 998 transitions. [2019-10-03 02:54:55,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 998 transitions. [2019-10-03 02:54:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:54:55,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:55,499 INFO L411 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-10-03 02:54:55,499 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1948319678, now seen corresponding path program 1 times [2019-10-03 02:54:55,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:55,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,761 INFO L87 Difference]: Start difference. First operand 701 states and 998 transitions. Second operand 3 states. [2019-10-03 02:54:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,786 INFO L93 Difference]: Finished difference Result 858 states and 1263 transitions. [2019-10-03 02:54:55,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:55,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-10-03 02:54:55,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,792 INFO L225 Difference]: With dead ends: 858 [2019-10-03 02:54:55,793 INFO L226 Difference]: Without dead ends: 858 [2019-10-03 02:54:55,793 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-10-03 02:54:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 857. [2019-10-03 02:54:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-10-03 02:54:55,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1262 transitions. [2019-10-03 02:54:55,819 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1262 transitions. Word has length 204 [2019-10-03 02:54:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:55,819 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1262 transitions. [2019-10-03 02:54:55,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1262 transitions. [2019-10-03 02:54:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:54:55,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:55,825 INFO L411 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-10-03 02:54:55,825 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1879306950, now seen corresponding path program 1 times [2019-10-03 02:54:55,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,993 INFO L87 Difference]: Start difference. First operand 857 states and 1262 transitions. Second operand 3 states. [2019-10-03 02:54:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:56,020 INFO L93 Difference]: Finished difference Result 1158 states and 1767 transitions. [2019-10-03 02:54:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:56,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-10-03 02:54:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:56,027 INFO L225 Difference]: With dead ends: 1158 [2019-10-03 02:54:56,028 INFO L226 Difference]: Without dead ends: 1158 [2019-10-03 02:54:56,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-03 02:54:56,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2019-10-03 02:54:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2019-10-03 02:54:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1766 transitions. [2019-10-03 02:54:56,066 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1766 transitions. Word has length 205 [2019-10-03 02:54:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:56,067 INFO L475 AbstractCegarLoop]: Abstraction has 1157 states and 1766 transitions. [2019-10-03 02:54:56,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1766 transitions. [2019-10-03 02:54:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-03 02:54:56,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:56,076 INFO L411 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-10-03 02:54:56,076 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:56,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash -59408994, now seen corresponding path program 1 times [2019-10-03 02:54:56,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:56,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:56,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:56,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:56,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:56,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:56,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:56,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:56,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:56,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:56,347 INFO L87 Difference]: Start difference. First operand 1157 states and 1766 transitions. Second operand 3 states. [2019-10-03 02:54:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:56,376 INFO L93 Difference]: Finished difference Result 1734 states and 2727 transitions. [2019-10-03 02:54:56,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:56,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-03 02:54:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:56,387 INFO L225 Difference]: With dead ends: 1734 [2019-10-03 02:54:56,387 INFO L226 Difference]: Without dead ends: 1734 [2019-10-03 02:54:56,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:56,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-10-03 02:54:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1733. [2019-10-03 02:54:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-10-03 02:54:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2726 transitions. [2019-10-03 02:54:56,468 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2726 transitions. Word has length 206 [2019-10-03 02:54:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:56,468 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2726 transitions. [2019-10-03 02:54:56,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:56,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2726 transitions. [2019-10-03 02:54:56,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-03 02:54:56,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:56,481 INFO L411 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-10-03 02:54:56,481 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:56,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:56,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1504076601, now seen corresponding path program 1 times [2019-10-03 02:54:56,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:56,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:56,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:56,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:56,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:54:56,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:56,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:54:56,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:56,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:54:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:54:56,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:54:56,961 INFO L87 Difference]: Start difference. First operand 1733 states and 2726 transitions. Second operand 19 states. [2019-10-03 02:55:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:02,913 INFO L93 Difference]: Finished difference Result 4073 states and 6429 transitions. [2019-10-03 02:55:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:55:02,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 208 [2019-10-03 02:55:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:02,941 INFO L225 Difference]: With dead ends: 4073 [2019-10-03 02:55:02,941 INFO L226 Difference]: Without dead ends: 4073 [2019-10-03 02:55:02,943 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:55:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-10-03 02:55:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 4036. [2019-10-03 02:55:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2019-10-03 02:55:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 6377 transitions. [2019-10-03 02:55:03,106 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 6377 transitions. Word has length 208 [2019-10-03 02:55:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:03,108 INFO L475 AbstractCegarLoop]: Abstraction has 4036 states and 6377 transitions. [2019-10-03 02:55:03,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:55:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 6377 transitions. [2019-10-03 02:55:03,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:55:03,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:03,137 INFO L411 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-10-03 02:55:03,138 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:03,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:03,138 INFO L82 PathProgramCache]: Analyzing trace with hash 499285188, now seen corresponding path program 1 times [2019-10-03 02:55:03,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:03,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:03,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:03,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:03,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:03,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:03,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:03,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-03 02:55:03,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:03,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-03 02:55:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-03 02:55:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:55:03,443 INFO L87 Difference]: Start difference. First operand 4036 states and 6377 transitions. Second operand 13 states. [2019-10-03 02:55:04,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:04,087 INFO L93 Difference]: Finished difference Result 4186 states and 6623 transitions. [2019-10-03 02:55:04,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:55:04,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 209 [2019-10-03 02:55:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:04,119 INFO L225 Difference]: With dead ends: 4186 [2019-10-03 02:55:04,119 INFO L226 Difference]: Without dead ends: 4170 [2019-10-03 02:55:04,121 INFO L640 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-10-03 02:55:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2019-10-03 02:55:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4170. [2019-10-03 02:55:04,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4170 states. [2019-10-03 02:55:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4170 states to 4170 states and 6594 transitions. [2019-10-03 02:55:04,289 INFO L78 Accepts]: Start accepts. Automaton has 4170 states and 6594 transitions. Word has length 209 [2019-10-03 02:55:04,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:04,290 INFO L475 AbstractCegarLoop]: Abstraction has 4170 states and 6594 transitions. [2019-10-03 02:55:04,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-03 02:55:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6594 transitions. [2019-10-03 02:55:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:55:04,313 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:04,314 INFO L411 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-10-03 02:55:04,314 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1211410007, now seen corresponding path program 1 times [2019-10-03 02:55:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:04,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:04,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:04,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:04,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:55:04,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:04,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:55:04,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:04,797 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:55:04,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:55:04,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:55:04,798 INFO L87 Difference]: Start difference. First operand 4170 states and 6594 transitions. Second operand 15 states. [2019-10-03 02:55:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:08,832 INFO L93 Difference]: Finished difference Result 4288 states and 6784 transitions. [2019-10-03 02:55:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:55:08,834 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 209 [2019-10-03 02:55:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:08,865 INFO L225 Difference]: With dead ends: 4288 [2019-10-03 02:55:08,866 INFO L226 Difference]: Without dead ends: 4288 [2019-10-03 02:55:08,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:55:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-03 02:55:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4251. [2019-10-03 02:55:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4251 states. [2019-10-03 02:55:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 6732 transitions. [2019-10-03 02:55:09,062 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 6732 transitions. Word has length 209 [2019-10-03 02:55:09,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:09,063 INFO L475 AbstractCegarLoop]: Abstraction has 4251 states and 6732 transitions. [2019-10-03 02:55:09,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:55:09,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 6732 transitions. [2019-10-03 02:55:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 02:55:09,089 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:09,089 INFO L411 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-10-03 02:55:09,090 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2077108254, now seen corresponding path program 1 times [2019-10-03 02:55:09,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:09,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:09,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:09,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:55:09,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:09,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:09,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:09,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:09,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:09,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:09,352 INFO L87 Difference]: Start difference. First operand 4251 states and 6732 transitions. Second operand 5 states. [2019-10-03 02:55:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:09,446 INFO L93 Difference]: Finished difference Result 3870 states and 6183 transitions. [2019-10-03 02:55:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:09,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2019-10-03 02:55:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:09,478 INFO L225 Difference]: With dead ends: 3870 [2019-10-03 02:55:09,479 INFO L226 Difference]: Without dead ends: 3867 [2019-10-03 02:55:09,480 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2019-10-03 02:55:09,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3867. [2019-10-03 02:55:09,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3867 states. [2019-10-03 02:55:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 6179 transitions. [2019-10-03 02:55:09,635 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 6179 transitions. Word has length 212 [2019-10-03 02:55:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:09,638 INFO L475 AbstractCegarLoop]: Abstraction has 3867 states and 6179 transitions. [2019-10-03 02:55:09,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 6179 transitions. [2019-10-03 02:55:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:55:09,661 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:09,662 INFO L411 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-10-03 02:55:09,662 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash 493886152, now seen corresponding path program 1 times [2019-10-03 02:55:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:09,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:09,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:09,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:09,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:55:10,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:10,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 02:55:10,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:10,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:55:10,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:55:10,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:55:10,039 INFO L87 Difference]: Start difference. First operand 3867 states and 6179 transitions. Second operand 18 states. [2019-10-03 02:55:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:10,526 INFO L93 Difference]: Finished difference Result 3899 states and 6210 transitions. [2019-10-03 02:55:10,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:55:10,528 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 209 [2019-10-03 02:55:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:10,572 INFO L225 Difference]: With dead ends: 3899 [2019-10-03 02:55:10,573 INFO L226 Difference]: Without dead ends: 3899 [2019-10-03 02:55:10,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:55:10,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3899 states. [2019-10-03 02:55:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3899 to 3897. [2019-10-03 02:55:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3897 states. [2019-10-03 02:55:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3897 states to 3897 states and 6207 transitions. [2019-10-03 02:55:10,674 INFO L78 Accepts]: Start accepts. Automaton has 3897 states and 6207 transitions. Word has length 209 [2019-10-03 02:55:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:10,674 INFO L475 AbstractCegarLoop]: Abstraction has 3897 states and 6207 transitions. [2019-10-03 02:55:10,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:55:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3897 states and 6207 transitions. [2019-10-03 02:55:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:55:10,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:10,693 INFO L411 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-10-03 02:55:10,693 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash -216412755, now seen corresponding path program 1 times [2019-10-03 02:55:10,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:10,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:10,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:10,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:10,871 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:10,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:10,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:10,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:10,872 INFO L87 Difference]: Start difference. First operand 3897 states and 6207 transitions. Second operand 5 states. [2019-10-03 02:55:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:12,136 INFO L93 Difference]: Finished difference Result 7048 states and 11206 transitions. [2019-10-03 02:55:12,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:55:12,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-03 02:55:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:12,166 INFO L225 Difference]: With dead ends: 7048 [2019-10-03 02:55:12,166 INFO L226 Difference]: Without dead ends: 7048 [2019-10-03 02:55:12,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:12,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2019-10-03 02:55:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 7034. [2019-10-03 02:55:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7034 states. [2019-10-03 02:55:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7034 states to 7034 states and 11187 transitions. [2019-10-03 02:55:12,369 INFO L78 Accepts]: Start accepts. Automaton has 7034 states and 11187 transitions. Word has length 209 [2019-10-03 02:55:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:12,370 INFO L475 AbstractCegarLoop]: Abstraction has 7034 states and 11187 transitions. [2019-10-03 02:55:12,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7034 states and 11187 transitions. [2019-10-03 02:55:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:55:12,400 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:12,400 INFO L411 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-10-03 02:55:12,400 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash -196075380, now seen corresponding path program 1 times [2019-10-03 02:55:12,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:12,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:12,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:12,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:12,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:12,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:55:12,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:12,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:55:12,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:55:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:12,594 INFO L87 Difference]: Start difference. First operand 7034 states and 11187 transitions. Second operand 7 states. [2019-10-03 02:55:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:15,627 INFO L93 Difference]: Finished difference Result 12704 states and 20243 transitions. [2019-10-03 02:55:15,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:55:15,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 209 [2019-10-03 02:55:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:15,702 INFO L225 Difference]: With dead ends: 12704 [2019-10-03 02:55:15,702 INFO L226 Difference]: Without dead ends: 12704 [2019-10-03 02:55:15,704 INFO L640 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-10-03 02:55:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-10-03 02:55:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12694. [2019-10-03 02:55:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12694 states. [2019-10-03 02:55:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12694 states to 12694 states and 20229 transitions. [2019-10-03 02:55:16,285 INFO L78 Accepts]: Start accepts. Automaton has 12694 states and 20229 transitions. Word has length 209 [2019-10-03 02:55:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:16,286 INFO L475 AbstractCegarLoop]: Abstraction has 12694 states and 20229 transitions. [2019-10-03 02:55:16,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:55:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 12694 states and 20229 transitions. [2019-10-03 02:55:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 02:55:16,322 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:16,322 INFO L411 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-10-03 02:55:16,323 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash -428249634, now seen corresponding path program 1 times [2019-10-03 02:55:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:16,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:16,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:16,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:16,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-10-03 02:55:16,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:16,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-03 02:55:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-03 02:55:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-10-03 02:55:16,859 INFO L87 Difference]: Start difference. First operand 12694 states and 20229 transitions. Second operand 28 states. [2019-10-03 02:55:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:17,953 INFO L93 Difference]: Finished difference Result 13045 states and 20727 transitions. [2019-10-03 02:55:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-03 02:55:17,954 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 210 [2019-10-03 02:55:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:18,037 INFO L225 Difference]: With dead ends: 13045 [2019-10-03 02:55:18,038 INFO L226 Difference]: Without dead ends: 13045 [2019-10-03 02:55:18,041 INFO L640 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-10-03 02:55:18,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13045 states. [2019-10-03 02:55:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13045 to 13020. [2019-10-03 02:55:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-10-03 02:55:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 20680 transitions. [2019-10-03 02:55:19,146 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 20680 transitions. Word has length 210 [2019-10-03 02:55:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:19,147 INFO L475 AbstractCegarLoop]: Abstraction has 13020 states and 20680 transitions. [2019-10-03 02:55:19,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-03 02:55:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 20680 transitions. [2019-10-03 02:55:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:55:19,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:19,173 INFO L411 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-10-03 02:55:19,174 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1086081098, now seen corresponding path program 1 times [2019-10-03 02:55:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:19,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:19,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:19,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:19,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:19,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:55:19,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:19,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:55:19,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:55:19,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:55:19,472 INFO L87 Difference]: Start difference. First operand 13020 states and 20680 transitions. Second operand 10 states. [2019-10-03 02:55:19,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:19,599 INFO L93 Difference]: Finished difference Result 13116 states and 20808 transitions. [2019-10-03 02:55:19,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:55:19,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 214 [2019-10-03 02:55:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:19,670 INFO L225 Difference]: With dead ends: 13116 [2019-10-03 02:55:19,671 INFO L226 Difference]: Without dead ends: 13116 [2019-10-03 02:55:19,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:55:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13116 states. [2019-10-03 02:55:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13116 to 13116. [2019-10-03 02:55:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13116 states. [2019-10-03 02:55:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13116 states to 13116 states and 20808 transitions. [2019-10-03 02:55:20,132 INFO L78 Accepts]: Start accepts. Automaton has 13116 states and 20808 transitions. Word has length 214 [2019-10-03 02:55:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:20,132 INFO L475 AbstractCegarLoop]: Abstraction has 13116 states and 20808 transitions. [2019-10-03 02:55:20,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:55:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 13116 states and 20808 transitions. [2019-10-03 02:55:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-03 02:55:20,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:20,153 INFO L411 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-10-03 02:55:20,153 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -268832971, now seen corresponding path program 1 times [2019-10-03 02:55:20,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:20,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:20,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:20,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:20,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:20,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:20,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:20,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:20,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:20,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:20,332 INFO L87 Difference]: Start difference. First operand 13116 states and 20808 transitions. Second operand 5 states. [2019-10-03 02:55:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:20,429 INFO L93 Difference]: Finished difference Result 13371 states and 21536 transitions. [2019-10-03 02:55:20,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:20,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 219 [2019-10-03 02:55:20,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:20,505 INFO L225 Difference]: With dead ends: 13371 [2019-10-03 02:55:20,505 INFO L226 Difference]: Without dead ends: 13371 [2019-10-03 02:55:20,506 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2019-10-03 02:55:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 13220. [2019-10-03 02:55:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13220 states. [2019-10-03 02:55:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13220 states to 13220 states and 20925 transitions. [2019-10-03 02:55:21,259 INFO L78 Accepts]: Start accepts. Automaton has 13220 states and 20925 transitions. Word has length 219 [2019-10-03 02:55:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:21,260 INFO L475 AbstractCegarLoop]: Abstraction has 13220 states and 20925 transitions. [2019-10-03 02:55:21,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13220 states and 20925 transitions. [2019-10-03 02:55:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-10-03 02:55:21,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:21,280 INFO L411 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-10-03 02:55:21,280 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:21,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1699876820, now seen corresponding path program 1 times [2019-10-03 02:55:21,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:21,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:21,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:21,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:21,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:21,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:21,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:55:21,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:21,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:55:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:55:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:21,491 INFO L87 Difference]: Start difference. First operand 13220 states and 20925 transitions. Second operand 6 states. [2019-10-03 02:55:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:22,301 INFO L93 Difference]: Finished difference Result 26559 states and 43143 transitions. [2019-10-03 02:55:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:55:22,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 220 [2019-10-03 02:55:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:22,444 INFO L225 Difference]: With dead ends: 26559 [2019-10-03 02:55:22,444 INFO L226 Difference]: Without dead ends: 26559 [2019-10-03 02:55:22,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:55:22,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26559 states. [2019-10-03 02:55:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26559 to 26229. [2019-10-03 02:55:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26229 states. [2019-10-03 02:55:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26229 states to 26229 states and 42130 transitions. [2019-10-03 02:55:24,376 INFO L78 Accepts]: Start accepts. Automaton has 26229 states and 42130 transitions. Word has length 220 [2019-10-03 02:55:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:24,377 INFO L475 AbstractCegarLoop]: Abstraction has 26229 states and 42130 transitions. [2019-10-03 02:55:24,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:55:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 26229 states and 42130 transitions. [2019-10-03 02:55:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-03 02:55:24,417 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:24,417 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:24,417 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:24,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:24,418 INFO L82 PathProgramCache]: Analyzing trace with hash -367726315, now seen corresponding path program 1 times [2019-10-03 02:55:24,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:24,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:24,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:24,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:24,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:24,652 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:55:24,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:24,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:24,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:24,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:24,656 INFO L87 Difference]: Start difference. First operand 26229 states and 42130 transitions. Second operand 8 states. [2019-10-03 02:55:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:30,318 INFO L93 Difference]: Finished difference Result 53137 states and 91489 transitions. [2019-10-03 02:55:30,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:55:30,318 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 256 [2019-10-03 02:55:30,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:30,570 INFO L225 Difference]: With dead ends: 53137 [2019-10-03 02:55:30,570 INFO L226 Difference]: Without dead ends: 53137 [2019-10-03 02:55:30,571 INFO L640 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-10-03 02:55:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53137 states. [2019-10-03 02:55:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53137 to 35061. [2019-10-03 02:55:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35061 states. [2019-10-03 02:55:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35061 states to 35061 states and 62176 transitions. [2019-10-03 02:55:32,422 INFO L78 Accepts]: Start accepts. Automaton has 35061 states and 62176 transitions. Word has length 256 [2019-10-03 02:55:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:32,423 INFO L475 AbstractCegarLoop]: Abstraction has 35061 states and 62176 transitions. [2019-10-03 02:55:32,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 35061 states and 62176 transitions. [2019-10-03 02:55:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-03 02:55:32,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:32,519 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:32,519 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:32,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:32,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1716034950, now seen corresponding path program 1 times [2019-10-03 02:55:32,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:32,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:32,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:32,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:55:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:32,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:32,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:32,713 INFO L87 Difference]: Start difference. First operand 35061 states and 62176 transitions. Second operand 8 states. [2019-10-03 02:55:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:40,625 INFO L93 Difference]: Finished difference Result 71605 states and 139051 transitions. [2019-10-03 02:55:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:55:40,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-10-03 02:55:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:41,080 INFO L225 Difference]: With dead ends: 71605 [2019-10-03 02:55:41,080 INFO L226 Difference]: Without dead ends: 71605 [2019-10-03 02:55:41,081 INFO L640 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-10-03 02:55:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71605 states. [2019-10-03 02:55:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71605 to 52905. [2019-10-03 02:55:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52905 states. [2019-10-03 02:55:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52905 states to 52905 states and 106600 transitions. [2019-10-03 02:55:43,973 INFO L78 Accepts]: Start accepts. Automaton has 52905 states and 106600 transitions. Word has length 242 [2019-10-03 02:55:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:43,974 INFO L475 AbstractCegarLoop]: Abstraction has 52905 states and 106600 transitions. [2019-10-03 02:55:43,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 52905 states and 106600 transitions. [2019-10-03 02:55:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 02:55:44,162 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:44,163 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:44,163 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:44,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 660550356, now seen corresponding path program 1 times [2019-10-03 02:55:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:44,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:44,384 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:55:44,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:44,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:44,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:44,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:44,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:44,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:44,386 INFO L87 Difference]: Start difference. First operand 52905 states and 106600 transitions. Second operand 8 states. [2019-10-03 02:55:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:51,390 INFO L93 Difference]: Finished difference Result 108769 states and 242773 transitions. [2019-10-03 02:55:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:55:51,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 243 [2019-10-03 02:55:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:52,137 INFO L225 Difference]: With dead ends: 108769 [2019-10-03 02:55:52,137 INFO L226 Difference]: Without dead ends: 108769 [2019-10-03 02:55:52,137 INFO L640 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-10-03 02:55:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108769 states. [2019-10-03 02:55:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108769 to 88785. [2019-10-03 02:55:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88785 states. [2019-10-03 02:55:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88785 states to 88785 states and 203902 transitions. [2019-10-03 02:55:58,412 INFO L78 Accepts]: Start accepts. Automaton has 88785 states and 203902 transitions. Word has length 243 [2019-10-03 02:55:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:58,412 INFO L475 AbstractCegarLoop]: Abstraction has 88785 states and 203902 transitions. [2019-10-03 02:55:58,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 88785 states and 203902 transitions. [2019-10-03 02:55:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 02:55:58,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:58,758 INFO L411 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-10-03 02:55:58,758 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:58,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:58,759 INFO L82 PathProgramCache]: Analyzing trace with hash 340432954, now seen corresponding path program 1 times [2019-10-03 02:55:58,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:58,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:58,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:55:58,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:58,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:58,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:58,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:58,945 INFO L87 Difference]: Start difference. First operand 88785 states and 203902 transitions. Second operand 8 states. [2019-10-03 02:56:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:04,977 INFO L93 Difference]: Finished difference Result 179170 states and 415066 transitions. [2019-10-03 02:56:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:56:04,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-10-03 02:56:04,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:06,107 INFO L225 Difference]: With dead ends: 179170 [2019-10-03 02:56:06,107 INFO L226 Difference]: Without dead ends: 179170 [2019-10-03 02:56:06,108 INFO L640 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-10-03 02:56:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179170 states. [2019-10-03 02:56:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179170 to 179019. [2019-10-03 02:56:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179019 states. [2019-10-03 02:56:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179019 states to 179019 states and 414841 transitions. [2019-10-03 02:56:12,331 INFO L78 Accepts]: Start accepts. Automaton has 179019 states and 414841 transitions. Word has length 239 [2019-10-03 02:56:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:12,332 INFO L475 AbstractCegarLoop]: Abstraction has 179019 states and 414841 transitions. [2019-10-03 02:56:12,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:56:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 179019 states and 414841 transitions. [2019-10-03 02:56:20,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-03 02:56:20,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:20,662 INFO L411 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-10-03 02:56:20,662 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:20,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:20,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1337773327, now seen corresponding path program 1 times [2019-10-03 02:56:20,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:20,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:20,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:20,951 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:56:20,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:56:20,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:56:20,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:20,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:56:20,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:56:20,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:56:20,953 INFO L87 Difference]: Start difference. First operand 179019 states and 414841 transitions. Second operand 15 states. [2019-10-03 02:56:25,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:25,483 INFO L93 Difference]: Finished difference Result 178788 states and 414113 transitions. [2019-10-03 02:56:25,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:56:25,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 240 [2019-10-03 02:56:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:26,415 INFO L225 Difference]: With dead ends: 178788 [2019-10-03 02:56:26,415 INFO L226 Difference]: Without dead ends: 178788 [2019-10-03 02:56:26,416 INFO L640 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-10-03 02:56:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178788 states. [2019-10-03 02:56:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178788 to 178114. [2019-10-03 02:56:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178114 states. [2019-10-03 02:56:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178114 states to 178114 states and 412730 transitions. [2019-10-03 02:56:34,324 INFO L78 Accepts]: Start accepts. Automaton has 178114 states and 412730 transitions. Word has length 240 [2019-10-03 02:56:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:34,324 INFO L475 AbstractCegarLoop]: Abstraction has 178114 states and 412730 transitions. [2019-10-03 02:56:34,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:56:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 178114 states and 412730 transitions. [2019-10-03 02:56:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-03 02:56:44,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:44,179 INFO L411 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-10-03 02:56:44,179 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:44,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:44,180 INFO L82 PathProgramCache]: Analyzing trace with hash -225115086, now seen corresponding path program 1 times [2019-10-03 02:56:44,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:44,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:44,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:44,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:56:44,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:56:44,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:56:44,403 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:44,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:56:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:56:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:56:44,406 INFO L87 Difference]: Start difference. First operand 178114 states and 412730 transitions. Second operand 7 states. [2019-10-03 02:56:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:53,563 INFO L93 Difference]: Finished difference Result 472792 states and 1165318 transitions. [2019-10-03 02:56:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:56:53,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-10-03 02:56:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:03,101 INFO L225 Difference]: With dead ends: 472792 [2019-10-03 02:57:03,101 INFO L226 Difference]: Without dead ends: 472792 [2019-10-03 02:57:03,101 INFO L640 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-10-03 02:57:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472792 states. [2019-10-03 02:57:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472792 to 356975. [2019-10-03 02:57:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356975 states. [2019-10-03 02:57:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356975 states to 356975 states and 841205 transitions. [2019-10-03 02:57:20,098 INFO L78 Accepts]: Start accepts. Automaton has 356975 states and 841205 transitions. Word has length 240 [2019-10-03 02:57:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:20,099 INFO L475 AbstractCegarLoop]: Abstraction has 356975 states and 841205 transitions. [2019-10-03 02:57:20,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:57:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 356975 states and 841205 transitions. [2019-10-03 02:57:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-03 02:57:32,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:32,265 INFO L411 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-10-03 02:57:32,266 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2050933252, now seen corresponding path program 2 times [2019-10-03 02:57:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:32,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:57:32,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:32,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:32,464 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:57:32,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:57:32,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:57:32,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:57:32,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:57:32,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:57:32,467 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-10-03 02:57:32,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:57:32,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:57:33,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-03 02:57:33,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:57:33,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 3085 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:57:33,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:57:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:57:33,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:57:33,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:57:33,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:57:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-03 02:57:33,919 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:57:33,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 21 [2019-10-03 02:57:33,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:33,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:57:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:57:33,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:57:33,922 INFO L87 Difference]: Start difference. First operand 356975 states and 841205 transitions. Second operand 7 states. [2019-10-03 02:57:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:45,772 INFO L93 Difference]: Finished difference Result 357213 states and 841546 transitions. [2019-10-03 02:57:45,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:57:45,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 240 [2019-10-03 02:57:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:48,378 INFO L225 Difference]: With dead ends: 357213 [2019-10-03 02:57:48,378 INFO L226 Difference]: Without dead ends: 357209 [2019-10-03 02:57:48,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:57:48,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357209 states. [2019-10-03 02:58:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357209 to 357209. [2019-10-03 02:58:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357209 states. [2019-10-03 02:58:15,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357209 states to 357209 states and 841540 transitions. [2019-10-03 02:58:15,312 INFO L78 Accepts]: Start accepts. Automaton has 357209 states and 841540 transitions. Word has length 240 [2019-10-03 02:58:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:58:15,312 INFO L475 AbstractCegarLoop]: Abstraction has 357209 states and 841540 transitions. [2019-10-03 02:58:15,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:58:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 357209 states and 841540 transitions. [2019-10-03 02:58:19,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-03 02:58:19,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:58:19,038 INFO L411 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-10-03 02:58:19,039 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:58:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:58:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1960984290, now seen corresponding path program 1 times [2019-10-03 02:58:19,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:58:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:58:19,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:58:19,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:58:19,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:58:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:58:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:58:19,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:58:19,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:58:19,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 242 with the following transitions: [2019-10-03 02:58:19,234 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-10-03 02:58:19,288 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:58:19,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:58:19,461 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:58:19,463 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-10-03 02:58:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:58:19,470 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:58:19,559 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:58:19,560 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:58:19,565 INFO L420 sIntCurrentIteration]: We unified 240 AI predicates to 240 [2019-10-03 02:58:19,566 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:58:19,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:58:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:58:19,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:58:19,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:58:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:58:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:58:19,568 INFO L87 Difference]: Start difference. First operand 357209 states and 841540 transitions. Second operand 2 states. [2019-10-03 02:58:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:58:19,569 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:58:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:58:19,569 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 241 [2019-10-03 02:58:19,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:58:19,570 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:58:19,570 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:58:19,571 INFO L640 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-10-03 02:58:19,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:58:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:58:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:58:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:58:19,572 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-10-03 02:58:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:58:19,572 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:58:19,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:58:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:58:24,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:58:24,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:58:24 BoogieIcfgContainer [2019-10-03 02:58:24,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:58:24,586 INFO L168 Benchmark]: Toolchain (without parser) took 215285.50 ms. Allocated memory was 132.1 MB in the beginning and 4.1 GB in the end (delta: 4.0 GB). Free memory was 85.1 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.7 GB. Max. memory is 7.1 GB. [2019-10-03 02:58:24,587 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-03 02:58:24,588 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1177.24 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 84.9 MB in the beginning and 127.4 MB in the end (delta: -42.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:58:24,589 INFO L168 Benchmark]: Boogie Preprocessor took 191.47 ms. Allocated memory is still 201.3 MB. Free memory was 127.4 MB in the beginning and 117.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:58:24,590 INFO L168 Benchmark]: RCFGBuilder took 2535.86 ms. Allocated memory was 201.3 MB in the beginning and 266.9 MB in the end (delta: 65.5 MB). Free memory was 117.8 MB in the beginning and 146.3 MB in the end (delta: -28.5 MB). Peak memory consumption was 78.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:58:24,591 INFO L168 Benchmark]: TraceAbstraction took 211376.02 ms. Allocated memory was 266.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 146.3 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.6 GB. Max. memory is 7.1 GB. [2019-10-03 02:58:24,595 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1177.24 ms. Allocated memory was 132.1 MB in the beginning and 201.3 MB in the end (delta: 69.2 MB). Free memory was 84.9 MB in the beginning and 127.4 MB in the end (delta: -42.5 MB). Peak memory consumption was 33.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.47 ms. Allocated memory is still 201.3 MB. Free memory was 127.4 MB in the beginning and 117.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2535.86 ms. Allocated memory was 201.3 MB in the beginning and 266.9 MB in the end (delta: 65.5 MB). Free memory was 117.8 MB in the beginning and 146.3 MB in the end (delta: -28.5 MB). Peak memory consumption was 78.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211376.02 ms. Allocated memory was 266.9 MB in the beginning and 4.1 GB in the end (delta: 3.9 GB). Free memory was 146.3 MB in the beginning and 2.8 GB in the end (delta: -2.6 GB). Peak memory consumption was 4.6 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, 211.2s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 86.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23514 SDtfs, 18225 SDslu, 121811 SDs, 0 SdLazy, 33037 SolverSat, 4259 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1192 GetRequests, 843 SyntacticMatches, 2 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1745 ImplicationChecksByTransitivity, 4.0s 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: 75.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 174014 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 5912 NumberOfCodeBlocks, 5893 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 6124 ConstructedInterpolants, 0 QuantifiedInterpolants, 1816903 SizeOfPredicates, 3 NumberOfNonLiveVariables, 3085 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 1092/1097 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...