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_spec6_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:53:45,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:53:45,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:53:45,788 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:53:45,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:53:45,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:53:45,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:53:45,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:53:45,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:53:45,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:53:45,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:53:45,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:53:45,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:53:45,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:53:45,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:53:45,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:53:45,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:53:45,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:53:45,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:53:45,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:53:45,822 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:53:45,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:53:45,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:53:45,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:53:45,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:53:45,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:53:45,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:53:45,834 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:53:45,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:53:45,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:53:45,837 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:53:45,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:53:45,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:53:45,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:53:45,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:53:45,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:53:45,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:53:45,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:53:45,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:53:45,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:53:45,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:53:45,847 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:53:45,870 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:53:45,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:53:45,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:53:45,871 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:53:45,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:53:45,872 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:53:45,872 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:53:45,872 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:53:45,873 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:53:45,873 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:53:45,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:53:45,875 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:53:45,875 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:53:45,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:53:45,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:53:45,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:53:45,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:53:45,876 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:53:45,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:53:45,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:53:45,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:53:45,877 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:53:45,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:53:45,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:53:45,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:53:45,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:53:45,878 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:53:45,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:53:45,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:53:45,879 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:53:45,931 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:53:45,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:53:45,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:53:45,954 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:53:45,954 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:53:45,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product28.cil.c [2019-10-03 02:53:46,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4552f9441/6f771681dcf44aa0919e041e48852b38/FLAG95528cb38 [2019-10-03 02:53:46,605 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:53:46,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product28.cil.c [2019-10-03 02:53:46,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4552f9441/6f771681dcf44aa0919e041e48852b38/FLAG95528cb38 [2019-10-03 02:53:46,837 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4552f9441/6f771681dcf44aa0919e041e48852b38 [2019-10-03 02:53:46,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:53:46,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:53:46,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:46,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:53:46,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:53:46,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:46" (1/1) ... [2019-10-03 02:53:46,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@241291fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:46, skipping insertion in model container [2019-10-03 02:53:46,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:53:46" (1/1) ... [2019-10-03 02:53:46,862 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:53:46,953 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:53:47,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:47,624 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:53:47,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:53:47,832 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:53:47,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47 WrapperNode [2019-10-03 02:53:47,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:53:47,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:53:47,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:53:47,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:53:47,845 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:47,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:47,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:47,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:47,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:47,984 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (1/1) ... [2019-10-03 02:53:48,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:53:48,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:53:48,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:53:48,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:53:48,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (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:53:48,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:53:48,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:53:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:53:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:53:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:48,116 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:53:48,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:48,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:53:48,117 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:53:48,117 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:53:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:53:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:53:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:53:48,118 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:53:48,119 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:53:48,119 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:53:48,119 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:53:48,119 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:53:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:53:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:53:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:53:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:53:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:53:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-03 02:53:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:53:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:53:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:53:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:53:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:53:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:53:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:53:48,122 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:53:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:53:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:53:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:53:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:53:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:53:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:53:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:53:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:53:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-03 02:53:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-03 02:53:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:53:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:53:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:53:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:53:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:53:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:53:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:53:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:53:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:53:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:53:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:53:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:53:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:53:48,128 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:53:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:53:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:53:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:53:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:53:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:53:48,129 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:53:48,130 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:53:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:53:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:53:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:53:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:53:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:53:48,131 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:53:48,132 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:53:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:53:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:53:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:53:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:53:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:53:48,133 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:53:48,134 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:53:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:53:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:53:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:53:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:53:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:53:48,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:53:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:53:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:53:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:53:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:53:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:53:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:53:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:53:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:53:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:53:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:53:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:53:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:53:48,138 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:53:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:53:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:53:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:53:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:53:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:53:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:53:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:53:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:53:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:53:48,143 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:53:48,144 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:53:48,145 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-03 02:53:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:53:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-03 02:53:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:53:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:53:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-03 02:53:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-03 02:53:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:53:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:53:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:53:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:53:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:53:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:53:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:53:48,149 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:53:48,150 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:53:48,151 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:53:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:53:48,153 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:53:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:53:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:53:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:53:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:53:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:53:48,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:53:50,457 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:53:50,458 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:53:50,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:50 BoogieIcfgContainer [2019-10-03 02:53:50,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:53:50,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:53:50,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:53:50,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:53:50,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:53:46" (1/3) ... [2019-10-03 02:53:50,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c406229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:50, skipping insertion in model container [2019-10-03 02:53:50,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:53:47" (2/3) ... [2019-10-03 02:53:50,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c406229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:53:50, skipping insertion in model container [2019-10-03 02:53:50,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:53:50" (3/3) ... [2019-10-03 02:53:50,470 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product28.cil.c [2019-10-03 02:53:50,483 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:53:50,492 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:53:50,508 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:53:50,534 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:53:50,534 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:53:50,534 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:53:50,535 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:53:50,535 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:53:50,535 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:53:50,535 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:53:50,535 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:53:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states. [2019-10-03 02:53:50,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 02:53:50,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:50,592 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] [2019-10-03 02:53:50,598 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:50,611 INFO L82 PathProgramCache]: Analyzing trace with hash 706098665, now seen corresponding path program 1 times [2019-10-03 02:53:50,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:50,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:50,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:50,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:51,293 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:53:51,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:51,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:53:51,297 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:51,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:53:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:53:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:53:51,327 INFO L87 Difference]: Start difference. First operand 517 states. Second operand 2 states. [2019-10-03 02:53:51,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:51,381 INFO L93 Difference]: Finished difference Result 475 states and 632 transitions. [2019-10-03 02:53:51,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:53:51,383 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 189 [2019-10-03 02:53:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:51,413 INFO L225 Difference]: With dead ends: 475 [2019-10-03 02:53:51,413 INFO L226 Difference]: Without dead ends: 466 [2019-10-03 02:53:51,418 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:53:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-03 02:53:51,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-03 02:53:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-03 02:53:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 621 transitions. [2019-10-03 02:53:51,581 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 621 transitions. Word has length 189 [2019-10-03 02:53:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:51,585 INFO L475 AbstractCegarLoop]: Abstraction has 466 states and 621 transitions. [2019-10-03 02:53:51,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:53:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 621 transitions. [2019-10-03 02:53:51,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-03 02:53:51,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:51,598 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] [2019-10-03 02:53:51,599 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:51,601 INFO L82 PathProgramCache]: Analyzing trace with hash 658853087, now seen corresponding path program 1 times [2019-10-03 02:53:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:51,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:51,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:51,858 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:53:51,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:51,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:51,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:51,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:51,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:51,862 INFO L87 Difference]: Start difference. First operand 466 states and 621 transitions. Second operand 3 states. [2019-10-03 02:53:51,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:51,920 INFO L93 Difference]: Finished difference Result 469 states and 624 transitions. [2019-10-03 02:53:51,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:51,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-03 02:53:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:51,926 INFO L225 Difference]: With dead ends: 469 [2019-10-03 02:53:51,927 INFO L226 Difference]: Without dead ends: 469 [2019-10-03 02:53:51,928 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:53:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-10-03 02:53:51,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 468. [2019-10-03 02:53:51,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-03 02:53:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 623 transitions. [2019-10-03 02:53:51,954 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 623 transitions. Word has length 190 [2019-10-03 02:53:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:51,955 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 623 transitions. [2019-10-03 02:53:51,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 623 transitions. [2019-10-03 02:53:51,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:53:51,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:51,960 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] [2019-10-03 02:53:51,960 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:51,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1973832491, now seen corresponding path program 1 times [2019-10-03 02:53:51,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:51,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:51,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:51,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:51,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:52,197 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:53:52,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:52,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:53:52,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:52,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:53:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:53:52,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:53:52,201 INFO L87 Difference]: Start difference. First operand 468 states and 623 transitions. Second operand 3 states. [2019-10-03 02:53:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:52,234 INFO L93 Difference]: Finished difference Result 507 states and 690 transitions. [2019-10-03 02:53:52,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:53:52,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-03 02:53:52,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:52,241 INFO L225 Difference]: With dead ends: 507 [2019-10-03 02:53:52,279 INFO L226 Difference]: Without dead ends: 507 [2019-10-03 02:53:52,280 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:53:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-10-03 02:53:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2019-10-03 02:53:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-03 02:53:52,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 689 transitions. [2019-10-03 02:53:52,296 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 689 transitions. Word has length 196 [2019-10-03 02:53:52,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:52,297 INFO L475 AbstractCegarLoop]: Abstraction has 506 states and 689 transitions. [2019-10-03 02:53:52,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:53:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 689 transitions. [2019-10-03 02:53:52,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-03 02:53:52,301 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:52,301 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] [2019-10-03 02:53:52,302 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 682247667, now seen corresponding path program 1 times [2019-10-03 02:53:52,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:52,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:52,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:52,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:52,752 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:53:52,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:52,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:53:52,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:52,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:53:52,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:53:52,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:53:52,759 INFO L87 Difference]: Start difference. First operand 506 states and 689 transitions. Second operand 11 states. [2019-10-03 02:53:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:57,581 INFO L93 Difference]: Finished difference Result 2122 states and 2871 transitions. [2019-10-03 02:53:57,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-03 02:53:57,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2019-10-03 02:53:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:57,593 INFO L225 Difference]: With dead ends: 2122 [2019-10-03 02:53:57,593 INFO L226 Difference]: Without dead ends: 1857 [2019-10-03 02:53:57,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-10-03 02:53:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1857 states. [2019-10-03 02:53:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1857 to 1842. [2019-10-03 02:53:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2019-10-03 02:53:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2431 transitions. [2019-10-03 02:53:57,718 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2431 transitions. Word has length 197 [2019-10-03 02:53:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:57,719 INFO L475 AbstractCegarLoop]: Abstraction has 1842 states and 2431 transitions. [2019-10-03 02:53:57,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:53:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2431 transitions. [2019-10-03 02:53:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 02:53:57,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:57,725 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] [2019-10-03 02:53:57,725 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:57,726 INFO L82 PathProgramCache]: Analyzing trace with hash 812844325, now seen corresponding path program 1 times [2019-10-03 02:53:57,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:57,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:57,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:57,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:58,088 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:53:58,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:58,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-03 02:53:58,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:58,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-03 02:53:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-03 02:53:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:53:58,092 INFO L87 Difference]: Start difference. First operand 1842 states and 2431 transitions. Second operand 18 states. [2019-10-03 02:53:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:58,516 INFO L93 Difference]: Finished difference Result 1787 states and 2359 transitions. [2019-10-03 02:53:58,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-03 02:53:58,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 198 [2019-10-03 02:53:58,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:58,531 INFO L225 Difference]: With dead ends: 1787 [2019-10-03 02:53:58,531 INFO L226 Difference]: Without dead ends: 1515 [2019-10-03 02:53:58,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 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:53:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2019-10-03 02:53:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1475. [2019-10-03 02:53:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-10-03 02:53:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1940 transitions. [2019-10-03 02:53:58,642 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1940 transitions. Word has length 198 [2019-10-03 02:53:58,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:58,644 INFO L475 AbstractCegarLoop]: Abstraction has 1475 states and 1940 transitions. [2019-10-03 02:53:58,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-03 02:53:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1940 transitions. [2019-10-03 02:53:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-03 02:53:58,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:58,649 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] [2019-10-03 02:53:58,649 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:58,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:58,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1170622860, now seen corresponding path program 1 times [2019-10-03 02:53:58,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:58,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:58,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:58,881 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:53:58,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:58,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:53:58,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:58,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:53:58,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:53:58,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:53:58,883 INFO L87 Difference]: Start difference. First operand 1475 states and 1940 transitions. Second operand 6 states. [2019-10-03 02:53:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:53:59,420 INFO L93 Difference]: Finished difference Result 2941 states and 3890 transitions. [2019-10-03 02:53:59,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:53:59,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2019-10-03 02:53:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:53:59,440 INFO L225 Difference]: With dead ends: 2941 [2019-10-03 02:53:59,441 INFO L226 Difference]: Without dead ends: 2941 [2019-10-03 02:53:59,441 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:53:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2019-10-03 02:53:59,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2870. [2019-10-03 02:53:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2870 states. [2019-10-03 02:53:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2870 states to 2870 states and 3802 transitions. [2019-10-03 02:53:59,534 INFO L78 Accepts]: Start accepts. Automaton has 2870 states and 3802 transitions. Word has length 207 [2019-10-03 02:53:59,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:53:59,534 INFO L475 AbstractCegarLoop]: Abstraction has 2870 states and 3802 transitions. [2019-10-03 02:53:59,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:53:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2870 states and 3802 transitions. [2019-10-03 02:53:59,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-03 02:53:59,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:53:59,540 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:53:59,541 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:53:59,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:53:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash 783825131, now seen corresponding path program 1 times [2019-10-03 02:53:59,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:53:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:59,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:53:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:53:59,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:53:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:53:59,769 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:53:59,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:53:59,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:53:59,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:53:59,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:53:59,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:53:59,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:53:59,772 INFO L87 Difference]: Start difference. First operand 2870 states and 3802 transitions. Second operand 5 states. [2019-10-03 02:54:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:01,126 INFO L93 Difference]: Finished difference Result 8034 states and 10673 transitions. [2019-10-03 02:54:01,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:54:01,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 208 [2019-10-03 02:54:01,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:01,172 INFO L225 Difference]: With dead ends: 8034 [2019-10-03 02:54:01,172 INFO L226 Difference]: Without dead ends: 8034 [2019-10-03 02:54:01,173 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:54:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8034 states. [2019-10-03 02:54:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8034 to 7898. [2019-10-03 02:54:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7898 states. [2019-10-03 02:54:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 10496 transitions. [2019-10-03 02:54:01,450 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 10496 transitions. Word has length 208 [2019-10-03 02:54:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:01,451 INFO L475 AbstractCegarLoop]: Abstraction has 7898 states and 10496 transitions. [2019-10-03 02:54:01,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:54:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 10496 transitions. [2019-10-03 02:54:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-03 02:54:01,461 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:01,461 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:01,462 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:01,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:01,462 INFO L82 PathProgramCache]: Analyzing trace with hash 197049012, now seen corresponding path program 1 times [2019-10-03 02:54:01,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:01,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:01,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:01,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:01,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:01,659 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:54:01,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:01,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:01,660 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:01,661 INFO L87 Difference]: Start difference. First operand 7898 states and 10496 transitions. Second operand 11 states. [2019-10-03 02:54:02,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:02,078 INFO L93 Difference]: Finished difference Result 7418 states and 9857 transitions. [2019-10-03 02:54:02,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:54:02,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 208 [2019-10-03 02:54:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:02,122 INFO L225 Difference]: With dead ends: 7418 [2019-10-03 02:54:02,122 INFO L226 Difference]: Without dead ends: 6700 [2019-10-03 02:54:02,123 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:54:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6700 states. [2019-10-03 02:54:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6700 to 6496. [2019-10-03 02:54:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-10-03 02:54:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 8632 transitions. [2019-10-03 02:54:02,430 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 8632 transitions. Word has length 208 [2019-10-03 02:54:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:02,431 INFO L475 AbstractCegarLoop]: Abstraction has 6496 states and 8632 transitions. [2019-10-03 02:54:02,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 8632 transitions. [2019-10-03 02:54:02,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 02:54:02,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:02,447 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] [2019-10-03 02:54:02,447 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash -145871011, now seen corresponding path program 1 times [2019-10-03 02:54:02,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:02,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:02,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:02,624 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:02,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:02,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:02,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:02,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:02,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:02,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:02,626 INFO L87 Difference]: Start difference. First operand 6496 states and 8632 transitions. Second operand 3 states. [2019-10-03 02:54:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:02,680 INFO L93 Difference]: Finished difference Result 6808 states and 9209 transitions. [2019-10-03 02:54:02,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:02,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-03 02:54:02,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:02,719 INFO L225 Difference]: With dead ends: 6808 [2019-10-03 02:54:02,719 INFO L226 Difference]: Without dead ends: 6808 [2019-10-03 02:54:02,720 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:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6808 states. [2019-10-03 02:54:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6808 to 6804. [2019-10-03 02:54:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6804 states. [2019-10-03 02:54:02,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6804 states to 6804 states and 9205 transitions. [2019-10-03 02:54:02,914 INFO L78 Accepts]: Start accepts. Automaton has 6804 states and 9205 transitions. Word has length 237 [2019-10-03 02:54:02,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:02,914 INFO L475 AbstractCegarLoop]: Abstraction has 6804 states and 9205 transitions. [2019-10-03 02:54:02,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:02,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6804 states and 9205 transitions. [2019-10-03 02:54:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-03 02:54:02,927 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:02,928 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] [2019-10-03 02:54:02,928 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:02,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:02,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1397703735, now seen corresponding path program 1 times [2019-10-03 02:54:02,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:02,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:02,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:03,072 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:54:03,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:03,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:03,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:03,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:03,075 INFO L87 Difference]: Start difference. First operand 6804 states and 9205 transitions. Second operand 3 states. [2019-10-03 02:54:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:03,119 INFO L93 Difference]: Finished difference Result 7384 states and 10283 transitions. [2019-10-03 02:54:03,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:03,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-03 02:54:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:03,153 INFO L225 Difference]: With dead ends: 7384 [2019-10-03 02:54:03,153 INFO L226 Difference]: Without dead ends: 7384 [2019-10-03 02:54:03,153 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:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7384 states. [2019-10-03 02:54:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7384 to 7380. [2019-10-03 02:54:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7380 states. [2019-10-03 02:54:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7380 states to 7380 states and 10279 transitions. [2019-10-03 02:54:03,421 INFO L78 Accepts]: Start accepts. Automaton has 7380 states and 10279 transitions. Word has length 244 [2019-10-03 02:54:03,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:03,421 INFO L475 AbstractCegarLoop]: Abstraction has 7380 states and 10279 transitions. [2019-10-03 02:54:03,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 7380 states and 10279 transitions. [2019-10-03 02:54:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-03 02:54:03,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:03,439 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] [2019-10-03 02:54:03,439 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:03,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash -947840449, now seen corresponding path program 1 times [2019-10-03 02:54:03,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:03,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:03,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:03,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:03,668 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:03,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:03,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:03,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:03,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:03,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:03,671 INFO L87 Difference]: Start difference. First operand 7380 states and 10279 transitions. Second operand 8 states. [2019-10-03 02:54:08,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:08,574 INFO L93 Difference]: Finished difference Result 15191 states and 22277 transitions. [2019-10-03 02:54:08,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:08,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 239 [2019-10-03 02:54:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:08,672 INFO L225 Difference]: With dead ends: 15191 [2019-10-03 02:54:08,672 INFO L226 Difference]: Without dead ends: 15191 [2019-10-03 02:54:08,674 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:54:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15191 states. [2019-10-03 02:54:09,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15191 to 9464. [2019-10-03 02:54:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9464 states. [2019-10-03 02:54:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9464 states to 9464 states and 14543 transitions. [2019-10-03 02:54:09,060 INFO L78 Accepts]: Start accepts. Automaton has 9464 states and 14543 transitions. Word has length 239 [2019-10-03 02:54:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:09,061 INFO L475 AbstractCegarLoop]: Abstraction has 9464 states and 14543 transitions. [2019-10-03 02:54:09,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9464 states and 14543 transitions. [2019-10-03 02:54:09,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-03 02:54:09,098 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:09,099 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] [2019-10-03 02:54:09,099 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:09,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:09,099 INFO L82 PathProgramCache]: Analyzing trace with hash -396121253, now seen corresponding path program 1 times [2019-10-03 02:54:09,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:09,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:09,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:09,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:09,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:09,383 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:54:09,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:09,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:09,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:09,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:09,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:09,385 INFO L87 Difference]: Start difference. First operand 9464 states and 14543 transitions. Second operand 8 states. [2019-10-03 02:54:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:13,773 INFO L93 Difference]: Finished difference Result 19895 states and 32709 transitions. [2019-10-03 02:54:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:13,774 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 246 [2019-10-03 02:54:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:13,843 INFO L225 Difference]: With dead ends: 19895 [2019-10-03 02:54:13,843 INFO L226 Difference]: Without dead ends: 19895 [2019-10-03 02:54:13,843 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:54:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19895 states. [2019-10-03 02:54:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19895 to 13752. [2019-10-03 02:54:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13752 states. [2019-10-03 02:54:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13752 states to 13752 states and 23911 transitions. [2019-10-03 02:54:14,349 INFO L78 Accepts]: Start accepts. Automaton has 13752 states and 23911 transitions. Word has length 246 [2019-10-03 02:54:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:14,350 INFO L475 AbstractCegarLoop]: Abstraction has 13752 states and 23911 transitions. [2019-10-03 02:54:14,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13752 states and 23911 transitions. [2019-10-03 02:54:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-03 02:54:14,435 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:14,436 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] [2019-10-03 02:54:14,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 2079367527, now seen corresponding path program 1 times [2019-10-03 02:54:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:14,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:14,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:14,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:14,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:14,637 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:54:14,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:14,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:54:14,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:14,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:54:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:54:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:54:14,639 INFO L87 Difference]: Start difference. First operand 13752 states and 23911 transitions. Second operand 8 states. [2019-10-03 02:54:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:18,891 INFO L93 Difference]: Finished difference Result 29455 states and 55209 transitions. [2019-10-03 02:54:18,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:54:18,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 247 [2019-10-03 02:54:18,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:19,029 INFO L225 Difference]: With dead ends: 29455 [2019-10-03 02:54:19,029 INFO L226 Difference]: Without dead ends: 29455 [2019-10-03 02:54:19,030 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:54:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29455 states. [2019-10-03 02:54:19,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29455 to 22456. [2019-10-03 02:54:19,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22456 states. [2019-10-03 02:54:21,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22456 states to 22456 states and 44187 transitions. [2019-10-03 02:54:21,036 INFO L78 Accepts]: Start accepts. Automaton has 22456 states and 44187 transitions. Word has length 247 [2019-10-03 02:54:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:21,037 INFO L475 AbstractCegarLoop]: Abstraction has 22456 states and 44187 transitions. [2019-10-03 02:54:21,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:54:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 22456 states and 44187 transitions. [2019-10-03 02:54:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-03 02:54:21,139 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:21,140 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, 1, 1] [2019-10-03 02:54:21,140 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -916448626, now seen corresponding path program 1 times [2019-10-03 02:54:21,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:21,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:21,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:21,361 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:54:21,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:21,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:54:21,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:21,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:54:21,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:54:21,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:54:21,363 INFO L87 Difference]: Start difference. First operand 22456 states and 44187 transitions. Second operand 11 states. [2019-10-03 02:54:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:22,446 INFO L93 Difference]: Finished difference Result 27398 states and 50705 transitions. [2019-10-03 02:54:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:54:22,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 245 [2019-10-03 02:54:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:22,566 INFO L225 Difference]: With dead ends: 27398 [2019-10-03 02:54:22,566 INFO L226 Difference]: Without dead ends: 27394 [2019-10-03 02:54:22,567 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:54:22,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27394 states. [2019-10-03 02:54:23,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27394 to 27104. [2019-10-03 02:54:23,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27104 states. [2019-10-03 02:54:23,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27104 states to 27104 states and 50343 transitions. [2019-10-03 02:54:23,820 INFO L78 Accepts]: Start accepts. Automaton has 27104 states and 50343 transitions. Word has length 245 [2019-10-03 02:54:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:23,821 INFO L475 AbstractCegarLoop]: Abstraction has 27104 states and 50343 transitions. [2019-10-03 02:54:23,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:54:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 27104 states and 50343 transitions. [2019-10-03 02:54:23,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-03 02:54:23,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:23,919 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:23,919 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:23,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1893673352, now seen corresponding path program 1 times [2019-10-03 02:54:23,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:23,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:23,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:23,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:54:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:54:24,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:54:24,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 264 with the following transitions: [2019-10-03 02:54:24,979 INFO L207 CegarAbsIntRunner]: [59], [62], [72], [92], [95], [110], [126], [129], [130], [133], [142], [143], [144], [146], [228], [231], [237], [256], [258], [262], [265], [266], [267], [270], [276], [303], [306], [315], [336], [338], [339], [342], [352], [355], [357], [360], [362], [364], [425], [428], [437], [538], [541], [551], [613], [615], [616], [617], [633], [636], [650], [653], [656], [670], [706], [707], [718], [720], [722], [725], [729], [732], [734], [735], [737], [740], [744], [758], [762], [765], [783], [786], [811], [844], [845], [854], [858], [860], [862], [865], [872], [879], [884], [891], [894], [896], [901], [905], [908], [910], [1090], [1093], [1096], [1140], [1141], [1144], [1147], [1150], [1194], [1195], [1217], [1228], [1231], [1232], [1235], [1238], [1269], [1270], [1272], [1274], [1277], [1285], [1287], [1356], [1359], [1365], [1400], [1403], [1417], [1423], [1426], [1435], [1502], [1505], [1507], [1509], [1511], [1516], [1526], [1528], [1529], [1649], [1651], [1653], [1655], [1656], [1672], [1673], [1674], [1675], [1676], [1677], [1678], [1688], [1689], [1690], [1691], [1692], [1693], [1696], [1697], [1698], [1699], [1700], [1702], [1703], [1704], [1705], [1722], [1723], [1724], [1725], [1726], [1727], [1768], [1769], [1788], [1789], [1790], [1791], [1792], [1794], [1795], [1800], [1801], [1802], [1803], [1804], [1805], [1806], [1807], [1808], [1810], [1811], [1812], [1813], [1822], [1838], [1839], [1842], [1843], [1844], [1845], [1856], [1858], [1859], [1860], [1862], [1863], [1864], [1865], [1866], [1867], [1868], [1869], [1870], [1871], [1872], [1873], [1874], [1876], [1877], [1878], [1884], [1885], [1886], [1887], [1888], [1889], [1890], [1894], [1895], [1900], [1901], [1902], [1903], [1904], [1905], [1906], [1907], [1908] [2019-10-03 02:54:25,022 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:54:25,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:54:25,134 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:54:25,135 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 208 root evaluator evaluations with a maximum evaluation depth of 0. Performed 208 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 382 variables. [2019-10-03 02:54:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:25,140 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:54:25,225 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:54:25,225 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:54:25,235 INFO L420 sIntCurrentIteration]: We unified 262 AI predicates to 262 [2019-10-03 02:54:25,235 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:54:25,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:54:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [41] total 41 [2019-10-03 02:54:25,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:25,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:25,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:25,241 INFO L87 Difference]: Start difference. First operand 27104 states and 50343 transitions. Second operand 2 states. [2019-10-03 02:54:25,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:25,241 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:54:25,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:25,242 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 263 [2019-10-03 02:54:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:25,242 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:54:25,242 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:54:25,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 262 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:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:54:25,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:54:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:54:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:54:25,245 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2019-10-03 02:54:25,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:25,246 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:54:25,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:54:25,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:54:25,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:54:25 BoogieIcfgContainer [2019-10-03 02:54:25,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:54:25,254 INFO L168 Benchmark]: Toolchain (without parser) took 38406.49 ms. Allocated memory was 137.4 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 81.7 MB in the beginning and 545.6 MB in the end (delta: -463.9 MB). Peak memory consumption was 662.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:25,256 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory is still 103.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 02:54:25,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 985.14 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 81.7 MB in the beginning and 132.1 MB in the end (delta: -50.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:25,262 INFO L168 Benchmark]: Boogie Preprocessor took 203.46 ms. Allocated memory is still 199.8 MB. Free memory was 132.1 MB in the beginning and 123.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:25,263 INFO L168 Benchmark]: RCFGBuilder took 2422.84 ms. Allocated memory was 199.8 MB in the beginning and 277.3 MB in the end (delta: 77.6 MB). Free memory was 123.1 MB in the beginning and 166.6 MB in the end (delta: -43.6 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:25,264 INFO L168 Benchmark]: TraceAbstraction took 34790.15 ms. Allocated memory was 277.3 MB in the beginning and 1.3 GB in the end (delta: 986.2 MB). Free memory was 166.6 MB in the beginning and 545.6 MB in the end (delta: -379.0 MB). Peak memory consumption was 607.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:54:25,272 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.22 ms. Allocated memory is still 137.4 MB. Free memory is still 103.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 985.14 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 81.7 MB in the beginning and 132.1 MB in the end (delta: -50.4 MB). Peak memory consumption was 30.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 203.46 ms. Allocated memory is still 199.8 MB. Free memory was 132.1 MB in the beginning and 123.1 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2422.84 ms. Allocated memory was 199.8 MB in the beginning and 277.3 MB in the end (delta: 77.6 MB). Free memory was 123.1 MB in the beginning and 166.6 MB in the end (delta: -43.6 MB). Peak memory consumption was 84.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34790.15 ms. Allocated memory was 277.3 MB in the beginning and 1.3 GB in the end (delta: 986.2 MB). Free memory was 166.6 MB in the beginning and 545.6 MB in the end (delta: -379.0 MB). Peak memory consumption was 607.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2972]: 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 113 procedures, 781 locations, 1 error locations. SAFE Result, 34.7s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10470 SDtfs, 9344 SDslu, 37659 SDs, 0 SdLazy, 15290 SolverSat, 2707 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27104occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.9274809160305344 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 19635 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 3314 NumberOfCodeBlocks, 3314 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3299 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 610/612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...