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_spec0_product10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:29:11,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:29:11,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:29:11,878 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:29:11,878 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:29:11,880 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:29:11,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:29:11,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:29:11,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:29:11,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:29:11,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:29:11,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:29:11,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:29:11,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:29:11,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:29:11,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:29:11,892 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:29:11,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:29:11,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:29:11,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:29:11,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:29:11,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:29:11,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:29:11,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:29:11,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:29:11,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:29:11,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:29:11,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:29:11,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:29:11,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:29:11,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:29:11,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:29:11,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:29:11,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:29:11,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:29:11,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:29:11,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:29:11,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:29:11,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:29:11,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:29:11,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:29:11,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:29:11,928 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:29:11,929 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:29:11,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:29:11,929 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:29:11,930 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:29:11,930 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:29:11,931 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:29:11,931 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:29:11,931 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:29:11,931 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:29:11,932 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:29:11,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:29:11,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:29:11,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:29:11,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:29:11,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:29:11,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:29:11,933 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:29:11,934 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:29:11,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:29:11,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:29:11,934 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:29:11,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:29:11,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:29:11,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:29:11,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:29:11,935 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:29:11,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:29:11,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:29:11,936 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:29:11,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:29:11,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:29:11,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:29:11,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:29:11,983 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:29:11,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product10.cil.c [2019-09-20 13:29:12,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8735a5e/a080e641b4aa432c87c7cf3684cd9371/FLAGb3c1ef0fe [2019-09-20 13:29:12,568 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:29:12,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product10.cil.c [2019-09-20 13:29:12,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8735a5e/a080e641b4aa432c87c7cf3684cd9371/FLAGb3c1ef0fe [2019-09-20 13:29:12,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef8735a5e/a080e641b4aa432c87c7cf3684cd9371 [2019-09-20 13:29:12,884 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:29:12,886 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:29:12,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:29:12,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:29:12,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:29:12,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:29:12" (1/1) ... [2019-09-20 13:29:12,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56745d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:12, skipping insertion in model container [2019-09-20 13:29:12,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:29:12" (1/1) ... [2019-09-20 13:29:12,908 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:29:12,996 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:29:13,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:29:13,710 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:29:13,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:29:13,956 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:29:13,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13 WrapperNode [2019-09-20 13:29:13,958 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:29:13,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:29:13,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:29:13,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:29:13,974 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:13,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:14,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:14,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:14,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:14,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:14,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... [2019-09-20 13:29:14,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:29:14,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:29:14,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:29:14,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:29:14,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:29:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:29:14,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:29:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-20 13:29:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-20 13:29:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-20 13:29:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-20 13:29:14,240 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-20 13:29:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-20 13:29:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-20 13:29:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-20 13:29:14,241 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-20 13:29:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-20 13:29:14,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-20 13:29:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-20 13:29:14,243 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-20 13:29:14,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-20 13:29:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-20 13:29:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-20 13:29:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-20 13:29:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Base [2019-09-20 13:29:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-09-20 13:29:14,245 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-20 13:29:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-20 13:29:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-20 13:29:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-20 13:29:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-20 13:29:14,247 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-20 13:29:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-20 13:29:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-20 13:29:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-20 13:29:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-20 13:29:14,248 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-20 13:29:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-20 13:29:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-20 13:29:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-20 13:29:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-20 13:29:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:29:14,249 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-20 13:29:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-20 13:29:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-20 13:29:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-20 13:29:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-20 13:29:14,250 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-20 13:29:14,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-20 13:29:14,251 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-20 13:29:14,251 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-20 13:29:14,251 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-20 13:29:14,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-20 13:29:14,252 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-20 13:29:14,252 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-20 13:29:14,252 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-20 13:29:14,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-20 13:29:14,253 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-20 13:29:14,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-20 13:29:14,253 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-20 13:29:14,253 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-20 13:29:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-20 13:29:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-20 13:29:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-20 13:29:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-20 13:29:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-20 13:29:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-20 13:29:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-20 13:29:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-20 13:29:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-20 13:29:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-20 13:29:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-20 13:29:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-20 13:29:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-20 13:29:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-20 13:29:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-20 13:29:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-20 13:29:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-20 13:29:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-20 13:29:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-20 13:29:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-20 13:29:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-20 13:29:14,259 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-20 13:29:14,259 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-20 13:29:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-20 13:29:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-20 13:29:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-20 13:29:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-20 13:29:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-20 13:29:14,260 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-20 13:29:14,261 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-20 13:29:14,262 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-20 13:29:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-20 13:29:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-20 13:29:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-20 13:29:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-20 13:29:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-20 13:29:14,263 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-20 13:29:14,264 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-20 13:29:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:29:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:29:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-20 13:29:14,264 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-20 13:29:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:29:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-20 13:29:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-20 13:29:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-20 13:29:14,265 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-20 13:29:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-20 13:29:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-20 13:29:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-20 13:29:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-20 13:29:14,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-20 13:29:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:29:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:29:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-20 13:29:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:29:14,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:29:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:29:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:29:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-20 13:29:14,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:29:14,269 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-20 13:29:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-20 13:29:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:29:14,270 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-20 13:29:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-20 13:29:14,271 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-20 13:29:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-20 13:29:14,272 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-20 13:29:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-20 13:29:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-20 13:29:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-20 13:29:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-20 13:29:14,273 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-20 13:29:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-20 13:29:14,274 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-20 13:29:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-20 13:29:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-20 13:29:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-20 13:29:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-20 13:29:14,275 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-20 13:29:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-20 13:29:14,276 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-20 13:29:14,280 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-20 13:29:14,281 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-20 13:29:14,281 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-20 13:29:14,281 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-20 13:29:14,288 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-20 13:29:14,288 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-20 13:29:14,288 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Base [2019-09-20 13:29:14,288 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-09-20 13:29:14,288 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-20 13:29:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-20 13:29:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-20 13:29:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-20 13:29:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-20 13:29:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-20 13:29:14,289 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-20 13:29:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-20 13:29:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-20 13:29:14,290 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-20 13:29:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:29:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-20 13:29:14,291 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-20 13:29:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-20 13:29:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-20 13:29:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-20 13:29:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-20 13:29:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-20 13:29:14,292 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-20 13:29:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-20 13:29:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-20 13:29:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-20 13:29:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-20 13:29:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-20 13:29:14,293 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-20 13:29:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-20 13:29:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-20 13:29:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-20 13:29:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-20 13:29:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-20 13:29:14,294 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-20 13:29:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-20 13:29:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-20 13:29:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-20 13:29:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-20 13:29:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-20 13:29:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-20 13:29:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-20 13:29:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-20 13:29:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-20 13:29:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-20 13:29:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-20 13:29:14,297 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:29:14,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:29:16,307 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:29:16,308 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:29:16,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:29:16 BoogieIcfgContainer [2019-09-20 13:29:16,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:29:16,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:29:16,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:29:16,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:29:16,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:29:12" (1/3) ... [2019-09-20 13:29:16,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8eda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:29:16, skipping insertion in model container [2019-09-20 13:29:16,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:29:13" (2/3) ... [2019-09-20 13:29:16,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8eda3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:29:16, skipping insertion in model container [2019-09-20 13:29:16,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:29:16" (3/3) ... [2019-09-20 13:29:16,318 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product10.cil.c [2019-09-20 13:29:16,330 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:29:16,349 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:29:16,368 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:29:16,402 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:29:16,402 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:29:16,403 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:29:16,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:29:16,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:29:16,403 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:29:16,403 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:29:16,403 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:29:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states. [2019-09-20 13:29:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-20 13:29:16,465 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:16,467 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:16,470 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:16,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:16,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1528307460, now seen corresponding path program 1 times [2019-09-20 13:29:16,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:16,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:16,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:16,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:17,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:17,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:29:17,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:17,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:29:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:29:17,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:29:17,163 INFO L87 Difference]: Start difference. First operand 260 states. Second operand 2 states. [2019-09-20 13:29:17,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:17,210 INFO L93 Difference]: Finished difference Result 256 states and 320 transitions. [2019-09-20 13:29:17,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:29:17,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 141 [2019-09-20 13:29:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:17,230 INFO L225 Difference]: With dead ends: 256 [2019-09-20 13:29:17,230 INFO L226 Difference]: Without dead ends: 247 [2019-09-20 13:29:17,232 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:29:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-09-20 13:29:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-09-20 13:29:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-20 13:29:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2019-09-20 13:29:17,316 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 141 [2019-09-20 13:29:17,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:17,319 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2019-09-20 13:29:17,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:29:17,319 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2019-09-20 13:29:17,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:29:17,331 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:17,331 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:17,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:17,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 842452669, now seen corresponding path program 1 times [2019-09-20 13:29:17,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:17,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:17,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:17,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:17,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:17,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:17,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:29:17,623 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:17,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:29:17,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:29:17,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:17,626 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand 3 states. [2019-09-20 13:29:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:17,664 INFO L93 Difference]: Finished difference Result 250 states and 312 transitions. [2019-09-20 13:29:17,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:29:17,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-20 13:29:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:17,671 INFO L225 Difference]: With dead ends: 250 [2019-09-20 13:29:17,671 INFO L226 Difference]: Without dead ends: 250 [2019-09-20 13:29:17,673 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-20 13:29:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2019-09-20 13:29:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-20 13:29:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 311 transitions. [2019-09-20 13:29:17,713 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 311 transitions. Word has length 142 [2019-09-20 13:29:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:17,716 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 311 transitions. [2019-09-20 13:29:17,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:29:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 311 transitions. [2019-09-20 13:29:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-20 13:29:17,721 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:17,725 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:17,726 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:17,726 INFO L82 PathProgramCache]: Analyzing trace with hash 515777855, now seen corresponding path program 1 times [2019-09-20 13:29:17,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:17,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:17,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:17,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:17,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:29:18,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:18,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:29:18,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:18,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:29:18,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:29:18,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:29:18,036 INFO L87 Difference]: Start difference. First operand 249 states and 311 transitions. Second operand 6 states. [2019-09-20 13:29:18,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:18,482 INFO L93 Difference]: Finished difference Result 458 states and 579 transitions. [2019-09-20 13:29:18,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:29:18,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-09-20 13:29:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:18,497 INFO L225 Difference]: With dead ends: 458 [2019-09-20 13:29:18,497 INFO L226 Difference]: Without dead ends: 458 [2019-09-20 13:29:18,498 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:29:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-20 13:29:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 449. [2019-09-20 13:29:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-09-20 13:29:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 571 transitions. [2019-09-20 13:29:18,558 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 571 transitions. Word has length 147 [2019-09-20 13:29:18,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:18,561 INFO L475 AbstractCegarLoop]: Abstraction has 449 states and 571 transitions. [2019-09-20 13:29:18,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:29:18,561 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 571 transitions. [2019-09-20 13:29:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-20 13:29:18,567 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:18,567 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:18,568 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:18,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1213124858, now seen corresponding path program 1 times [2019-09-20 13:29:18,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:18,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:18,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:18,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:29:18,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:18,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:29:18,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:18,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:29:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:29:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:29:18,776 INFO L87 Difference]: Start difference. First operand 449 states and 571 transitions. Second operand 9 states. [2019-09-20 13:29:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:19,009 INFO L93 Difference]: Finished difference Result 479 states and 610 transitions. [2019-09-20 13:29:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:29:19,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2019-09-20 13:29:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:19,015 INFO L225 Difference]: With dead ends: 479 [2019-09-20 13:29:19,015 INFO L226 Difference]: Without dead ends: 479 [2019-09-20 13:29:19,016 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:29:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-20 13:29:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 469. [2019-09-20 13:29:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2019-09-20 13:29:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 597 transitions. [2019-09-20 13:29:19,052 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 597 transitions. Word has length 148 [2019-09-20 13:29:19,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:19,053 INFO L475 AbstractCegarLoop]: Abstraction has 469 states and 597 transitions. [2019-09-20 13:29:19,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:29:19,053 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 597 transitions. [2019-09-20 13:29:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-20 13:29:19,056 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:19,056 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:19,057 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -932352255, now seen corresponding path program 1 times [2019-09-20 13:29:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:19,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:19,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:29:19,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:19,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:29:19,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:19,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:29:19,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:29:19,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:29:19,204 INFO L87 Difference]: Start difference. First operand 469 states and 597 transitions. Second operand 6 states. [2019-09-20 13:29:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:19,588 INFO L93 Difference]: Finished difference Result 910 states and 1165 transitions. [2019-09-20 13:29:19,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:29:19,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-20 13:29:19,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:19,594 INFO L225 Difference]: With dead ends: 910 [2019-09-20 13:29:19,595 INFO L226 Difference]: Without dead ends: 910 [2019-09-20 13:29:19,595 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:29:19,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-09-20 13:29:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 889. [2019-09-20 13:29:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-09-20 13:29:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1145 transitions. [2019-09-20 13:29:19,638 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1145 transitions. Word has length 149 [2019-09-20 13:29:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:19,639 INFO L475 AbstractCegarLoop]: Abstraction has 889 states and 1145 transitions. [2019-09-20 13:29:19,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:29:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1145 transitions. [2019-09-20 13:29:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-20 13:29:19,643 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:19,643 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:19,644 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1577191424, now seen corresponding path program 1 times [2019-09-20 13:29:19,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:19,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:19,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:19,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:29:19,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:19,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-20 13:29:19,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:19,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:29:19,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:29:19,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:29:19,809 INFO L87 Difference]: Start difference. First operand 889 states and 1145 transitions. Second operand 9 states. [2019-09-20 13:29:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:19,981 INFO L93 Difference]: Finished difference Result 949 states and 1223 transitions. [2019-09-20 13:29:19,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:29:19,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-09-20 13:29:19,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:19,989 INFO L225 Difference]: With dead ends: 949 [2019-09-20 13:29:19,990 INFO L226 Difference]: Without dead ends: 949 [2019-09-20 13:29:19,990 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-20 13:29:19,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-09-20 13:29:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 929. [2019-09-20 13:29:20,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-09-20 13:29:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1197 transitions. [2019-09-20 13:29:20,041 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1197 transitions. Word has length 150 [2019-09-20 13:29:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:20,042 INFO L475 AbstractCegarLoop]: Abstraction has 929 states and 1197 transitions. [2019-09-20 13:29:20,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:29:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1197 transitions. [2019-09-20 13:29:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-20 13:29:20,048 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:20,049 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:20,049 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:20,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash 671950143, now seen corresponding path program 1 times [2019-09-20 13:29:20,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:20,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:20,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:29:20,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:20,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:29:20,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:20,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:29:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:29:20,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:29:20,324 INFO L87 Difference]: Start difference. First operand 929 states and 1197 transitions. Second operand 6 states. [2019-09-20 13:29:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:20,726 INFO L93 Difference]: Finished difference Result 1802 states and 2332 transitions. [2019-09-20 13:29:20,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:29:20,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-09-20 13:29:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:20,738 INFO L225 Difference]: With dead ends: 1802 [2019-09-20 13:29:20,739 INFO L226 Difference]: Without dead ends: 1661 [2019-09-20 13:29:20,739 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:29:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-09-20 13:29:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1628. [2019-09-20 13:29:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-09-20 13:29:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2130 transitions. [2019-09-20 13:29:20,842 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2130 transitions. Word has length 151 [2019-09-20 13:29:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:20,842 INFO L475 AbstractCegarLoop]: Abstraction has 1628 states and 2130 transitions. [2019-09-20 13:29:20,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:29:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2130 transitions. [2019-09-20 13:29:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-20 13:29:20,848 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:20,848 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:20,849 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash -680126903, now seen corresponding path program 1 times [2019-09-20 13:29:20,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:20,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:20,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:20,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:29:20,995 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:20,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:29:20,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:29:20,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:20,998 INFO L87 Difference]: Start difference. First operand 1628 states and 2130 transitions. Second operand 3 states. [2019-09-20 13:29:21,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:21,034 INFO L93 Difference]: Finished difference Result 1859 states and 2554 transitions. [2019-09-20 13:29:21,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:29:21,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-20 13:29:21,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:21,058 INFO L225 Difference]: With dead ends: 1859 [2019-09-20 13:29:21,058 INFO L226 Difference]: Without dead ends: 1859 [2019-09-20 13:29:21,059 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2019-09-20 13:29:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1852. [2019-09-20 13:29:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2019-09-20 13:29:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2547 transitions. [2019-09-20 13:29:21,171 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2547 transitions. Word has length 161 [2019-09-20 13:29:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:21,171 INFO L475 AbstractCegarLoop]: Abstraction has 1852 states and 2547 transitions. [2019-09-20 13:29:21,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:29:21,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2547 transitions. [2019-09-20 13:29:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:29:21,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:21,180 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:21,182 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:21,183 INFO L82 PathProgramCache]: Analyzing trace with hash -98177292, now seen corresponding path program 1 times [2019-09-20 13:29:21,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:21,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:21,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:21,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:21,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:21,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:21,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:29:21,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:21,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:29:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:29:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:21,404 INFO L87 Difference]: Start difference. First operand 1852 states and 2547 transitions. Second operand 3 states. [2019-09-20 13:29:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:21,454 INFO L93 Difference]: Finished difference Result 2267 states and 3316 transitions. [2019-09-20 13:29:21,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:29:21,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-20 13:29:21,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:21,477 INFO L225 Difference]: With dead ends: 2267 [2019-09-20 13:29:21,477 INFO L226 Difference]: Without dead ends: 2267 [2019-09-20 13:29:21,478 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2019-09-20 13:29:21,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2260. [2019-09-20 13:29:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2260 states. [2019-09-20 13:29:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3309 transitions. [2019-09-20 13:29:21,615 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3309 transitions. Word has length 162 [2019-09-20 13:29:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:21,617 INFO L475 AbstractCegarLoop]: Abstraction has 2260 states and 3309 transitions. [2019-09-20 13:29:21,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:29:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3309 transitions. [2019-09-20 13:29:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:29:21,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:21,625 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:21,625 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:21,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1588640761, now seen corresponding path program 1 times [2019-09-20 13:29:21,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:21,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:21,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:21,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:21,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:29:21,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:21,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:29:21,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:29:21,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:21,762 INFO L87 Difference]: Start difference. First operand 2260 states and 3309 transitions. Second operand 3 states. [2019-09-20 13:29:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:21,798 INFO L93 Difference]: Finished difference Result 3099 states and 4840 transitions. [2019-09-20 13:29:21,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:29:21,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-09-20 13:29:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:21,823 INFO L225 Difference]: With dead ends: 3099 [2019-09-20 13:29:21,823 INFO L226 Difference]: Without dead ends: 3099 [2019-09-20 13:29:21,823 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:21,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2019-09-20 13:29:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3092. [2019-09-20 13:29:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3092 states. [2019-09-20 13:29:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3092 states to 3092 states and 4833 transitions. [2019-09-20 13:29:21,933 INFO L78 Accepts]: Start accepts. Automaton has 3092 states and 4833 transitions. Word has length 163 [2019-09-20 13:29:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:21,934 INFO L475 AbstractCegarLoop]: Abstraction has 3092 states and 4833 transitions. [2019-09-20 13:29:21,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:29:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3092 states and 4833 transitions. [2019-09-20 13:29:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-20 13:29:21,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:21,944 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:21,945 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash -66197772, now seen corresponding path program 1 times [2019-09-20 13:29:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:21,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:21,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:21,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:22,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:22,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:29:22,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:22,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:29:22,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:29:22,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:22,057 INFO L87 Difference]: Start difference. First operand 3092 states and 4833 transitions. Second operand 3 states. [2019-09-20 13:29:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:22,109 INFO L93 Difference]: Finished difference Result 4731 states and 7792 transitions. [2019-09-20 13:29:22,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:29:22,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-20 13:29:22,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:22,137 INFO L225 Difference]: With dead ends: 4731 [2019-09-20 13:29:22,137 INFO L226 Difference]: Without dead ends: 4731 [2019-09-20 13:29:22,139 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-09-20 13:29:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4724. [2019-09-20 13:29:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4724 states. [2019-09-20 13:29:22,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4724 states to 4724 states and 7785 transitions. [2019-09-20 13:29:22,310 INFO L78 Accepts]: Start accepts. Automaton has 4724 states and 7785 transitions. Word has length 164 [2019-09-20 13:29:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:22,311 INFO L475 AbstractCegarLoop]: Abstraction has 4724 states and 7785 transitions. [2019-09-20 13:29:22,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:29:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4724 states and 7785 transitions. [2019-09-20 13:29:22,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-20 13:29:22,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:22,329 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:22,329 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash -2084030075, now seen corresponding path program 1 times [2019-09-20 13:29:22,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:22,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:22,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-20 13:29:22,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:22,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:29:22,457 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:22,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:29:22,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:29:22,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:22,459 INFO L87 Difference]: Start difference. First operand 4724 states and 7785 transitions. Second operand 3 states. [2019-09-20 13:29:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:22,527 INFO L93 Difference]: Finished difference Result 7931 states and 13504 transitions. [2019-09-20 13:29:22,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:29:22,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-09-20 13:29:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:22,600 INFO L225 Difference]: With dead ends: 7931 [2019-09-20 13:29:22,601 INFO L226 Difference]: Without dead ends: 7931 [2019-09-20 13:29:22,601 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:29:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-09-20 13:29:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7924. [2019-09-20 13:29:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7924 states. [2019-09-20 13:29:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13497 transitions. [2019-09-20 13:29:22,910 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13497 transitions. Word has length 165 [2019-09-20 13:29:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:22,911 INFO L475 AbstractCegarLoop]: Abstraction has 7924 states and 13497 transitions. [2019-09-20 13:29:22,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:29:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13497 transitions. [2019-09-20 13:29:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-20 13:29:22,944 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:29:22,944 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:29:22,944 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:29:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:29:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash 2079468918, now seen corresponding path program 1 times [2019-09-20 13:29:22,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:29:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:22,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:29:22,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:29:22,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:29:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:29:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-20 13:29:23,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:29:23,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:29:23,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:29:23,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:29:23,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:29:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:29:23,099 INFO L87 Difference]: Start difference. First operand 7924 states and 13497 transitions. Second operand 8 states. [2019-09-20 13:29:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:29:23,175 INFO L93 Difference]: Finished difference Result 7921 states and 13488 transitions. [2019-09-20 13:29:23,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:29:23,175 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 166 [2019-09-20 13:29:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:29:23,176 INFO L225 Difference]: With dead ends: 7921 [2019-09-20 13:29:23,176 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:29:23,176 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:29:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:29:23,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:29:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:29:23,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:29:23,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 166 [2019-09-20 13:29:23,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:29:23,178 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:29:23,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:29:23,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:29:23,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:29:23,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:29:23 BoogieIcfgContainer [2019-09-20 13:29:23,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:29:23,186 INFO L168 Benchmark]: Toolchain (without parser) took 10299.28 ms. Allocated memory was 131.1 MB in the beginning and 434.1 MB in the end (delta: 303.0 MB). Free memory was 84.4 MB in the beginning and 195.7 MB in the end (delta: -111.2 MB). Peak memory consumption was 191.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:29:23,187 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:29:23,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1071.51 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 84.0 MB in the beginning and 138.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:29:23,189 INFO L168 Benchmark]: Boogie Preprocessor took 192.33 ms. Allocated memory is still 199.2 MB. Free memory was 138.7 MB in the beginning and 131.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:29:23,190 INFO L168 Benchmark]: RCFGBuilder took 2154.48 ms. Allocated memory was 199.2 MB in the beginning and 273.2 MB in the end (delta: 73.9 MB). Free memory was 131.1 MB in the beginning and 219.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:29:23,190 INFO L168 Benchmark]: TraceAbstraction took 6872.43 ms. Allocated memory was 273.2 MB in the beginning and 434.1 MB in the end (delta: 161.0 MB). Free memory was 216.8 MB in the beginning and 195.7 MB in the end (delta: 21.2 MB). Peak memory consumption was 182.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:29:23,194 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 131.1 MB. Free memory was 105.1 MB in the beginning and 104.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1071.51 ms. Allocated memory was 131.1 MB in the beginning and 199.2 MB in the end (delta: 68.2 MB). Free memory was 84.0 MB in the beginning and 138.7 MB in the end (delta: -54.7 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 192.33 ms. Allocated memory is still 199.2 MB. Free memory was 138.7 MB in the beginning and 131.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2154.48 ms. Allocated memory was 199.2 MB in the beginning and 273.2 MB in the end (delta: 73.9 MB). Free memory was 131.1 MB in the beginning and 219.2 MB in the end (delta: -88.0 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6872.43 ms. Allocated memory was 273.2 MB in the beginning and 434.1 MB in the end (delta: 161.0 MB). Free memory was 216.8 MB in the beginning and 195.7 MB in the end (delta: 21.2 MB). Peak memory consumption was 182.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: 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 94 procedures, 622 locations, 1 error locations. SAFE Result, 6.7s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4133 SDtfs, 1085 SDslu, 11379 SDs, 0 SdLazy, 674 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7924occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 129 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2009 NumberOfCodeBlocks, 2009 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1996 ConstructedInterpolants, 0 QuantifiedInterpolants, 371068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 282/282 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...