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_spec11_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:50:21,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:50:21,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:50:21,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:50:21,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:50:21,939 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:50:21,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:50:21,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:50:21,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:50:21,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:50:21,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:50:21,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:50:21,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:50:21,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:50:21,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:50:21,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:50:21,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:50:21,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:50:21,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:50:21,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:50:21,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:50:21,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:50:21,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:50:21,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:50:21,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:50:21,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:50:21,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:50:21,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:50:21,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:50:21,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:50:21,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:50:21,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:50:21,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:50:21,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:50:21,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:50:21,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:50:21,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:50:21,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:50:21,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:50:21,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:50:21,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:50:21,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:50:22,008 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:50:22,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:50:22,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:50:22,009 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:50:22,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:50:22,010 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:50:22,010 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:50:22,010 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:50:22,011 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:50:22,011 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:50:22,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:50:22,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:50:22,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:50:22,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:50:22,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:50:22,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:50:22,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:50:22,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:50:22,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:50:22,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:50:22,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:50:22,014 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:50:22,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:50:22,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:22,014 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:50:22,014 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:50:22,015 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:50:22,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:50:22,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:50:22,015 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:50:22,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:50:22,056 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:50:22,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:50:22,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:50:22,067 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:50:22,068 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec11_product22.cil.c [2019-10-03 02:50:22,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4f7ee0d1/ae849b9a83aa4542acb5b8cd04c67b40/FLAGcf09761db [2019-10-03 02:50:22,689 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:50:22,690 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec11_product22.cil.c [2019-10-03 02:50:22,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4f7ee0d1/ae849b9a83aa4542acb5b8cd04c67b40/FLAGcf09761db [2019-10-03 02:50:22,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4f7ee0d1/ae849b9a83aa4542acb5b8cd04c67b40 [2019-10-03 02:50:22,918 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:50:22,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:50:22,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:22,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:50:22,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:50:22,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:22" (1/1) ... [2019-10-03 02:50:22,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30593915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:22, skipping insertion in model container [2019-10-03 02:50:22,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:50:22" (1/1) ... [2019-10-03 02:50:22,933 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:50:23,012 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:50:23,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:23,824 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:50:23,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:50:24,126 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:50:24,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24 WrapperNode [2019-10-03 02:50:24,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:50:24,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:50:24,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:50:24,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:50:24,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... [2019-10-03 02:50:24,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:50:24,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:50:24,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:50:24,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:50:24,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:50:24,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:24,394 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:50:24,395 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:50:24,396 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:50:24,397 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:50:24,398 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AutoResponder [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:50:24,399 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:50:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:50:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:50:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:50:24,400 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:50:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:50:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:50:24,401 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:50:24,402 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:50:24,403 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:50:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:50:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:50:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:50:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:50:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:50:24,404 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:50:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:50:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:50:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:50:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:50:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:50:24,405 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:50:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:50:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:50:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:50:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:50:24,406 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:50:24,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:50:24,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:50:24,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:50:24,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:50:24,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:24,407 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:50:24,408 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:24,408 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:50:24,408 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:50:24,408 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:50:24,408 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:50:24,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:50:24,409 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:50:24,409 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:50:24,409 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:50:24,410 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:50:24,410 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:50:24,410 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:50:24,410 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:50:24,410 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:50:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:50:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:50:24,411 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:50:24,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:24,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:24,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:24,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:50:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:50:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:50:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:50:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:50:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:50:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:50:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:50:24,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:50:24,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:50:24,416 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:50:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:50:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:50:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:50:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:50:24,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:50:24,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:50:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:50:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:50:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:50:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptAutoResponder_spec__1 [2019-10-03 02:50:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:50:24,420 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:50:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:50:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:50:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:50:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:50:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:50:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:50:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:50:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:50:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:50:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:50:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:50:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:50:24,423 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:50:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:50:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:50:24,424 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:50:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:50:24,428 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:50:24,429 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:50:24,429 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:50:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:50:24,437 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:50:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:50:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AutoResponder [2019-10-03 02:50:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:50:24,438 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:50:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:50:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:50:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:50:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:50:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:50:24,439 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:50:24,440 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:50:24,441 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:50:24,442 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:50:24,443 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:50:24,444 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:50:24,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:50:24,446 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:50:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:50:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:50:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:50:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:50:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:50:24,447 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:50:24,448 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:50:24,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:50:26,336 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:50:26,337 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:50:26,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:26 BoogieIcfgContainer [2019-10-03 02:50:26,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:50:26,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:50:26,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:50:26,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:50:26,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:50:22" (1/3) ... [2019-10-03 02:50:26,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b212c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:26, skipping insertion in model container [2019-10-03 02:50:26,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:50:24" (2/3) ... [2019-10-03 02:50:26,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b212c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:50:26, skipping insertion in model container [2019-10-03 02:50:26,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:50:26" (3/3) ... [2019-10-03 02:50:26,346 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product22.cil.c [2019-10-03 02:50:26,356 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:50:26,368 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:50:26,384 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:50:26,411 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:50:26,411 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:50:26,411 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:50:26,411 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:50:26,412 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:50:26,412 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:50:26,412 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:50:26,412 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:50:26,447 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states. [2019-10-03 02:50:26,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 02:50:26,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:26,500 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:26,503 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:26,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:26,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1913832913, now seen corresponding path program 1 times [2019-10-03 02:50:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:26,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:26,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:27,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:27,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:50:27,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:27,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:50:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:50:27,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:27,157 INFO L87 Difference]: Start difference. First operand 505 states. Second operand 2 states. [2019-10-03 02:50:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:27,209 INFO L93 Difference]: Finished difference Result 491 states and 649 transitions. [2019-10-03 02:50:27,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:50:27,211 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 186 [2019-10-03 02:50:27,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:27,233 INFO L225 Difference]: With dead ends: 491 [2019-10-03 02:50:27,233 INFO L226 Difference]: Without dead ends: 482 [2019-10-03 02:50:27,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:50:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-10-03 02:50:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-10-03 02:50:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-10-03 02:50:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 638 transitions. [2019-10-03 02:50:27,384 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 638 transitions. Word has length 186 [2019-10-03 02:50:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:27,388 INFO L475 AbstractCegarLoop]: Abstraction has 482 states and 638 transitions. [2019-10-03 02:50:27,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:50:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 638 transitions. [2019-10-03 02:50:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-03 02:50:27,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:27,397 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:27,397 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash -593424949, now seen corresponding path program 1 times [2019-10-03 02:50:27,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:27,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:27,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:27,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:27,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:27,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:27,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:27,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:27,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:27,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:27,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:27,696 INFO L87 Difference]: Start difference. First operand 482 states and 638 transitions. Second operand 3 states. [2019-10-03 02:50:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:27,743 INFO L93 Difference]: Finished difference Result 485 states and 641 transitions. [2019-10-03 02:50:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-03 02:50:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:27,749 INFO L225 Difference]: With dead ends: 485 [2019-10-03 02:50:27,749 INFO L226 Difference]: Without dead ends: 485 [2019-10-03 02:50:27,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-10-03 02:50:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 484. [2019-10-03 02:50:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-03 02:50:27,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 640 transitions. [2019-10-03 02:50:27,779 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 640 transitions. Word has length 187 [2019-10-03 02:50:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:27,780 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 640 transitions. [2019-10-03 02:50:27,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 640 transitions. [2019-10-03 02:50:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:50:27,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:27,785 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:27,785 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -463058359, now seen corresponding path program 1 times [2019-10-03 02:50:27,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:27,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:27,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:27,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:27,992 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:27,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:27,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:27,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:27,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:27,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:27,997 INFO L87 Difference]: Start difference. First operand 484 states and 640 transitions. Second operand 3 states. [2019-10-03 02:50:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:28,027 INFO L93 Difference]: Finished difference Result 527 states and 713 transitions. [2019-10-03 02:50:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:28,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-03 02:50:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:28,032 INFO L225 Difference]: With dead ends: 527 [2019-10-03 02:50:28,032 INFO L226 Difference]: Without dead ends: 527 [2019-10-03 02:50:28,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-10-03 02:50:28,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 526. [2019-10-03 02:50:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-10-03 02:50:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 712 transitions. [2019-10-03 02:50:28,055 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 712 transitions. Word has length 199 [2019-10-03 02:50:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:28,056 INFO L475 AbstractCegarLoop]: Abstraction has 526 states and 712 transitions. [2019-10-03 02:50:28,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 712 transitions. [2019-10-03 02:50:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:50:28,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:28,061 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:28,061 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -364676623, now seen corresponding path program 1 times [2019-10-03 02:50:28,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:28,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:28,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:28,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:28,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:28,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:28,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:28,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:28,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,221 INFO L87 Difference]: Start difference. First operand 526 states and 712 transitions. Second operand 3 states. [2019-10-03 02:50:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:28,247 INFO L93 Difference]: Finished difference Result 608 states and 851 transitions. [2019-10-03 02:50:28,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:28,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-10-03 02:50:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:28,253 INFO L225 Difference]: With dead ends: 608 [2019-10-03 02:50:28,253 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:50:28,254 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:28,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:50:28,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 607. [2019-10-03 02:50:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:50:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 850 transitions. [2019-10-03 02:50:28,281 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 850 transitions. Word has length 200 [2019-10-03 02:50:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:28,282 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 850 transitions. [2019-10-03 02:50:28,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 850 transitions. [2019-10-03 02:50:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:50:28,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:28,289 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:28,289 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:28,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1850375443, now seen corresponding path program 1 times [2019-10-03 02:50:28,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:28,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:28,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:28,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:50:28,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:28,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:50:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:50:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:28,797 INFO L87 Difference]: Start difference. First operand 607 states and 850 transitions. Second operand 19 states. [2019-10-03 02:50:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:33,419 INFO L93 Difference]: Finished difference Result 1699 states and 2381 transitions. [2019-10-03 02:50:33,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:50:33,420 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 203 [2019-10-03 02:50:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:33,436 INFO L225 Difference]: With dead ends: 1699 [2019-10-03 02:50:33,436 INFO L226 Difference]: Without dead ends: 1699 [2019-10-03 02:50:33,438 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:50:33,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2019-10-03 02:50:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1662. [2019-10-03 02:50:33,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1662 states. [2019-10-03 02:50:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2334 transitions. [2019-10-03 02:50:33,516 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2334 transitions. Word has length 203 [2019-10-03 02:50:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:33,518 INFO L475 AbstractCegarLoop]: Abstraction has 1662 states and 2334 transitions. [2019-10-03 02:50:33,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:50:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2334 transitions. [2019-10-03 02:50:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:50:33,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:33,526 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:33,526 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash -956589383, now seen corresponding path program 1 times [2019-10-03 02:50:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:33,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:33,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:33,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:33,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:50:33,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:33,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:50:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:50:33,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:33,820 INFO L87 Difference]: Start difference. First operand 1662 states and 2334 transitions. Second operand 15 states. [2019-10-03 02:50:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:37,026 INFO L93 Difference]: Finished difference Result 1764 states and 2480 transitions. [2019-10-03 02:50:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:50:37,027 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 204 [2019-10-03 02:50:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:37,038 INFO L225 Difference]: With dead ends: 1764 [2019-10-03 02:50:37,038 INFO L226 Difference]: Without dead ends: 1764 [2019-10-03 02:50:37,039 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:50:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-10-03 02:50:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1732. [2019-10-03 02:50:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-10-03 02:50:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2445 transitions. [2019-10-03 02:50:37,122 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2445 transitions. Word has length 204 [2019-10-03 02:50:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:37,123 INFO L475 AbstractCegarLoop]: Abstraction has 1732 states and 2445 transitions. [2019-10-03 02:50:37,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:50:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2445 transitions. [2019-10-03 02:50:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:50:37,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:37,132 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:37,132 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 489053248, now seen corresponding path program 1 times [2019-10-03 02:50:37,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:37,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 02:50:37,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:37,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-03 02:50:37,467 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:37,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-03 02:50:37,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-03 02:50:37,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-03 02:50:37,469 INFO L87 Difference]: Start difference. First operand 1732 states and 2445 transitions. Second operand 14 states. [2019-10-03 02:50:37,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:37,742 INFO L93 Difference]: Finished difference Result 1834 states and 2585 transitions. [2019-10-03 02:50:37,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:50:37,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2019-10-03 02:50:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:37,753 INFO L225 Difference]: With dead ends: 1834 [2019-10-03 02:50:37,753 INFO L226 Difference]: Without dead ends: 1792 [2019-10-03 02:50:37,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:50:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2019-10-03 02:50:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1761. [2019-10-03 02:50:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-10-03 02:50:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2476 transitions. [2019-10-03 02:50:37,846 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2476 transitions. Word has length 204 [2019-10-03 02:50:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:37,848 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2476 transitions. [2019-10-03 02:50:37,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-03 02:50:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2476 transitions. [2019-10-03 02:50:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:50:37,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:37,857 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:37,858 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:37,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1632558215, now seen corresponding path program 1 times [2019-10-03 02:50:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:37,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:37,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:37,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:38,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:38,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:38,063 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:38,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:38,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:38,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:38,066 INFO L87 Difference]: Start difference. First operand 1761 states and 2476 transitions. Second operand 5 states. [2019-10-03 02:50:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:39,078 INFO L93 Difference]: Finished difference Result 3607 states and 5017 transitions. [2019-10-03 02:50:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:50:39,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-10-03 02:50:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:39,099 INFO L225 Difference]: With dead ends: 3607 [2019-10-03 02:50:39,099 INFO L226 Difference]: Without dead ends: 3537 [2019-10-03 02:50:39,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2019-10-03 02:50:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3506. [2019-10-03 02:50:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2019-10-03 02:50:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 4880 transitions. [2019-10-03 02:50:39,269 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 4880 transitions. Word has length 204 [2019-10-03 02:50:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:39,269 INFO L475 AbstractCegarLoop]: Abstraction has 3506 states and 4880 transitions. [2019-10-03 02:50:39,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 4880 transitions. [2019-10-03 02:50:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-03 02:50:39,283 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:39,283 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:39,284 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash 677036936, now seen corresponding path program 1 times [2019-10-03 02:50:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:39,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:39,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:39,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:39,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:50:39,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:39,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:50:39,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:50:39,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:50:39,500 INFO L87 Difference]: Start difference. First operand 3506 states and 4880 transitions. Second operand 7 states. [2019-10-03 02:50:41,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:41,073 INFO L93 Difference]: Finished difference Result 8412 states and 11668 transitions. [2019-10-03 02:50:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:50:41,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2019-10-03 02:50:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:41,132 INFO L225 Difference]: With dead ends: 8412 [2019-10-03 02:50:41,132 INFO L226 Difference]: Without dead ends: 8412 [2019-10-03 02:50:41,133 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:50:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8412 states. [2019-10-03 02:50:41,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8412 to 8390. [2019-10-03 02:50:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8390 states. [2019-10-03 02:50:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 11592 transitions. [2019-10-03 02:50:41,539 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 11592 transitions. Word has length 204 [2019-10-03 02:50:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:41,540 INFO L475 AbstractCegarLoop]: Abstraction has 8390 states and 11592 transitions. [2019-10-03 02:50:41,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:50:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 11592 transitions. [2019-10-03 02:50:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:50:41,554 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:41,554 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:41,555 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1402076048, now seen corresponding path program 1 times [2019-10-03 02:50:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:41,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:41,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:41,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:42,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:42,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:50:42,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:42,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:50:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:50:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:50:42,062 INFO L87 Difference]: Start difference. First operand 8390 states and 11592 transitions. Second operand 26 states. [2019-10-03 02:50:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:42,917 INFO L93 Difference]: Finished difference Result 9476 states and 13227 transitions. [2019-10-03 02:50:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:50:42,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 205 [2019-10-03 02:50:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:42,978 INFO L225 Difference]: With dead ends: 9476 [2019-10-03 02:50:42,979 INFO L226 Difference]: Without dead ends: 8912 [2019-10-03 02:50:42,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:50:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8912 states. [2019-10-03 02:50:43,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8912 to 8689. [2019-10-03 02:50:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8689 states. [2019-10-03 02:50:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8689 states to 8689 states and 11985 transitions. [2019-10-03 02:50:43,363 INFO L78 Accepts]: Start accepts. Automaton has 8689 states and 11985 transitions. Word has length 205 [2019-10-03 02:50:43,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:43,363 INFO L475 AbstractCegarLoop]: Abstraction has 8689 states and 11985 transitions. [2019-10-03 02:50:43,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:50:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8689 states and 11985 transitions. [2019-10-03 02:50:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 02:50:43,375 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:43,375 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:43,376 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1653752068, now seen corresponding path program 1 times [2019-10-03 02:50:43,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:43,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:43,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:43,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:43,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:43,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:50:43,598 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:43,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:50:43,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:50:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:43,600 INFO L87 Difference]: Start difference. First operand 8689 states and 11985 transitions. Second operand 10 states. [2019-10-03 02:50:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:43,696 INFO L93 Difference]: Finished difference Result 8751 states and 12064 transitions. [2019-10-03 02:50:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:50:43,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 209 [2019-10-03 02:50:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:43,748 INFO L225 Difference]: With dead ends: 8751 [2019-10-03 02:50:43,748 INFO L226 Difference]: Without dead ends: 8720 [2019-10-03 02:50:43,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:50:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8720 states. [2019-10-03 02:50:43,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8720 to 8716. [2019-10-03 02:50:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8716 states. [2019-10-03 02:50:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8716 states to 8716 states and 11977 transitions. [2019-10-03 02:50:44,002 INFO L78 Accepts]: Start accepts. Automaton has 8716 states and 11977 transitions. Word has length 209 [2019-10-03 02:50:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:44,003 INFO L475 AbstractCegarLoop]: Abstraction has 8716 states and 11977 transitions. [2019-10-03 02:50:44,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:50:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8716 states and 11977 transitions. [2019-10-03 02:50:44,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:50:44,016 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:44,016 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:44,016 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1874145188, now seen corresponding path program 1 times [2019-10-03 02:50:44,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:44,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:44,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:44,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:44,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:44,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:44,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:44,175 INFO L87 Difference]: Start difference. First operand 8716 states and 11977 transitions. Second operand 5 states. [2019-10-03 02:50:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:44,258 INFO L93 Difference]: Finished difference Result 8959 states and 12295 transitions. [2019-10-03 02:50:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:44,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 214 [2019-10-03 02:50:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:44,290 INFO L225 Difference]: With dead ends: 8959 [2019-10-03 02:50:44,290 INFO L226 Difference]: Without dead ends: 8959 [2019-10-03 02:50:44,290 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8959 states. [2019-10-03 02:50:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8959 to 8848. [2019-10-03 02:50:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8848 states. [2019-10-03 02:50:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8848 states to 8848 states and 12124 transitions. [2019-10-03 02:50:44,529 INFO L78 Accepts]: Start accepts. Automaton has 8848 states and 12124 transitions. Word has length 214 [2019-10-03 02:50:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:44,529 INFO L475 AbstractCegarLoop]: Abstraction has 8848 states and 12124 transitions. [2019-10-03 02:50:44,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:44,530 INFO L276 IsEmpty]: Start isEmpty. Operand 8848 states and 12124 transitions. [2019-10-03 02:50:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-03 02:50:44,544 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:44,544 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:44,545 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:44,545 INFO L82 PathProgramCache]: Analyzing trace with hash -604466908, now seen corresponding path program 1 times [2019-10-03 02:50:44,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:44,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:45,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:45,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-03 02:50:45,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:45,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-03 02:50:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-03 02:50:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:45,325 INFO L87 Difference]: Start difference. First operand 8848 states and 12124 transitions. Second operand 9 states. [2019-10-03 02:50:45,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:45,591 INFO L93 Difference]: Finished difference Result 8880 states and 12113 transitions. [2019-10-03 02:50:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:50:45,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 214 [2019-10-03 02:50:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:45,630 INFO L225 Difference]: With dead ends: 8880 [2019-10-03 02:50:45,630 INFO L226 Difference]: Without dead ends: 8880 [2019-10-03 02:50:45,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:50:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8880 states. [2019-10-03 02:50:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8880 to 8814. [2019-10-03 02:50:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8814 states. [2019-10-03 02:50:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8814 states to 8814 states and 12040 transitions. [2019-10-03 02:50:45,930 INFO L78 Accepts]: Start accepts. Automaton has 8814 states and 12040 transitions. Word has length 214 [2019-10-03 02:50:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:45,931 INFO L475 AbstractCegarLoop]: Abstraction has 8814 states and 12040 transitions. [2019-10-03 02:50:45,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-03 02:50:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8814 states and 12040 transitions. [2019-10-03 02:50:45,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-03 02:50:45,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:45,943 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:45,943 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:45,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1807092818, now seen corresponding path program 1 times [2019-10-03 02:50:45,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:45,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:45,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:45,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:45,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:45,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:46,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:46,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:50:46,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:46,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:50:46,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:50:46,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:50:46,085 INFO L87 Difference]: Start difference. First operand 8814 states and 12040 transitions. Second operand 5 states. [2019-10-03 02:50:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:46,154 INFO L93 Difference]: Finished difference Result 7143 states and 9759 transitions. [2019-10-03 02:50:46,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:50:46,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2019-10-03 02:50:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:46,179 INFO L225 Difference]: With dead ends: 7143 [2019-10-03 02:50:46,179 INFO L226 Difference]: Without dead ends: 7140 [2019-10-03 02:50:46,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7140 states. [2019-10-03 02:50:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7140 to 7124. [2019-10-03 02:50:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7124 states. [2019-10-03 02:50:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7124 states to 7124 states and 9734 transitions. [2019-10-03 02:50:46,371 INFO L78 Accepts]: Start accepts. Automaton has 7124 states and 9734 transitions. Word has length 216 [2019-10-03 02:50:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:46,372 INFO L475 AbstractCegarLoop]: Abstraction has 7124 states and 9734 transitions. [2019-10-03 02:50:46,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:50:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7124 states and 9734 transitions. [2019-10-03 02:50:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-03 02:50:46,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:46,383 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:46,383 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:46,383 INFO L82 PathProgramCache]: Analyzing trace with hash -990686485, now seen corresponding path program 1 times [2019-10-03 02:50:46,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:46,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:46,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:46,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 02:50:46,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:46,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:50:46,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:46,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:50:46,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:50:46,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:50:46,610 INFO L87 Difference]: Start difference. First operand 7124 states and 9734 transitions. Second operand 6 states. [2019-10-03 02:50:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:47,130 INFO L93 Difference]: Finished difference Result 14285 states and 19554 transitions. [2019-10-03 02:50:47,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:50:47,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-10-03 02:50:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:47,176 INFO L225 Difference]: With dead ends: 14285 [2019-10-03 02:50:47,176 INFO L226 Difference]: Without dead ends: 14285 [2019-10-03 02:50:47,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:50:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14285 states. [2019-10-03 02:50:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14285 to 14103. [2019-10-03 02:50:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14103 states. [2019-10-03 02:50:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14103 states to 14103 states and 19343 transitions. [2019-10-03 02:50:47,528 INFO L78 Accepts]: Start accepts. Automaton has 14103 states and 19343 transitions. Word has length 215 [2019-10-03 02:50:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:47,529 INFO L475 AbstractCegarLoop]: Abstraction has 14103 states and 19343 transitions. [2019-10-03 02:50:47,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:50:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14103 states and 19343 transitions. [2019-10-03 02:50:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-03 02:50:47,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:47,552 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:47,552 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:47,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1955015576, now seen corresponding path program 1 times [2019-10-03 02:50:47,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:47,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:47,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:47,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:47,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:47,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:50:47,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:47,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:50:47,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:50:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:47,702 INFO L87 Difference]: Start difference. First operand 14103 states and 19343 transitions. Second operand 3 states. [2019-10-03 02:50:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:47,766 INFO L93 Difference]: Finished difference Result 15045 states and 21149 transitions. [2019-10-03 02:50:47,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:50:47,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-10-03 02:50:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:47,817 INFO L225 Difference]: With dead ends: 15045 [2019-10-03 02:50:47,817 INFO L226 Difference]: Without dead ends: 15045 [2019-10-03 02:50:47,817 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:50:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15045 states. [2019-10-03 02:50:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15045 to 15039. [2019-10-03 02:50:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15039 states. [2019-10-03 02:50:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15039 states to 15039 states and 21143 transitions. [2019-10-03 02:50:48,423 INFO L78 Accepts]: Start accepts. Automaton has 15039 states and 21143 transitions. Word has length 250 [2019-10-03 02:50:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:48,424 INFO L475 AbstractCegarLoop]: Abstraction has 15039 states and 21143 transitions. [2019-10-03 02:50:48,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:50:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 15039 states and 21143 transitions. [2019-10-03 02:50:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-03 02:50:48,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:48,452 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:48,452 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1044967040, now seen corresponding path program 1 times [2019-10-03 02:50:48,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:48,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:48,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:50:48,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:48,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:50:48,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:48,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:50:48,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:50:48,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:50:48,652 INFO L87 Difference]: Start difference. First operand 15039 states and 21143 transitions. Second operand 8 states. [2019-10-03 02:50:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:53,259 INFO L93 Difference]: Finished difference Result 30757 states and 45411 transitions. [2019-10-03 02:50:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:50:53,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 251 [2019-10-03 02:50:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:53,376 INFO L225 Difference]: With dead ends: 30757 [2019-10-03 02:50:53,376 INFO L226 Difference]: Without dead ends: 30757 [2019-10-03 02:50:53,377 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:50:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30757 states. [2019-10-03 02:50:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30757 to 25811. [2019-10-03 02:50:54,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25811 states. [2019-10-03 02:50:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25811 states to 25811 states and 38215 transitions. [2019-10-03 02:50:54,235 INFO L78 Accepts]: Start accepts. Automaton has 25811 states and 38215 transitions. Word has length 251 [2019-10-03 02:50:54,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:50:54,235 INFO L475 AbstractCegarLoop]: Abstraction has 25811 states and 38215 transitions. [2019-10-03 02:50:54,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:50:54,235 INFO L276 IsEmpty]: Start isEmpty. Operand 25811 states and 38215 transitions. [2019-10-03 02:50:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 02:50:54,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:50:54,266 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:50:54,266 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:50:54,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:50:54,266 INFO L82 PathProgramCache]: Analyzing trace with hash -65003728, now seen corresponding path program 1 times [2019-10-03 02:50:54,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:50:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:54,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:50:54,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:50:54,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:50:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:50:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:50:54,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:50:54,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:50:54,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:50:54,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:50:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:50:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:50:54,445 INFO L87 Difference]: Start difference. First operand 25811 states and 38215 transitions. Second operand 8 states. [2019-10-03 02:50:58,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:50:58,651 INFO L93 Difference]: Finished difference Result 53105 states and 82921 transitions. [2019-10-03 02:50:58,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:50:58,652 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 237 [2019-10-03 02:50:58,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:50:58,838 INFO L225 Difference]: With dead ends: 53105 [2019-10-03 02:50:58,839 INFO L226 Difference]: Without dead ends: 53105 [2019-10-03 02:50:58,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:50:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53105 states. [2019-10-03 02:51:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53105 to 46746. [2019-10-03 02:51:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46746 states. [2019-10-03 02:51:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46746 states to 46746 states and 72921 transitions. [2019-10-03 02:51:00,985 INFO L78 Accepts]: Start accepts. Automaton has 46746 states and 72921 transitions. Word has length 237 [2019-10-03 02:51:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:00,986 INFO L475 AbstractCegarLoop]: Abstraction has 46746 states and 72921 transitions. [2019-10-03 02:51:00,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 46746 states and 72921 transitions. [2019-10-03 02:51:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 02:51:01,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:01,065 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:01,065 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:01,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1445472836, now seen corresponding path program 1 times [2019-10-03 02:51:01,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:01,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:01,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:01,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:01,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 02:51:01,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:51:01,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:51:01,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:01,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:51:01,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:51:01,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:51:01,257 INFO L87 Difference]: Start difference. First operand 46746 states and 72921 transitions. Second operand 8 states. [2019-10-03 02:51:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:06,652 INFO L93 Difference]: Finished difference Result 96451 states and 158999 transitions. [2019-10-03 02:51:06,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:51:06,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 238 [2019-10-03 02:51:06,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:07,122 INFO L225 Difference]: With dead ends: 96451 [2019-10-03 02:51:07,123 INFO L226 Difference]: Without dead ends: 96451 [2019-10-03 02:51:07,124 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:51:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96451 states. [2019-10-03 02:51:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96451 to 87506. [2019-10-03 02:51:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87506 states. [2019-10-03 02:51:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87506 states to 87506 states and 143560 transitions. [2019-10-03 02:51:11,958 INFO L78 Accepts]: Start accepts. Automaton has 87506 states and 143560 transitions. Word has length 238 [2019-10-03 02:51:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:11,958 INFO L475 AbstractCegarLoop]: Abstraction has 87506 states and 143560 transitions. [2019-10-03 02:51:11,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:51:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 87506 states and 143560 transitions. [2019-10-03 02:51:12,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:51:12,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:51:12,076 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:51:12,077 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:51:12,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1829481210, now seen corresponding path program 1 times [2019-10-03 02:51:12,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:51:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:51:12,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:51:12,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:51:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:51:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:51:12,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:51:12,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:51:12,258 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 235 with the following transitions: [2019-10-03 02:51:12,260 INFO L207 CegarAbsIntRunner]: [44], [72], [75], [85], [123], [139], [142], [151], [152], [155], [156], [157], [159], [241], [244], [250], [269], [271], [275], [278], [279], [280], [283], [289], [313], [315], [316], [319], [328], [339], [341], [344], [348], [349], [351], [352], [355], [365], [366], [367], [368], [370], [375], [406], [407], [410], [419], [595], [597], [598], [599], [637], [640], [654], [683], [685], [688], [689], [700], [703], [709], [733], [737], [740], [748], [751], [762], [784], [786], [789], [791], [794], [796], [798], [801], [817], [826], [830], [832], [834], [837], [844], [851], [854], [856], [992], [995], [1009], [1117], [1171], [1173], [1175], [1182], [1204], [1215], [1218], [1221], [1227], [1230], [1231], [1234], [1238], [1242], [1268], [1269], [1271], [1340], [1343], [1349], [1350], [1353], [1363], [1384], [1387], [1401], [1409], [1412], [1421], [1610], [1612], [1614], [1616], [1617], [1629], [1647], [1657], [1658], [1659], [1660], [1661], [1662], [1665], [1666], [1667], [1668], [1669], [1671], [1672], [1673], [1674], [1681], [1682], [1687], [1688], [1691], [1692], [1693], [1694], [1695], [1701], [1702], [1723], [1724], [1739], [1740], [1741], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1753], [1754], [1755], [1756], [1765], [1773], [1774], [1775], [1776], [1777], [1778], [1779], [1780], [1781], [1782], [1783], [1784], [1785], [1791], [1792], [1809], [1811], [1812], [1813], [1814], [1819], [1821], [1822], [1823], [1824], [1825], [1827], [1828], [1829], [1830], [1831], [1832], [1833], [1847], [1848], [1849], [1850], [1851], [1852], [1853], [1854], [1855] [2019-10-03 02:51:12,307 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:51:12,307 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:51:12,443 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:51:12,445 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 185 root evaluator evaluations with a maximum evaluation depth of 0. Performed 185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 364 variables. [2019-10-03 02:51:12,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:51:12,449 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:51:12,548 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:51:12,548 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:51:12,554 INFO L420 sIntCurrentIteration]: We unified 233 AI predicates to 233 [2019-10-03 02:51:12,554 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:51:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:51:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:51:12,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:51:12,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:51:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:51:12,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:12,557 INFO L87 Difference]: Start difference. First operand 87506 states and 143560 transitions. Second operand 2 states. [2019-10-03 02:51:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:51:12,557 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:51:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:51:12,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 234 [2019-10-03 02:51:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:51:12,558 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:51:12,558 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:51:12,559 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:51:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:51:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:51:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:51:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:51:12,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2019-10-03 02:51:12,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:51:12,560 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:51:12,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:51:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:51:12,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:51:12,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:51:12 BoogieIcfgContainer [2019-10-03 02:51:12,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:51:12,568 INFO L168 Benchmark]: Toolchain (without parser) took 49648.18 ms. Allocated memory was 138.9 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 84.0 MB in the beginning and 980.9 MB in the end (delta: -896.9 MB). Peak memory consumption was 758.3 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:12,570 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:51:12,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1207.83 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 83.6 MB in the beginning and 130.3 MB in the end (delta: -46.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:12,571 INFO L168 Benchmark]: Boogie Preprocessor took 198.06 ms. Allocated memory is still 199.8 MB. Free memory was 130.3 MB in the beginning and 121.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:12,574 INFO L168 Benchmark]: RCFGBuilder took 2012.31 ms. Allocated memory was 199.8 MB in the beginning and 269.0 MB in the end (delta: 69.2 MB). Free memory was 121.6 MB in the beginning and 171.6 MB in the end (delta: -50.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:12,575 INFO L168 Benchmark]: TraceAbstraction took 46225.82 ms. Allocated memory was 269.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 171.6 MB in the beginning and 980.9 MB in the end (delta: -809.2 MB). Peak memory consumption was 715.9 MB. Max. memory is 7.1 GB. [2019-10-03 02:51:12,582 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.20 ms. Allocated memory is still 138.9 MB. Free memory was 105.0 MB in the beginning and 104.8 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1207.83 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 83.6 MB in the beginning and 130.3 MB in the end (delta: -46.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.06 ms. Allocated memory is still 199.8 MB. Free memory was 130.3 MB in the beginning and 121.6 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2012.31 ms. Allocated memory was 199.8 MB in the beginning and 269.0 MB in the end (delta: 69.2 MB). Free memory was 121.6 MB in the beginning and 171.6 MB in the end (delta: -50.1 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46225.82 ms. Allocated memory was 269.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 171.6 MB in the beginning and 980.9 MB in the end (delta: -809.2 MB). Peak memory consumption was 715.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1817]: 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 112 procedures, 757 locations, 1 error locations. SAFE Result, 46.1s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 28.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14331 SDtfs, 10525 SDslu, 73922 SDs, 0 SdLazy, 20308 SolverSat, 2605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87506occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.0214592274678114 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 11.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 21014 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 4274 NumberOfCodeBlocks, 4274 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 4254 ConstructedInterpolants, 0 QuantifiedInterpolants, 1197542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 694/696 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...