java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec7_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:54:48,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:54:48,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:54:48,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:54:48,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:54:48,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:54:48,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:54:48,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:54:48,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:54:48,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:54:48,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:54:48,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:54:48,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:54:48,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:54:48,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:54:48,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:54:48,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:54:48,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:54:48,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:54:48,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:54:48,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:54:48,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:54:48,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:54:48,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:54:48,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:54:48,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:54:48,835 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:54:48,836 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:54:48,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:54:48,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:54:48,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:54:48,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:54:48,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:54:48,840 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:54:48,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:54:48,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:54:48,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:54:48,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:54:48,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:54:48,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:54:48,845 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:54:48,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 02:54:48,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:54:48,861 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:54:48,862 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:54:48,862 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:54:48,862 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:54:48,863 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:54:48,863 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:54:48,863 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:54:48,863 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:54:48,864 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:54:48,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:54:48,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:54:48,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:54:48,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:54:48,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:54:48,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:54:48,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:54:48,866 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:54:48,866 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:54:48,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:54:48,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:54:48,866 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:54:48,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:54:48,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:48,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:54:48,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:54:48,867 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:54:48,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:54:48,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:54:48,868 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:54:48,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:54:48,908 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:54:48,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:54:48,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:54:48,913 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:54:48,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product33.cil.c [2019-10-03 02:54:48,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0249a33/0dc728e4509242adb79ce1018b33e436/FLAGcfa47625e [2019-10-03 02:54:49,565 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:54:49,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product33.cil.c [2019-10-03 02:54:49,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0249a33/0dc728e4509242adb79ce1018b33e436/FLAGcfa47625e [2019-10-03 02:54:49,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0249a33/0dc728e4509242adb79ce1018b33e436 [2019-10-03 02:54:49,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:54:49,850 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:54:49,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:49,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:54:49,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:54:49,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:49" (1/1) ... [2019-10-03 02:54:49,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2feeb304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:49, skipping insertion in model container [2019-10-03 02:54:49,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:54:49" (1/1) ... [2019-10-03 02:54:49,868 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:54:49,933 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:54:50,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:50,695 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:54:50,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:54:50,951 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:54:50,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50 WrapperNode [2019-10-03 02:54:50,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:54:50,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:54:50,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:54:50,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:54:50,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:50,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:51,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:51,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:51,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:51,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:51,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... [2019-10-03 02:54:51,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:54:51,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:54:51,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:54:51,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:54:51,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:54:51,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:54:51,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:54:51,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:51,337 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-03 02:54:51,337 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-03 02:54:51,337 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-03 02:54:51,337 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-03 02:54:51,338 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-03 02:54:51,338 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-03 02:54:51,338 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-03 02:54:51,339 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-03 02:54:51,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:51,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:51,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:51,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-03 02:54:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-03 02:54:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-03 02:54:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:54:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-03 02:54:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-03 02:54:51,342 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-03 02:54:51,343 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:51,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-03 02:54:51,344 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-03 02:54:51,344 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-03 02:54:51,345 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-03 02:54:51,345 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:54:51,346 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-03 02:54:51,346 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-03 02:54:51,346 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-03 02:54:51,347 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-03 02:54:51,347 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-03 02:54:51,347 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-03 02:54:51,347 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-03 02:54:51,347 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-03 02:54:51,347 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-03 02:54:51,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-03 02:54:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-03 02:54:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-03 02:54:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-03 02:54:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-03 02:54:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-03 02:54:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-03 02:54:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-03 02:54:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-03 02:54:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-03 02:54:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-03 02:54:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-03 02:54:51,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-03 02:54:51,352 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-03 02:54:51,352 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-03 02:54:51,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-03 02:54:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-03 02:54:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-03 02:54:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-03 02:54:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-03 02:54:51,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-03 02:54:51,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-03 02:54:51,354 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-03 02:54:51,354 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-03 02:54:51,355 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-03 02:54:51,355 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-03 02:54:51,355 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-03 02:54:51,355 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:54:51,355 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-03 02:54:51,356 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-03 02:54:51,356 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-03 02:54:51,356 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-03 02:54:51,357 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-03 02:54:51,357 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-03 02:54:51,357 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-03 02:54:51,357 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-03 02:54:51,358 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-03 02:54:51,359 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-03 02:54:51,359 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-03 02:54:51,359 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-03 02:54:51,359 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-03 02:54:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-03 02:54:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-03 02:54:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-03 02:54:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-03 02:54:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-03 02:54:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-03 02:54:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-03 02:54:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-03 02:54:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-03 02:54:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-03 02:54:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-03 02:54:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-03 02:54:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-03 02:54:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-03 02:54:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-03 02:54:51,362 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-03 02:54:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-03 02:54:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-03 02:54:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-03 02:54:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-03 02:54:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-03 02:54:51,363 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-03 02:54:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-03 02:54:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-03 02:54:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-03 02:54:51,364 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-03 02:54:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-03 02:54:51,365 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-03 02:54:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:54:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 02:54:51,366 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-03 02:54:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-03 02:54:51,367 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-03 02:54:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-03 02:54:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-03 02:54:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-03 02:54:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-03 02:54:51,368 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-03 02:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-03 02:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-03 02:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-03 02:54:51,369 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-03 02:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-03 02:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-03 02:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-03 02:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-03 02:54:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 02:54:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-03 02:54:51,371 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-03 02:54:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-03 02:54:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-03 02:54:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 02:54:51,375 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 02:54:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-03 02:54:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 02:54:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 02:54:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 02:54:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 02:54:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-03 02:54:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 02:54:51,383 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-03 02:54:51,384 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-03 02:54:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 02:54:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-03 02:54:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-03 02:54:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-03 02:54:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-03 02:54:51,385 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-03 02:54:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-03 02:54:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-03 02:54:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-03 02:54:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-03 02:54:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-03 02:54:51,386 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-03 02:54:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-03 02:54:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-03 02:54:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-03 02:54:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-03 02:54:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-03 02:54:51,387 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-03 02:54:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-03 02:54:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-03 02:54:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-03 02:54:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-03 02:54:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-03 02:54:51,388 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-03 02:54:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-03 02:54:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-03 02:54:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-03 02:54:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-03 02:54:51,389 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-03 02:54:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-03 02:54:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-03 02:54:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-03 02:54:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:54:51,390 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-03 02:54:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-03 02:54:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-03 02:54:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-03 02:54:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-03 02:54:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-03 02:54:51,391 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-03 02:54:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-03 02:54:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-03 02:54:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-03 02:54:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-03 02:54:51,392 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-03 02:54:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-03 02:54:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-03 02:54:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-03 02:54:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-03 02:54:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-03 02:54:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-03 02:54:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-03 02:54:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-03 02:54:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-03 02:54:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-03 02:54:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-03 02:54:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-03 02:54:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-03 02:54:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-03 02:54:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-03 02:54:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-03 02:54:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-03 02:54:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-03 02:54:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-03 02:54:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-03 02:54:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-03 02:54:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-03 02:54:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-03 02:54:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-03 02:54:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-03 02:54:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-03 02:54:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-03 02:54:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-03 02:54:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-03 02:54:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-03 02:54:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-03 02:54:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-03 02:54:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-03 02:54:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-03 02:54:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-03 02:54:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-03 02:54:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-03 02:54:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-03 02:54:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-03 02:54:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-03 02:54:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-03 02:54:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-03 02:54:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-03 02:54:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-03 02:54:51,400 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-03 02:54:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-03 02:54:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-03 02:54:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-03 02:54:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-03 02:54:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-03 02:54:51,401 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-03 02:54:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:54:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 02:54:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:54:53,788 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:54:53,789 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-03 02:54:53,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:53 BoogieIcfgContainer [2019-10-03 02:54:53,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:54:53,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:54:53,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:54:53,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:54:53,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:54:49" (1/3) ... [2019-10-03 02:54:53,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6ae9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:53, skipping insertion in model container [2019-10-03 02:54:53,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:54:50" (2/3) ... [2019-10-03 02:54:53,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6ae9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:54:53, skipping insertion in model container [2019-10-03 02:54:53,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:54:53" (3/3) ... [2019-10-03 02:54:53,804 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product33.cil.c [2019-10-03 02:54:53,815 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:54:53,835 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:54:53,861 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:54:53,896 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:54:53,896 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:54:53,896 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:54:53,897 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:54:53,900 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:54:53,900 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:54:53,900 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:54:53,900 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:54:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states. [2019-10-03 02:54:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-03 02:54:53,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:53,974 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:53,977 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:53,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1628617347, now seen corresponding path program 1 times [2019-10-03 02:54:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:54,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:54,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:54,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:54,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:54:54,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:54,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:54:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:54:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:54,664 INFO L87 Difference]: Start difference. First operand 586 states. Second operand 2 states. [2019-10-03 02:54:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:54,721 INFO L93 Difference]: Finished difference Result 572 states and 754 transitions. [2019-10-03 02:54:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:54:54,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2019-10-03 02:54:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:54,748 INFO L225 Difference]: With dead ends: 572 [2019-10-03 02:54:54,748 INFO L226 Difference]: Without dead ends: 563 [2019-10-03 02:54:54,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:54:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-10-03 02:54:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2019-10-03 02:54:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-10-03 02:54:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 743 transitions. [2019-10-03 02:54:54,860 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 743 transitions. Word has length 182 [2019-10-03 02:54:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:54,863 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 743 transitions. [2019-10-03 02:54:54,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:54:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 743 transitions. [2019-10-03 02:54:54,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-03 02:54:54,870 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:54,870 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:54,871 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash -994536202, now seen corresponding path program 1 times [2019-10-03 02:54:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:54,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:54,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:54,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,110 INFO L87 Difference]: Start difference. First operand 563 states and 743 transitions. Second operand 3 states. [2019-10-03 02:54:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,186 INFO L93 Difference]: Finished difference Result 566 states and 746 transitions. [2019-10-03 02:54:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:55,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-03 02:54:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,201 INFO L225 Difference]: With dead ends: 566 [2019-10-03 02:54:55,201 INFO L226 Difference]: Without dead ends: 566 [2019-10-03 02:54:55,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-10-03 02:54:55,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2019-10-03 02:54:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-10-03 02:54:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 745 transitions. [2019-10-03 02:54:55,263 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 745 transitions. Word has length 183 [2019-10-03 02:54:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:55,264 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 745 transitions. [2019-10-03 02:54:55,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 745 transitions. [2019-10-03 02:54:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 02:54:55,275 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:55,276 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] [2019-10-03 02:54:55,276 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1125503284, now seen corresponding path program 1 times [2019-10-03 02:54:55,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:55,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:55,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,500 INFO L87 Difference]: Start difference. First operand 565 states and 745 transitions. Second operand 3 states. [2019-10-03 02:54:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,534 INFO L93 Difference]: Finished difference Result 608 states and 818 transitions. [2019-10-03 02:54:55,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:55,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-03 02:54:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,540 INFO L225 Difference]: With dead ends: 608 [2019-10-03 02:54:55,541 INFO L226 Difference]: Without dead ends: 608 [2019-10-03 02:54:55,541 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-03 02:54:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 607. [2019-10-03 02:54:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-03 02:54:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 817 transitions. [2019-10-03 02:54:55,592 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 817 transitions. Word has length 195 [2019-10-03 02:54:55,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:55,593 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 817 transitions. [2019-10-03 02:54:55,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 817 transitions. [2019-10-03 02:54:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 02:54:55,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:55,604 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:54:55,604 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:55,605 INFO L82 PathProgramCache]: Analyzing trace with hash -287022915, now seen corresponding path program 1 times [2019-10-03 02:54:55,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:55,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:55,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:55,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:54:55,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:55,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:54:55,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:55,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:54:55,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:54:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,931 INFO L87 Difference]: Start difference. First operand 607 states and 817 transitions. Second operand 3 states. [2019-10-03 02:54:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:54:55,964 INFO L93 Difference]: Finished difference Result 689 states and 956 transitions. [2019-10-03 02:54:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:54:55,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-03 02:54:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:54:55,971 INFO L225 Difference]: With dead ends: 689 [2019-10-03 02:54:55,972 INFO L226 Difference]: Without dead ends: 689 [2019-10-03 02:54:55,972 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:54:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-10-03 02:54:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 688. [2019-10-03 02:54:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-10-03 02:54:56,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 955 transitions. [2019-10-03 02:54:56,006 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 955 transitions. Word has length 196 [2019-10-03 02:54:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:54:56,007 INFO L475 AbstractCegarLoop]: Abstraction has 688 states and 955 transitions. [2019-10-03 02:54:56,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:54:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 955 transitions. [2019-10-03 02:54:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 02:54:56,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:54:56,014 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] [2019-10-03 02:54:56,014 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:54:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:54:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2143849423, now seen corresponding path program 1 times [2019-10-03 02:54:56,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:54:56,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:56,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:54:56,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:54:56,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:54:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:54:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:54:56,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:54:56,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-03 02:54:56,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:54:56,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-03 02:54:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-03 02:54:56,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:54:56,671 INFO L87 Difference]: Start difference. First operand 688 states and 955 transitions. Second operand 19 states. [2019-10-03 02:55:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:02,668 INFO L93 Difference]: Finished difference Result 2023 states and 2814 transitions. [2019-10-03 02:55:02,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-03 02:55:02,669 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 199 [2019-10-03 02:55:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:02,691 INFO L225 Difference]: With dead ends: 2023 [2019-10-03 02:55:02,691 INFO L226 Difference]: Without dead ends: 2023 [2019-10-03 02:55:02,693 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-03 02:55:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-10-03 02:55:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1986. [2019-10-03 02:55:02,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1986 states. [2019-10-03 02:55:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2762 transitions. [2019-10-03 02:55:02,782 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2762 transitions. Word has length 199 [2019-10-03 02:55:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:02,785 INFO L475 AbstractCegarLoop]: Abstraction has 1986 states and 2762 transitions. [2019-10-03 02:55:02,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-03 02:55:02,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2762 transitions. [2019-10-03 02:55:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:55:02,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:02,792 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:02,793 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1573247763, now seen corresponding path program 1 times [2019-10-03 02:55:02,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:02,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:02,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:02,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:02,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:55:03,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:03,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:55:03,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:03,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:55:03,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:55:03,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:55:03,172 INFO L87 Difference]: Start difference. First operand 1986 states and 2762 transitions. Second operand 15 states. [2019-10-03 02:55:07,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:07,547 INFO L93 Difference]: Finished difference Result 2088 states and 2915 transitions. [2019-10-03 02:55:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-03 02:55:07,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 200 [2019-10-03 02:55:07,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:07,560 INFO L225 Difference]: With dead ends: 2088 [2019-10-03 02:55:07,560 INFO L226 Difference]: Without dead ends: 2088 [2019-10-03 02:55:07,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-03 02:55:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2019-10-03 02:55:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2056. [2019-10-03 02:55:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-03 02:55:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2876 transitions. [2019-10-03 02:55:07,636 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2876 transitions. Word has length 200 [2019-10-03 02:55:07,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:07,637 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2876 transitions. [2019-10-03 02:55:07,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:55:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2876 transitions. [2019-10-03 02:55:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 02:55:07,644 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:07,645 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:07,645 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash -374646510, now seen corresponding path program 1 times [2019-10-03 02:55:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:07,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:07,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:07,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:07,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:55:07,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:07,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:07,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:07,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:07,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:07,859 INFO L87 Difference]: Start difference. First operand 2056 states and 2876 transitions. Second operand 5 states. [2019-10-03 02:55:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:07,932 INFO L93 Difference]: Finished difference Result 1704 states and 2400 transitions. [2019-10-03 02:55:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:07,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-03 02:55:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:07,943 INFO L225 Difference]: With dead ends: 1704 [2019-10-03 02:55:07,944 INFO L226 Difference]: Without dead ends: 1699 [2019-10-03 02:55:07,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2019-10-03 02:55:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2019-10-03 02:55:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-10-03 02:55:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2390 transitions. [2019-10-03 02:55:08,043 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2390 transitions. Word has length 203 [2019-10-03 02:55:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:08,044 INFO L475 AbstractCegarLoop]: Abstraction has 1699 states and 2390 transitions. [2019-10-03 02:55:08,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2390 transitions. [2019-10-03 02:55:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:55:08,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:08,051 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:08,052 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:08,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:08,052 INFO L82 PathProgramCache]: Analyzing trace with hash -673245661, now seen corresponding path program 1 times [2019-10-03 02:55:08,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:08,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:08,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:08,480 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 02:55:08,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:08,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-03 02:55:08,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:08,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:55:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:55:08,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:55:08,483 INFO L87 Difference]: Start difference. First operand 1699 states and 2390 transitions. Second operand 16 states. [2019-10-03 02:55:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:08,832 INFO L93 Difference]: Finished difference Result 1783 states and 2503 transitions. [2019-10-03 02:55:08,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-03 02:55:08,833 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 200 [2019-10-03 02:55:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:08,845 INFO L225 Difference]: With dead ends: 1783 [2019-10-03 02:55:08,846 INFO L226 Difference]: Without dead ends: 1751 [2019-10-03 02:55:08,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-03 02:55:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-10-03 02:55:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1733. [2019-10-03 02:55:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-10-03 02:55:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2434 transitions. [2019-10-03 02:55:08,913 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2434 transitions. Word has length 200 [2019-10-03 02:55:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:08,913 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2434 transitions. [2019-10-03 02:55:08,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:55:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2434 transitions. [2019-10-03 02:55:08,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:55:08,921 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:08,921 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] [2019-10-03 02:55:08,921 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash 307966101, now seen corresponding path program 1 times [2019-10-03 02:55:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:08,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:08,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:08,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:09,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:09,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:09,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:09,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:09,155 INFO L87 Difference]: Start difference. First operand 1733 states and 2434 transitions. Second operand 5 states. [2019-10-03 02:55:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:10,299 INFO L93 Difference]: Finished difference Result 3766 states and 5248 transitions. [2019-10-03 02:55:10,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:55:10,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 200 [2019-10-03 02:55:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:10,322 INFO L225 Difference]: With dead ends: 3766 [2019-10-03 02:55:10,322 INFO L226 Difference]: Without dead ends: 3755 [2019-10-03 02:55:10,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3755 states. [2019-10-03 02:55:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3755 to 3724. [2019-10-03 02:55:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2019-10-03 02:55:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 5177 transitions. [2019-10-03 02:55:10,461 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 5177 transitions. Word has length 200 [2019-10-03 02:55:10,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:10,461 INFO L475 AbstractCegarLoop]: Abstraction has 3724 states and 5177 transitions. [2019-10-03 02:55:10,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:10,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 5177 transitions. [2019-10-03 02:55:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-03 02:55:10,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:10,471 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] [2019-10-03 02:55:10,472 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:10,472 INFO L82 PathProgramCache]: Analyzing trace with hash 328303476, now seen corresponding path program 1 times [2019-10-03 02:55:10,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:10,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:10,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:10,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:10,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:10,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:55:10,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:10,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:55:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:55:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:55:10,805 INFO L87 Difference]: Start difference. First operand 3724 states and 5177 transitions. Second operand 7 states. [2019-10-03 02:55:13,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:13,061 INFO L93 Difference]: Finished difference Result 9092 states and 12616 transitions. [2019-10-03 02:55:13,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:55:13,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-03 02:55:13,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:13,121 INFO L225 Difference]: With dead ends: 9092 [2019-10-03 02:55:13,121 INFO L226 Difference]: Without dead ends: 9092 [2019-10-03 02:55:13,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:55:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9092 states. [2019-10-03 02:55:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9092 to 9070. [2019-10-03 02:55:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-10-03 02:55:13,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 12558 transitions. [2019-10-03 02:55:13,468 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 12558 transitions. Word has length 200 [2019-10-03 02:55:13,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:13,469 INFO L475 AbstractCegarLoop]: Abstraction has 9070 states and 12558 transitions. [2019-10-03 02:55:13,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:55:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 12558 transitions. [2019-10-03 02:55:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 02:55:13,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:13,479 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] [2019-10-03 02:55:13,479 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:13,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:13,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1465027948, now seen corresponding path program 1 times [2019-10-03 02:55:13,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:13,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:13,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:13,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:14,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:14,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-03 02:55:14,019 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:14,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-03 02:55:14,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-03 02:55:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-03 02:55:14,021 INFO L87 Difference]: Start difference. First operand 9070 states and 12558 transitions. Second operand 26 states. [2019-10-03 02:55:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:14,989 INFO L93 Difference]: Finished difference Result 9356 states and 13087 transitions. [2019-10-03 02:55:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-03 02:55:14,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 201 [2019-10-03 02:55:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:15,030 INFO L225 Difference]: With dead ends: 9356 [2019-10-03 02:55:15,030 INFO L226 Difference]: Without dead ends: 7689 [2019-10-03 02:55:15,031 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:55:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7689 states. [2019-10-03 02:55:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7689 to 7556. [2019-10-03 02:55:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7556 states. [2019-10-03 02:55:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7556 states to 7556 states and 10417 transitions. [2019-10-03 02:55:15,293 INFO L78 Accepts]: Start accepts. Automaton has 7556 states and 10417 transitions. Word has length 201 [2019-10-03 02:55:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:15,293 INFO L475 AbstractCegarLoop]: Abstraction has 7556 states and 10417 transitions. [2019-10-03 02:55:15,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-03 02:55:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 7556 states and 10417 transitions. [2019-10-03 02:55:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-03 02:55:15,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:15,305 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:15,305 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:15,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1427183847, now seen corresponding path program 1 times [2019-10-03 02:55:15,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:15,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:15,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:15,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:15,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 02:55:15,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:15,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 02:55:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 02:55:15,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:55:15,554 INFO L87 Difference]: Start difference. First operand 7556 states and 10417 transitions. Second operand 10 states. [2019-10-03 02:55:15,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:15,631 INFO L93 Difference]: Finished difference Result 7606 states and 10489 transitions. [2019-10-03 02:55:15,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:55:15,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 205 [2019-10-03 02:55:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:15,666 INFO L225 Difference]: With dead ends: 7606 [2019-10-03 02:55:15,667 INFO L226 Difference]: Without dead ends: 7548 [2019-10-03 02:55:15,667 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 02:55:15,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7548 states. [2019-10-03 02:55:16,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7548 to 7540. [2019-10-03 02:55:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7540 states. [2019-10-03 02:55:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7540 states to 7540 states and 10381 transitions. [2019-10-03 02:55:16,132 INFO L78 Accepts]: Start accepts. Automaton has 7540 states and 10381 transitions. Word has length 205 [2019-10-03 02:55:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:16,133 INFO L475 AbstractCegarLoop]: Abstraction has 7540 states and 10381 transitions. [2019-10-03 02:55:16,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 02:55:16,134 INFO L276 IsEmpty]: Start isEmpty. Operand 7540 states and 10381 transitions. [2019-10-03 02:55:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 02:55:16,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:16,150 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:16,150 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:16,151 INFO L82 PathProgramCache]: Analyzing trace with hash 404763986, now seen corresponding path program 1 times [2019-10-03 02:55:16,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:16,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:16,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:16,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:16,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:16,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:16,323 INFO L87 Difference]: Start difference. First operand 7540 states and 10381 transitions. Second operand 5 states. [2019-10-03 02:55:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:16,380 INFO L93 Difference]: Finished difference Result 7689 states and 10585 transitions. [2019-10-03 02:55:16,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:16,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-03 02:55:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:16,410 INFO L225 Difference]: With dead ends: 7689 [2019-10-03 02:55:16,411 INFO L226 Difference]: Without dead ends: 7689 [2019-10-03 02:55:16,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7689 states. [2019-10-03 02:55:16,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7689 to 7622. [2019-10-03 02:55:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7622 states. [2019-10-03 02:55:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7622 states to 7622 states and 10486 transitions. [2019-10-03 02:55:16,628 INFO L78 Accepts]: Start accepts. Automaton has 7622 states and 10486 transitions. Word has length 210 [2019-10-03 02:55:16,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:16,628 INFO L475 AbstractCegarLoop]: Abstraction has 7622 states and 10486 transitions. [2019-10-03 02:55:16,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 7622 states and 10486 transitions. [2019-10-03 02:55:16,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-03 02:55:16,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:16,640 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:16,640 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:16,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1565961098, now seen corresponding path program 1 times [2019-10-03 02:55:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:16,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:16,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:16,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-03 02:55:16,852 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:16,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-03 02:55:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-03 02:55:16,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:55:16,854 INFO L87 Difference]: Start difference. First operand 7622 states and 10486 transitions. Second operand 11 states. [2019-10-03 02:55:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:17,204 INFO L93 Difference]: Finished difference Result 7620 states and 10458 transitions. [2019-10-03 02:55:17,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 02:55:17,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 210 [2019-10-03 02:55:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:17,241 INFO L225 Difference]: With dead ends: 7620 [2019-10-03 02:55:17,242 INFO L226 Difference]: Without dead ends: 7620 [2019-10-03 02:55:17,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-03 02:55:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7620 states. [2019-10-03 02:55:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7620 to 7584. [2019-10-03 02:55:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7584 states. [2019-10-03 02:55:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 10404 transitions. [2019-10-03 02:55:17,533 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 10404 transitions. Word has length 210 [2019-10-03 02:55:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:17,534 INFO L475 AbstractCegarLoop]: Abstraction has 7584 states and 10404 transitions. [2019-10-03 02:55:17,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-03 02:55:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 10404 transitions. [2019-10-03 02:55:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-03 02:55:17,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:17,545 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:17,545 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:17,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:17,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1834380725, now seen corresponding path program 1 times [2019-10-03 02:55:17,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:17,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-03 02:55:17,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:17,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 02:55:17,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:17,807 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 02:55:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 02:55:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:55:17,808 INFO L87 Difference]: Start difference. First operand 7584 states and 10404 transitions. Second operand 6 states. [2019-10-03 02:55:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:18,416 INFO L93 Difference]: Finished difference Result 15151 states and 20840 transitions. [2019-10-03 02:55:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 02:55:18,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-10-03 02:55:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:18,475 INFO L225 Difference]: With dead ends: 15151 [2019-10-03 02:55:18,475 INFO L226 Difference]: Without dead ends: 15151 [2019-10-03 02:55:18,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-03 02:55:18,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15151 states. [2019-10-03 02:55:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15151 to 15017. [2019-10-03 02:55:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15017 states. [2019-10-03 02:55:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15017 states to 15017 states and 20675 transitions. [2019-10-03 02:55:18,905 INFO L78 Accepts]: Start accepts. Automaton has 15017 states and 20675 transitions. Word has length 211 [2019-10-03 02:55:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:18,906 INFO L475 AbstractCegarLoop]: Abstraction has 15017 states and 20675 transitions. [2019-10-03 02:55:18,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 02:55:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 15017 states and 20675 transitions. [2019-10-03 02:55:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:55:18,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:18,927 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] [2019-10-03 02:55:18,927 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash -934857408, now seen corresponding path program 1 times [2019-10-03 02:55:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:18,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:18,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:18,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:55:19,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:19,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:55:19,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:19,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:55:19,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:55:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:55:19,086 INFO L87 Difference]: Start difference. First operand 15017 states and 20675 transitions. Second operand 3 states. [2019-10-03 02:55:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:19,160 INFO L93 Difference]: Finished difference Result 15959 states and 22481 transitions. [2019-10-03 02:55:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:55:19,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-03 02:55:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:19,224 INFO L225 Difference]: With dead ends: 15959 [2019-10-03 02:55:19,224 INFO L226 Difference]: Without dead ends: 15959 [2019-10-03 02:55:19,225 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:55:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15959 states. [2019-10-03 02:55:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15959 to 15953. [2019-10-03 02:55:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15953 states. [2019-10-03 02:55:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15953 states to 15953 states and 22475 transitions. [2019-10-03 02:55:20,499 INFO L78 Accepts]: Start accepts. Automaton has 15953 states and 22475 transitions. Word has length 231 [2019-10-03 02:55:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:20,500 INFO L475 AbstractCegarLoop]: Abstraction has 15953 states and 22475 transitions. [2019-10-03 02:55:20,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:55:20,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15953 states and 22475 transitions. [2019-10-03 02:55:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 02:55:20,525 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:20,526 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] [2019-10-03 02:55:20,526 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1061988087, now seen corresponding path program 1 times [2019-10-03 02:55:20,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:20,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:20,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:20,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:20,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:55:20,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:20,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:20,804 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:20,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:20,806 INFO L87 Difference]: Start difference. First operand 15953 states and 22475 transitions. Second operand 8 states. [2019-10-03 02:55:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:25,829 INFO L93 Difference]: Finished difference Result 32585 states and 48075 transitions. [2019-10-03 02:55:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:55:25,830 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 232 [2019-10-03 02:55:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:25,948 INFO L225 Difference]: With dead ends: 32585 [2019-10-03 02:55:25,949 INFO L226 Difference]: Without dead ends: 32585 [2019-10-03 02:55:25,950 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:55:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32585 states. [2019-10-03 02:55:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32585 to 29229. [2019-10-03 02:55:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29229 states. [2019-10-03 02:55:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29229 states to 29229 states and 42933 transitions. [2019-10-03 02:55:26,815 INFO L78 Accepts]: Start accepts. Automaton has 29229 states and 42933 transitions. Word has length 232 [2019-10-03 02:55:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:26,815 INFO L475 AbstractCegarLoop]: Abstraction has 29229 states and 42933 transitions. [2019-10-03 02:55:26,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:26,816 INFO L276 IsEmpty]: Start isEmpty. Operand 29229 states and 42933 transitions. [2019-10-03 02:55:26,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-03 02:55:26,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:26,873 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:26,873 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:26,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:26,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1952700717, now seen corresponding path program 1 times [2019-10-03 02:55:26,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:26,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:26,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:55:27,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:27,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:27,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:27,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:27,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:27,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:27,070 INFO L87 Difference]: Start difference. First operand 29229 states and 42933 transitions. Second operand 8 states. [2019-10-03 02:55:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:32,431 INFO L93 Difference]: Finished difference Result 59917 states and 92333 transitions. [2019-10-03 02:55:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:55:32,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 248 [2019-10-03 02:55:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:32,758 INFO L225 Difference]: With dead ends: 59917 [2019-10-03 02:55:32,758 INFO L226 Difference]: Without dead ends: 59917 [2019-10-03 02:55:32,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:55:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59917 states. [2019-10-03 02:55:36,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59917 to 54299. [2019-10-03 02:55:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54299 states. [2019-10-03 02:55:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54299 states to 54299 states and 83247 transitions. [2019-10-03 02:55:37,013 INFO L78 Accepts]: Start accepts. Automaton has 54299 states and 83247 transitions. Word has length 248 [2019-10-03 02:55:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:37,013 INFO L475 AbstractCegarLoop]: Abstraction has 54299 states and 83247 transitions. [2019-10-03 02:55:37,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 54299 states and 83247 transitions. [2019-10-03 02:55:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-03 02:55:37,144 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:37,144 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:55:37,145 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:37,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:37,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1782226126, now seen corresponding path program 1 times [2019-10-03 02:55:37,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:37,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:37,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-03 02:55:37,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:37,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:55:37,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:37,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:55:37,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:55:37,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:37,346 INFO L87 Difference]: Start difference. First operand 54299 states and 83247 transitions. Second operand 5 states. [2019-10-03 02:55:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:37,913 INFO L93 Difference]: Finished difference Result 54563 states and 83823 transitions. [2019-10-03 02:55:37,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:55:37,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 234 [2019-10-03 02:55:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:38,144 INFO L225 Difference]: With dead ends: 54563 [2019-10-03 02:55:38,144 INFO L226 Difference]: Without dead ends: 54563 [2019-10-03 02:55:38,146 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:55:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54563 states. [2019-10-03 02:55:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54563 to 54323. [2019-10-03 02:55:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54323 states. [2019-10-03 02:55:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54323 states to 54323 states and 83271 transitions. [2019-10-03 02:55:39,461 INFO L78 Accepts]: Start accepts. Automaton has 54323 states and 83271 transitions. Word has length 234 [2019-10-03 02:55:39,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:39,461 INFO L475 AbstractCegarLoop]: Abstraction has 54323 states and 83271 transitions. [2019-10-03 02:55:39,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:55:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 54323 states and 83271 transitions. [2019-10-03 02:55:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-03 02:55:41,285 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:41,286 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:41,286 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:41,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:41,286 INFO L82 PathProgramCache]: Analyzing trace with hash 342981855, now seen corresponding path program 1 times [2019-10-03 02:55:41,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:41,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:41,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:41,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:55:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:41,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:41,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:41,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:41,577 INFO L87 Difference]: Start difference. First operand 54323 states and 83271 transitions. Second operand 8 states. [2019-10-03 02:55:46,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:46,600 INFO L93 Difference]: Finished difference Result 111581 states and 179669 transitions. [2019-10-03 02:55:46,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-03 02:55:46,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 249 [2019-10-03 02:55:46,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:47,035 INFO L225 Difference]: With dead ends: 111581 [2019-10-03 02:55:47,035 INFO L226 Difference]: Without dead ends: 111581 [2019-10-03 02:55:47,035 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-03 02:55:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111581 states. [2019-10-03 02:55:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111581 to 103006. [2019-10-03 02:55:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103006 states. [2019-10-03 02:55:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103006 states to 103006 states and 164645 transitions. [2019-10-03 02:55:51,583 INFO L78 Accepts]: Start accepts. Automaton has 103006 states and 164645 transitions. Word has length 249 [2019-10-03 02:55:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:55:51,584 INFO L475 AbstractCegarLoop]: Abstraction has 103006 states and 164645 transitions. [2019-10-03 02:55:51,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:55:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 103006 states and 164645 transitions. [2019-10-03 02:55:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-03 02:55:51,731 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:55:51,731 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:55:51,732 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:55:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:55:51,732 INFO L82 PathProgramCache]: Analyzing trace with hash -127167591, now seen corresponding path program 1 times [2019-10-03 02:55:51,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:55:51,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:51,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:55:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:55:51,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:55:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:55:51,943 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-03 02:55:51,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:55:51,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 02:55:51,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:55:51,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:55:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:55:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 02:55:51,946 INFO L87 Difference]: Start difference. First operand 103006 states and 164645 transitions. Second operand 8 states. [2019-10-03 02:55:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:55:53,997 INFO L93 Difference]: Finished difference Result 211000 states and 338070 transitions. [2019-10-03 02:55:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:55:53,998 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 230 [2019-10-03 02:55:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:55:54,818 INFO L225 Difference]: With dead ends: 211000 [2019-10-03 02:55:54,818 INFO L226 Difference]: Without dead ends: 211000 [2019-10-03 02:55:54,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:55:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211000 states. [2019-10-03 02:56:02,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211000 to 191827. [2019-10-03 02:56:02,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191827 states. [2019-10-03 02:56:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191827 states to 191827 states and 312301 transitions. [2019-10-03 02:56:04,178 INFO L78 Accepts]: Start accepts. Automaton has 191827 states and 312301 transitions. Word has length 230 [2019-10-03 02:56:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:04,178 INFO L475 AbstractCegarLoop]: Abstraction has 191827 states and 312301 transitions. [2019-10-03 02:56:04,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:56:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 191827 states and 312301 transitions. [2019-10-03 02:56:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:56:04,478 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:04,479 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:56:04,479 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash 184196754, now seen corresponding path program 1 times [2019-10-03 02:56:04,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:04,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:04,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:04,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:56:04,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:56:04,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-03 02:56:04,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:04,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-03 02:56:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-03 02:56:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-03 02:56:04,772 INFO L87 Difference]: Start difference. First operand 191827 states and 312301 transitions. Second operand 15 states. [2019-10-03 02:56:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:09,293 INFO L93 Difference]: Finished difference Result 192431 states and 313550 transitions. [2019-10-03 02:56:09,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-03 02:56:09,295 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 231 [2019-10-03 02:56:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:15,028 INFO L225 Difference]: With dead ends: 192431 [2019-10-03 02:56:15,028 INFO L226 Difference]: Without dead ends: 192291 [2019-10-03 02:56:15,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-03 02:56:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192291 states. [2019-10-03 02:56:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192291 to 170275. [2019-10-03 02:56:18,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170275 states. [2019-10-03 02:56:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170275 states to 170275 states and 282973 transitions. [2019-10-03 02:56:19,128 INFO L78 Accepts]: Start accepts. Automaton has 170275 states and 282973 transitions. Word has length 231 [2019-10-03 02:56:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:19,128 INFO L475 AbstractCegarLoop]: Abstraction has 170275 states and 282973 transitions. [2019-10-03 02:56:19,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-03 02:56:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 170275 states and 282973 transitions. [2019-10-03 02:56:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:56:19,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:19,411 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:56:19,411 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1294998609, now seen corresponding path program 1 times [2019-10-03 02:56:19,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:19,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:19,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:19,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:19,592 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:56:19,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:56:19,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 02:56:19,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:19,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:56:19,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:56:19,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 02:56:19,594 INFO L87 Difference]: Start difference. First operand 170275 states and 282973 transitions. Second operand 7 states. [2019-10-03 02:56:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:26,581 INFO L93 Difference]: Finished difference Result 371952 states and 663005 transitions. [2019-10-03 02:56:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 02:56:26,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-10-03 02:56:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:56:34,297 INFO L225 Difference]: With dead ends: 371952 [2019-10-03 02:56:34,297 INFO L226 Difference]: Without dead ends: 371819 [2019-10-03 02:56:34,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-03 02:56:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371819 states. [2019-10-03 02:56:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371819 to 327794. [2019-10-03 02:56:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327794 states. [2019-10-03 02:56:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327794 states to 327794 states and 552114 transitions. [2019-10-03 02:56:52,735 INFO L78 Accepts]: Start accepts. Automaton has 327794 states and 552114 transitions. Word has length 231 [2019-10-03 02:56:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:56:52,735 INFO L475 AbstractCegarLoop]: Abstraction has 327794 states and 552114 transitions. [2019-10-03 02:56:52,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:56:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 327794 states and 552114 transitions. [2019-10-03 02:56:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-03 02:56:53,426 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:56:53,427 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:56:53,427 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:56:53,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:56:53,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1028178199, now seen corresponding path program 2 times [2019-10-03 02:56:53,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:56:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:53,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:56:53,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:56:53,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:56:53,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:56:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 02:56:53,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:56:53,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:56:53,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:56:53,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:56:53,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:56:53,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:56:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:56:53,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:56:54,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-03 02:56:54,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:56:54,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-03 02:56:54,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:56:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-03 02:56:54,570 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:56:54,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:56:54,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-03 02:56:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Abandoning pump threads because process wont die! [2019-10-03 02:56:55,971 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:56:55,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [11] total 21 [2019-10-03 02:56:55,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:56:55,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 02:56:55,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 02:56:55,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:56:55,974 INFO L87 Difference]: Start difference. First operand 327794 states and 552114 transitions. Second operand 7 states. [2019-10-03 02:56:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:56:59,853 INFO L93 Difference]: Finished difference Result 328032 states and 552455 transitions. [2019-10-03 02:56:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:56:59,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 231 [2019-10-03 02:56:59,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:01,605 INFO L225 Difference]: With dead ends: 328032 [2019-10-03 02:57:01,606 INFO L226 Difference]: Without dead ends: 328028 [2019-10-03 02:57:01,606 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 451 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2019-10-03 02:57:01,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328028 states. [2019-10-03 02:57:20,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328028 to 317954. [2019-10-03 02:57:20,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317954 states. [2019-10-03 02:57:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317954 states to 317954 states and 538980 transitions. [2019-10-03 02:57:21,879 INFO L78 Accepts]: Start accepts. Automaton has 317954 states and 538980 transitions. Word has length 231 [2019-10-03 02:57:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:21,880 INFO L475 AbstractCegarLoop]: Abstraction has 317954 states and 538980 transitions. [2019-10-03 02:57:21,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 02:57:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 317954 states and 538980 transitions. [2019-10-03 02:57:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-03 02:57:30,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:57:30,130 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:57:30,130 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:57:30,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1381775105, now seen corresponding path program 1 times [2019-10-03 02:57:30,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:57:30,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:30,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:57:30,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:57:30,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:57:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:57:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 02:57:30,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:57:30,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:57:30,444 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 233 with the following transitions: [2019-10-03 02:57:30,448 INFO L207 CegarAbsIntRunner]: [72], [75], [76], [79], [85], [130], [132], [137], [141], [157], [160], [161], [164], [173], [174], [175], [177], [259], [262], [268], [287], [289], [293], [296], [297], [298], [301], [307], [343], [345], [347], [354], [361], [364], [373], [384], [386], [389], [393], [394], [396], [397], [400], [410], [439], [478], [479], [482], [491], [498], [671], [673], [674], [675], [713], [716], [730], [769], [770], [771], [773], [776], [779], [785], [786], [788], [791], [795], [819], [823], [826], [834], [837], [875], [877], [880], [882], [885], [887], [889], [892], [908], [917], [921], [923], [925], [928], [935], [942], [945], [947], [1083], [1086], [1100], [1208], [1280], [1284], [1295], [1298], [1299], [1302], [1306], [1310], [1336], [1337], [1339], [1408], [1411], [1417], [1452], [1455], [1457], [1460], [1469], [1475], [1478], [1487], [1676], [1678], [1680], [1682], [1683], [1719], [1720], [1721], [1723], [1733], [1734], [1735], [1736], [1737], [1738], [1741], [1742], [1743], [1744], [1745], [1747], [1748], [1749], [1750], [1763], [1764], [1765], [1766], [1771], [1779], [1780], [1783], [1784], [1789], [1805], [1806], [1807], [1831], [1832], [1847], [1848], [1849], [1851], [1852], [1857], [1858], [1859], [1860], [1861], [1862], [1863], [1864], [1865], [1867], [1868], [1869], [1870], [1891], [1892], [1893], [1894], [1895], [1896], [1897], [1898], [1899], [1900], [1901], [1902], [1903], [1909], [1910], [1927], [1929], [1930], [1931], [1933], [1934], [1935], [1936], [1937], [1938], [1939], [1951], [1952], [1953], [1954], [1955], [1956], [1957], [1958], [1959] [2019-10-03 02:57:30,536 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:57:30,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:57:30,758 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 02:57:30,760 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 200 root evaluator evaluations with a maximum evaluation depth of 0. Performed 200 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 372 variables. [2019-10-03 02:57:30,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:57:30,767 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 02:57:30,868 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 02:57:30,868 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 02:57:30,875 INFO L420 sIntCurrentIteration]: We unified 231 AI predicates to 231 [2019-10-03 02:57:30,875 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 02:57:30,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 02:57:30,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-10-03 02:57:30,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:57:30,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:57:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:57:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:57:30,878 INFO L87 Difference]: Start difference. First operand 317954 states and 538980 transitions. Second operand 2 states. [2019-10-03 02:57:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:57:30,879 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 02:57:30,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:57:30,879 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 232 [2019-10-03 02:57:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:57:30,880 INFO L225 Difference]: With dead ends: 2 [2019-10-03 02:57:30,880 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 02:57:30,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 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:57:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 02:57:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 02:57:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 02:57:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 02:57:30,882 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 232 [2019-10-03 02:57:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:57:30,883 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 02:57:30,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:57:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 02:57:30,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 02:57:30,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:57:30 BoogieIcfgContainer [2019-10-03 02:57:30,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:57:30,898 INFO L168 Benchmark]: Toolchain (without parser) took 161045.81 ms. Allocated memory was 132.6 MB in the beginning and 4.3 GB in the end (delta: 4.2 GB). Free memory was 85.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-10-03 02:57:30,899 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 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:57:30,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1100.73 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 128.8 MB in the end (delta: -43.4 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:30,903 INFO L168 Benchmark]: Boogie Preprocessor took 268.24 ms. Allocated memory is still 200.8 MB. Free memory was 128.8 MB in the beginning and 120.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:30,905 INFO L168 Benchmark]: RCFGBuilder took 2570.34 ms. Allocated memory was 200.8 MB in the beginning and 265.8 MB in the end (delta: 65.0 MB). Free memory was 120.0 MB in the beginning and 150.2 MB in the end (delta: -30.2 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:57:30,907 INFO L168 Benchmark]: TraceAbstraction took 157101.43 ms. Allocated memory was 265.8 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 150.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-10-03 02:57:30,920 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1100.73 ms. Allocated memory was 132.6 MB in the beginning and 200.8 MB in the end (delta: 68.2 MB). Free memory was 85.3 MB in the beginning and 128.8 MB in the end (delta: -43.4 MB). Peak memory consumption was 33.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 268.24 ms. Allocated memory is still 200.8 MB. Free memory was 128.8 MB in the beginning and 120.0 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2570.34 ms. Allocated memory was 200.8 MB in the beginning and 265.8 MB in the end (delta: 65.0 MB). Free memory was 120.0 MB in the beginning and 150.2 MB in the end (delta: -30.2 MB). Peak memory consumption was 80.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157101.43 ms. Allocated memory was 265.8 MB in the beginning and 4.3 GB in the end (delta: 4.1 GB). Free memory was 150.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 938]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 118 procedures, 808 locations, 1 error locations. SAFE Result, 157.0s OverallTime, 25 OverallIterations, 3 TraceHistogramMax, 67.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21637 SDtfs, 16306 SDslu, 112593 SDs, 0 SdLazy, 32167 SolverSat, 3979 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 32.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1153 GetRequests, 813 SyntacticMatches, 2 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1712 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327794occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.038961038961039 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 67.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 113604 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 5575 NumberOfCodeBlocks, 5556 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 5779 ConstructedInterpolants, 0 QuantifiedInterpolants, 1664659 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2844 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 27 InterpolantComputations, 25 PerfectInterpolantSequences, 1062/1067 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...