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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec27_product34.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:56:49,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:56:49,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:56:49,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:56:49,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:56:49,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:56:49,889 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:56:49,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:56:49,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:56:49,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:56:49,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:56:49,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:56:49,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:56:49,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:56:49,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:56:49,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:56:49,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:56:49,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:56:49,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:56:49,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:56:49,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:56:49,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:56:49,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:56:49,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:56:49,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:56:49,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:56:49,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:56:49,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:56:49,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:56:49,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:56:49,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:56:49,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:56:49,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:56:49,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:56:49,923 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:56:49,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:56:49,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:56:49,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:56:49,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:56:49,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:56:49,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:56:49,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:56:49,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:56:49,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:56:49,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:56:49,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:56:49,951 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:56:49,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:56:49,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:56:49,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:56:49,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:56:49,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:56:49,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:56:49,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:56:49,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:56:49,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:56:49,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:56:49,954 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:56:49,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:56:49,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:56:49,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:56:49,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:56:49,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:56:49,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:56:49,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:56:49,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:56:49,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:56:49,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:56:49,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:56:49,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:56:49,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:56:49,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:56:49,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:56:50,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:56:50,002 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:56:50,003 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:56:50,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_product34.cil.c [2019-09-08 04:56:50,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1a0ce3c/b6a0107ea1f345f9bbfc25afc032f5aa/FLAGb2f453c9b [2019-09-08 04:56:50,699 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:56:50,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_product34.cil.c [2019-09-08 04:56:50,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1a0ce3c/b6a0107ea1f345f9bbfc25afc032f5aa/FLAGb2f453c9b [2019-09-08 04:56:50,854 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1a0ce3c/b6a0107ea1f345f9bbfc25afc032f5aa [2019-09-08 04:56:50,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:56:50,870 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:56:50,871 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:56:50,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:56:50,876 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:56:50,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:56:50" (1/1) ... [2019-09-08 04:56:50,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a5fa9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:50, skipping insertion in model container [2019-09-08 04:56:50,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:56:50" (1/1) ... [2019-09-08 04:56:50,892 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:56:50,991 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:56:51,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:56:51,813 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:56:51,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:56:52,071 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:56:52,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52 WrapperNode [2019-09-08 04:56:52,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:56:52,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:56:52,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:56:52,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:56:52,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... [2019-09-08 04:56:52,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:56:52,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:56:52,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:56:52,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:56:52,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:56:52,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:56:52,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:56:52,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:56:52,335 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:56:52,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:56:52,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:56:52,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:56:52,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:56:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:56:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:56:52,339 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:56:52,339 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:56:52,339 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:56:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:56:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:56:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:56:52,343 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:56:52,343 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:56:52,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:56:52,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:56:52,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:56:52,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:56:52,344 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:56:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:56:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:56:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:56:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:56:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:56:52,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 04:56:52,346 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:56:52,347 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:56:52,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:56:52,348 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:56:52,348 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:56:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:56:52,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:56:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:56:52,352 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:56:52,352 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:56:52,352 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 04:56:52,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 04:56:52,353 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:56:52,353 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:56:52,353 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:56:52,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:56:52,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:56:52,354 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:56:52,354 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:56:52,355 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:56:52,355 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:56:52,355 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:56:52,355 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:56:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:56:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:56:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:56:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 04:56:52,356 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:56:52,357 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:56:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:56:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-09-08 04:56:52,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:56:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:56:52,361 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:56:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:56:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:56:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:56:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:56:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:56:52,362 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 04:56:52,363 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:56:52,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:56:52,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:56:52,364 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:56:52,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:56:52,364 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:56:52,364 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:56:52,366 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:56:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:56:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:56:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:56:52,367 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:56:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:56:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:56:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:56:52,368 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:56:52,369 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:56:52,372 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:56:52,373 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:56:52,376 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:56:52,377 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:56:52,381 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:56:52,382 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:56:52,383 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:56:52,383 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:56:52,383 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:56:52,383 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:56:52,383 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:56:52,383 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:56:52,384 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:56:52,384 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:56:52,384 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 04:56:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:56:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:56:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:56:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 04:56:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:56:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:56:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:56:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:56:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:56:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:56:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:56:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:56:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:56:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:56:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:56:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:56:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:56:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:56:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:56:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:56:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:56:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 04:56:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:56:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:56:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:56:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:56:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 04:56:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 04:56:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-09-08 04:56:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:56:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:56:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:56:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:56:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:56:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:56:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:56:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:56:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:56:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:56:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:56:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:56:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:56:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:56:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:56:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:56:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:56:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:56:54,703 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:56:54,704 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:56:54,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:56:54 BoogieIcfgContainer [2019-09-08 04:56:54,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:56:54,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:56:54,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:56:54,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:56:54,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:56:50" (1/3) ... [2019-09-08 04:56:54,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d1c659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:56:54, skipping insertion in model container [2019-09-08 04:56:54,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:56:52" (2/3) ... [2019-09-08 04:56:54,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d1c659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:56:54, skipping insertion in model container [2019-09-08 04:56:54,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:56:54" (3/3) ... [2019-09-08 04:56:54,716 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_product34.cil.c [2019-09-08 04:56:54,727 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:56:54,742 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:56:54,763 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:56:54,821 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:56:54,822 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:56:54,822 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:56:54,822 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:56:54,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:56:54,827 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:56:54,827 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:56:54,827 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:56:54,827 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:56:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states. [2019-09-08 04:56:54,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 04:56:54,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:56:54,917 INFO L399 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] [2019-09-08 04:56:54,922 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:56:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:56:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1025683934, now seen corresponding path program 1 times [2019-09-08 04:56:54,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:56:54,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:56:54,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:54,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:54,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:55,742 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:56:55,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:56:55,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:56:55,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:56:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:56:55,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:56:55,769 INFO L87 Difference]: Start difference. First operand 653 states. Second operand 2 states. [2019-09-08 04:56:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:56:55,914 INFO L93 Difference]: Finished difference Result 992 states and 1342 transitions. [2019-09-08 04:56:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:56:55,917 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 220 [2019-09-08 04:56:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:56:55,955 INFO L225 Difference]: With dead ends: 992 [2019-09-08 04:56:55,956 INFO L226 Difference]: Without dead ends: 624 [2019-09-08 04:56:55,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:56:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-09-08 04:56:56,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 624. [2019-09-08 04:56:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-09-08 04:56:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 847 transitions. [2019-09-08 04:56:56,095 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 847 transitions. Word has length 220 [2019-09-08 04:56:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:56:56,099 INFO L475 AbstractCegarLoop]: Abstraction has 624 states and 847 transitions. [2019-09-08 04:56:56,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:56:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 847 transitions. [2019-09-08 04:56:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 04:56:56,109 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:56:56,111 INFO L399 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] [2019-09-08 04:56:56,112 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:56:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:56:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 336824807, now seen corresponding path program 1 times [2019-09-08 04:56:56,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:56:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:56:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:56,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:56:56,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:56:56,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:56:56,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:56:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:56:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:56:56,441 INFO L87 Difference]: Start difference. First operand 624 states and 847 transitions. Second operand 3 states. [2019-09-08 04:56:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:56:56,560 INFO L93 Difference]: Finished difference Result 975 states and 1302 transitions. [2019-09-08 04:56:56,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:56:56,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2019-09-08 04:56:56,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:56:56,569 INFO L225 Difference]: With dead ends: 975 [2019-09-08 04:56:56,570 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 04:56:56,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:56:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 04:56:56,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 626. [2019-09-08 04:56:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 04:56:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 849 transitions. [2019-09-08 04:56:56,640 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 849 transitions. Word has length 221 [2019-09-08 04:56:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:56:56,642 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 849 transitions. [2019-09-08 04:56:56,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:56:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 849 transitions. [2019-09-08 04:56:56,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 04:56:56,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:56:56,661 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:56:56,661 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:56:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:56:56,662 INFO L82 PathProgramCache]: Analyzing trace with hash 982299259, now seen corresponding path program 1 times [2019-09-08 04:56:56,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:56:56,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:56:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:56,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:56:56,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:56:56,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:56:56,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:56:56,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:56:56,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:56:56,950 INFO L87 Difference]: Start difference. First operand 626 states and 849 transitions. Second operand 3 states. [2019-09-08 04:56:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:56:57,007 INFO L93 Difference]: Finished difference Result 1230 states and 1699 transitions. [2019-09-08 04:56:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:56:57,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-09-08 04:56:57,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:56:57,016 INFO L225 Difference]: With dead ends: 1230 [2019-09-08 04:56:57,016 INFO L226 Difference]: Without dead ends: 669 [2019-09-08 04:56:57,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:56:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-09-08 04:56:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 668. [2019-09-08 04:56:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2019-09-08 04:56:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 921 transitions. [2019-09-08 04:56:57,062 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 921 transitions. Word has length 227 [2019-09-08 04:56:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:56:57,063 INFO L475 AbstractCegarLoop]: Abstraction has 668 states and 921 transitions. [2019-09-08 04:56:57,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:56:57,063 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 921 transitions. [2019-09-08 04:56:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 04:56:57,070 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:56:57,070 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:56:57,071 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:56:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:56:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1381931188, now seen corresponding path program 1 times [2019-09-08 04:56:57,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:56:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:56:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:57,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:56:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:56:57,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:56:57,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-09-08 04:56:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:56:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:56:58,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:56:58,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:56:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 04:56:58,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:56:58,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-09-08 04:56:58,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 04:56:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 04:56:58,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:56:58,624 INFO L87 Difference]: Start difference. First operand 668 states and 921 transitions. Second operand 26 states. [2019-09-08 04:57:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:09,806 INFO L93 Difference]: Finished difference Result 2685 states and 3771 transitions. [2019-09-08 04:57:09,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 04:57:09,807 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 228 [2019-09-08 04:57:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:09,821 INFO L225 Difference]: With dead ends: 2685 [2019-09-08 04:57:09,822 INFO L226 Difference]: Without dead ends: 2053 [2019-09-08 04:57:09,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-09-08 04:57:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2019-09-08 04:57:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2016. [2019-09-08 04:57:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2016 states. [2019-09-08 04:57:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 2806 transitions. [2019-09-08 04:57:09,962 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 2806 transitions. Word has length 228 [2019-09-08 04:57:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:09,963 INFO L475 AbstractCegarLoop]: Abstraction has 2016 states and 2806 transitions. [2019-09-08 04:57:09,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 04:57:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 2806 transitions. [2019-09-08 04:57:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:57:09,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:09,972 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:09,973 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:09,973 INFO L82 PathProgramCache]: Analyzing trace with hash 557127087, now seen corresponding path program 1 times [2019-09-08 04:57:09,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:09,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:57:10,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 04:57:10,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:57:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:57:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:57:10,324 INFO L87 Difference]: Start difference. First operand 2016 states and 2806 transitions. Second operand 18 states. [2019-09-08 04:57:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:10,874 INFO L93 Difference]: Finished difference Result 3605 states and 5022 transitions. [2019-09-08 04:57:10,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:57:10,875 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-09-08 04:57:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:10,891 INFO L225 Difference]: With dead ends: 3605 [2019-09-08 04:57:10,891 INFO L226 Difference]: Without dead ends: 2198 [2019-09-08 04:57:10,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 04:57:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-09-08 04:57:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2198. [2019-09-08 04:57:11,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-09-08 04:57:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 3075 transitions. [2019-09-08 04:57:11,029 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 3075 transitions. Word has length 230 [2019-09-08 04:57:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:11,030 INFO L475 AbstractCegarLoop]: Abstraction has 2198 states and 3075 transitions. [2019-09-08 04:57:11,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:57:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 3075 transitions. [2019-09-08 04:57:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 04:57:11,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:11,041 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:11,041 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:11,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:11,041 INFO L82 PathProgramCache]: Analyzing trace with hash -482918734, now seen corresponding path program 1 times [2019-09-08 04:57:11,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:11,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:11,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:11,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:11,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:57:11,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:57:11,430 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:57:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:57:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:12,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:57:12,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:57:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 04:57:12,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:57:12,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-09-08 04:57:12,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 04:57:12,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 04:57:12,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-09-08 04:57:12,266 INFO L87 Difference]: Start difference. First operand 2198 states and 3075 transitions. Second operand 20 states. [2019-09-08 04:57:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:20,589 INFO L93 Difference]: Finished difference Result 4449 states and 6338 transitions. [2019-09-08 04:57:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 04:57:20,589 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 230 [2019-09-08 04:57:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:20,605 INFO L225 Difference]: With dead ends: 4449 [2019-09-08 04:57:20,605 INFO L226 Difference]: Without dead ends: 2302 [2019-09-08 04:57:20,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 04:57:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2019-09-08 04:57:20,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2272. [2019-09-08 04:57:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-09-08 04:57:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3197 transitions. [2019-09-08 04:57:20,720 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3197 transitions. Word has length 230 [2019-09-08 04:57:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:20,721 INFO L475 AbstractCegarLoop]: Abstraction has 2272 states and 3197 transitions. [2019-09-08 04:57:20,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 04:57:20,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3197 transitions. [2019-09-08 04:57:20,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 04:57:20,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:20,730 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:20,731 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:20,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:20,731 INFO L82 PathProgramCache]: Analyzing trace with hash -970890100, now seen corresponding path program 1 times [2019-09-08 04:57:20,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:20,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:20,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:20,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:20,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 04:57:20,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:57:20,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:57:20,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:21,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:57:21,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:57:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 04:57:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:57:21,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 04:57:21,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:57:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:57:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:57:21,642 INFO L87 Difference]: Start difference. First operand 2272 states and 3197 transitions. Second operand 12 states. [2019-09-08 04:57:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:26,497 INFO L93 Difference]: Finished difference Result 7202 states and 10333 transitions. [2019-09-08 04:57:26,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:57:26,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 231 [2019-09-08 04:57:26,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:26,533 INFO L225 Difference]: With dead ends: 7202 [2019-09-08 04:57:26,533 INFO L226 Difference]: Without dead ends: 4991 [2019-09-08 04:57:26,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:57:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2019-09-08 04:57:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4973. [2019-09-08 04:57:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4973 states. [2019-09-08 04:57:26,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 7093 transitions. [2019-09-08 04:57:26,821 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 7093 transitions. Word has length 231 [2019-09-08 04:57:26,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:26,822 INFO L475 AbstractCegarLoop]: Abstraction has 4973 states and 7093 transitions. [2019-09-08 04:57:26,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:57:26,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 7093 transitions. [2019-09-08 04:57:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 04:57:26,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:26,837 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:26,838 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:26,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash 858920462, now seen corresponding path program 1 times [2019-09-08 04:57:26,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:26,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:26,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:26,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:57:27,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:27,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:57:27,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:57:27,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:57:27,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:57:27,146 INFO L87 Difference]: Start difference. First operand 4973 states and 7093 transitions. Second operand 7 states. [2019-09-08 04:57:29,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:29,899 INFO L93 Difference]: Finished difference Result 17022 states and 26801 transitions. [2019-09-08 04:57:29,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:57:29,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 232 [2019-09-08 04:57:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:30,009 INFO L225 Difference]: With dead ends: 17022 [2019-09-08 04:57:30,009 INFO L226 Difference]: Without dead ends: 13059 [2019-09-08 04:57:30,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:57:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13059 states. [2019-09-08 04:57:30,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13059 to 13053. [2019-09-08 04:57:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13053 states. [2019-09-08 04:57:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13053 states to 13053 states and 20201 transitions. [2019-09-08 04:57:30,779 INFO L78 Accepts]: Start accepts. Automaton has 13053 states and 20201 transitions. Word has length 232 [2019-09-08 04:57:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:30,781 INFO L475 AbstractCegarLoop]: Abstraction has 13053 states and 20201 transitions. [2019-09-08 04:57:30,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:57:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13053 states and 20201 transitions. [2019-09-08 04:57:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 04:57:30,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:30,798 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:30,799 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1825549894, now seen corresponding path program 1 times [2019-09-08 04:57:30,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:30,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:30,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:30,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:57:31,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:31,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 04:57:31,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 04:57:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 04:57:31,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:57:31,433 INFO L87 Difference]: Start difference. First operand 13053 states and 20201 transitions. Second operand 26 states. [2019-09-08 04:57:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:32,620 INFO L93 Difference]: Finished difference Result 25316 states and 40029 transitions. [2019-09-08 04:57:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 04:57:32,620 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 233 [2019-09-08 04:57:32,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:32,706 INFO L225 Difference]: With dead ends: 25316 [2019-09-08 04:57:32,706 INFO L226 Difference]: Without dead ends: 13273 [2019-09-08 04:57:32,775 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 04:57:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13273 states. [2019-09-08 04:57:33,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13273 to 13253. [2019-09-08 04:57:33,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13253 states. [2019-09-08 04:57:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13253 states to 13253 states and 20437 transitions. [2019-09-08 04:57:33,646 INFO L78 Accepts]: Start accepts. Automaton has 13253 states and 20437 transitions. Word has length 233 [2019-09-08 04:57:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:33,648 INFO L475 AbstractCegarLoop]: Abstraction has 13253 states and 20437 transitions. [2019-09-08 04:57:33,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 04:57:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 13253 states and 20437 transitions. [2019-09-08 04:57:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 04:57:33,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:33,667 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:33,667 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:33,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:33,668 INFO L82 PathProgramCache]: Analyzing trace with hash 132402086, now seen corresponding path program 1 times [2019-09-08 04:57:33,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:33,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:33,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:33,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:33,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:57:33,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:33,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:57:33,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:57:33,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:57:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:57:33,896 INFO L87 Difference]: Start difference. First operand 13253 states and 20437 transitions. Second operand 10 states. [2019-09-08 04:57:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:34,502 INFO L93 Difference]: Finished difference Result 25706 states and 41178 transitions. [2019-09-08 04:57:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:57:34,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-09-08 04:57:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:34,596 INFO L225 Difference]: With dead ends: 25706 [2019-09-08 04:57:34,596 INFO L226 Difference]: Without dead ends: 13853 [2019-09-08 04:57:34,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-09-08 04:57:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13853 states. [2019-09-08 04:57:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13853 to 13373. [2019-09-08 04:57:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13373 states. [2019-09-08 04:57:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13373 states to 13373 states and 20577 transitions. [2019-09-08 04:57:36,455 INFO L78 Accepts]: Start accepts. Automaton has 13373 states and 20577 transitions. Word has length 237 [2019-09-08 04:57:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:36,458 INFO L475 AbstractCegarLoop]: Abstraction has 13373 states and 20577 transitions. [2019-09-08 04:57:36,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:57:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 13373 states and 20577 transitions. [2019-09-08 04:57:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 04:57:36,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:36,477 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:36,478 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:36,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:36,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1539036152, now seen corresponding path program 1 times [2019-09-08 04:57:36,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:36,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:36,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:36,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 04:57:36,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:57:36,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:57:36,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:57:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:37,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 3225 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:57:37,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:57:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:57:37,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:57:37,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 04:57:37,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:57:37,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:57:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:57:37,350 INFO L87 Difference]: Start difference. First operand 13373 states and 20577 transitions. Second operand 12 states. [2019-09-08 04:57:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:40,244 INFO L93 Difference]: Finished difference Result 27068 states and 42691 transitions. [2019-09-08 04:57:40,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:57:40,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2019-09-08 04:57:40,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:40,326 INFO L225 Difference]: With dead ends: 27068 [2019-09-08 04:57:40,326 INFO L226 Difference]: Without dead ends: 13770 [2019-09-08 04:57:40,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:57:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13770 states. [2019-09-08 04:57:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13770 to 13573. [2019-09-08 04:57:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13573 states. [2019-09-08 04:57:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13573 states to 13573 states and 20885 transitions. [2019-09-08 04:57:41,094 INFO L78 Accepts]: Start accepts. Automaton has 13573 states and 20885 transitions. Word has length 242 [2019-09-08 04:57:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:41,095 INFO L475 AbstractCegarLoop]: Abstraction has 13573 states and 20885 transitions. [2019-09-08 04:57:41,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:57:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13573 states and 20885 transitions. [2019-09-08 04:57:41,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-08 04:57:41,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:41,113 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:41,113 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:41,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:41,113 INFO L82 PathProgramCache]: Analyzing trace with hash 378753396, now seen corresponding path program 1 times [2019-09-08 04:57:41,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:41,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:41,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 04:57:41,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:57:41,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:57:41,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:57:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:41,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 3227 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:57:41,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:57:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 04:57:41,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:57:41,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-09-08 04:57:42,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 04:57:42,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 04:57:42,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:57:42,001 INFO L87 Difference]: Start difference. First operand 13573 states and 20885 transitions. Second operand 18 states. [2019-09-08 04:57:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:45,040 INFO L93 Difference]: Finished difference Result 27094 states and 42034 transitions. [2019-09-08 04:57:45,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:57:45,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 243 [2019-09-08 04:57:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:45,142 INFO L225 Difference]: With dead ends: 27094 [2019-09-08 04:57:45,142 INFO L226 Difference]: Without dead ends: 13601 [2019-09-08 04:57:45,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 04:57:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13601 states. [2019-09-08 04:57:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13601 to 13561. [2019-09-08 04:57:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13561 states. [2019-09-08 04:57:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13561 states to 13561 states and 20876 transitions. [2019-09-08 04:57:45,955 INFO L78 Accepts]: Start accepts. Automaton has 13561 states and 20876 transitions. Word has length 243 [2019-09-08 04:57:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:45,956 INFO L475 AbstractCegarLoop]: Abstraction has 13561 states and 20876 transitions. [2019-09-08 04:57:45,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 04:57:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 13561 states and 20876 transitions. [2019-09-08 04:57:45,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 04:57:45,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:45,971 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:45,971 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:45,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash 657263747, now seen corresponding path program 1 times [2019-09-08 04:57:45,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:45,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:45,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:57:46,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:46,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:57:46,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:57:46,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:57:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:57:46,140 INFO L87 Difference]: Start difference. First operand 13561 states and 20876 transitions. Second operand 5 states. [2019-09-08 04:57:46,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:46,568 INFO L93 Difference]: Finished difference Result 23517 states and 35926 transitions. [2019-09-08 04:57:46,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:57:46,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 04:57:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:46,819 INFO L225 Difference]: With dead ends: 23517 [2019-09-08 04:57:46,819 INFO L226 Difference]: Without dead ends: 10897 [2019-09-08 04:57:46,850 INFO L628 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-09-08 04:57:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10897 states. [2019-09-08 04:57:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10897 to 10887. [2019-09-08 04:57:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10887 states. [2019-09-08 04:57:47,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10887 states to 10887 states and 16521 transitions. [2019-09-08 04:57:47,383 INFO L78 Accepts]: Start accepts. Automaton has 10887 states and 16521 transitions. Word has length 246 [2019-09-08 04:57:47,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:47,383 INFO L475 AbstractCegarLoop]: Abstraction has 10887 states and 16521 transitions. [2019-09-08 04:57:47,383 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:57:47,383 INFO L276 IsEmpty]: Start isEmpty. Operand 10887 states and 16521 transitions. [2019-09-08 04:57:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:57:47,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:47,398 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:47,398 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:47,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash -906149942, now seen corresponding path program 1 times [2019-09-08 04:57:47,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:47,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:47,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:47,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:47,600 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 04:57:47,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:57:47,601 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 04:57:47,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:57:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:48,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 3229 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:57:48,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:57:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 04:57:48,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:57:48,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 04:57:48,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:57:48,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:57:48,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:57:48,222 INFO L87 Difference]: Start difference. First operand 10887 states and 16521 transitions. Second operand 11 states. [2019-09-08 04:57:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:51,328 INFO L93 Difference]: Finished difference Result 32688 states and 50445 transitions. [2019-09-08 04:57:51,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:57:51,329 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 245 [2019-09-08 04:57:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:51,424 INFO L225 Difference]: With dead ends: 32688 [2019-09-08 04:57:51,424 INFO L226 Difference]: Without dead ends: 21881 [2019-09-08 04:57:51,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:57:51,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21881 states. [2019-09-08 04:57:52,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21881 to 21541. [2019-09-08 04:57:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21541 states. [2019-09-08 04:57:52,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21541 states to 21541 states and 32674 transitions. [2019-09-08 04:57:52,323 INFO L78 Accepts]: Start accepts. Automaton has 21541 states and 32674 transitions. Word has length 245 [2019-09-08 04:57:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:52,323 INFO L475 AbstractCegarLoop]: Abstraction has 21541 states and 32674 transitions. [2019-09-08 04:57:52,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:57:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21541 states and 32674 transitions. [2019-09-08 04:57:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 04:57:52,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:52,339 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:52,339 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash 903015045, now seen corresponding path program 1 times [2019-09-08 04:57:52,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:52,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:57:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:57:52,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:57:52,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:57:52,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:57:52,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:57:52,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:57:52,531 INFO L87 Difference]: Start difference. First operand 21541 states and 32674 transitions. Second operand 7 states. [2019-09-08 04:57:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:57:57,044 INFO L93 Difference]: Finished difference Result 63057 states and 103004 transitions. [2019-09-08 04:57:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:57:57,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 247 [2019-09-08 04:57:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:57:57,317 INFO L225 Difference]: With dead ends: 63057 [2019-09-08 04:57:57,317 INFO L226 Difference]: Without dead ends: 43337 [2019-09-08 04:57:57,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:57:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43337 states. [2019-09-08 04:57:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43337 to 42922. [2019-09-08 04:57:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42922 states. [2019-09-08 04:57:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42922 states to 42922 states and 69560 transitions. [2019-09-08 04:57:59,587 INFO L78 Accepts]: Start accepts. Automaton has 42922 states and 69560 transitions. Word has length 247 [2019-09-08 04:57:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:57:59,587 INFO L475 AbstractCegarLoop]: Abstraction has 42922 states and 69560 transitions. [2019-09-08 04:57:59,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:57:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 42922 states and 69560 transitions. [2019-09-08 04:57:59,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-08 04:57:59,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:57:59,600 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:57:59,600 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:57:59,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:57:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash 942603229, now seen corresponding path program 1 times [2019-09-08 04:57:59,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:57:59,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:57:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:59,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:57:59,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:57:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:58:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:58:00,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:58:00,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 04:58:00,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 04:58:00,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 04:58:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-09-08 04:58:00,120 INFO L87 Difference]: Start difference. First operand 42922 states and 69560 transitions. Second operand 30 states. [2019-09-08 04:58:03,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:58:03,509 INFO L93 Difference]: Finished difference Result 85936 states and 142271 transitions. [2019-09-08 04:58:03,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 04:58:03,510 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 248 [2019-09-08 04:58:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:58:03,757 INFO L225 Difference]: With dead ends: 85936 [2019-09-08 04:58:03,758 INFO L226 Difference]: Without dead ends: 44835 [2019-09-08 04:58:03,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 04:58:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44835 states. [2019-09-08 04:58:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44835 to 44770. [2019-09-08 04:58:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44770 states. [2019-09-08 04:58:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44770 states to 44770 states and 72030 transitions. [2019-09-08 04:58:05,937 INFO L78 Accepts]: Start accepts. Automaton has 44770 states and 72030 transitions. Word has length 248 [2019-09-08 04:58:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:58:05,938 INFO L475 AbstractCegarLoop]: Abstraction has 44770 states and 72030 transitions. [2019-09-08 04:58:05,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 04:58:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44770 states and 72030 transitions. [2019-09-08 04:58:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-09-08 04:58:05,959 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:58:05,959 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:58:05,960 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:58:05,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:58:05,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1467293855, now seen corresponding path program 1 times [2019-09-08 04:58:05,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:58:05,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:58:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:05,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:58:05,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:58:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:58:06,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:58:06,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:58:06,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:58:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:58:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:58:06,178 INFO L87 Difference]: Start difference. First operand 44770 states and 72030 transitions. Second operand 8 states. [2019-09-08 04:58:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:58:19,049 INFO L93 Difference]: Finished difference Result 178309 states and 321896 transitions. [2019-09-08 04:58:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:58:19,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 279 [2019-09-08 04:58:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:58:19,752 INFO L225 Difference]: With dead ends: 178309 [2019-09-08 04:58:19,753 INFO L226 Difference]: Without dead ends: 135360 [2019-09-08 04:58:19,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:58:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135360 states. [2019-09-08 04:58:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135360 to 135154. [2019-09-08 04:58:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135154 states. [2019-09-08 04:58:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135154 states to 135154 states and 235378 transitions. [2019-09-08 04:58:29,802 INFO L78 Accepts]: Start accepts. Automaton has 135154 states and 235378 transitions. Word has length 279 [2019-09-08 04:58:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:58:29,802 INFO L475 AbstractCegarLoop]: Abstraction has 135154 states and 235378 transitions. [2019-09-08 04:58:29,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:58:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 135154 states and 235378 transitions. [2019-09-08 04:58:29,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-08 04:58:29,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:58:29,856 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:58:29,856 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:58:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:58:29,856 INFO L82 PathProgramCache]: Analyzing trace with hash -482687476, now seen corresponding path program 1 times [2019-09-08 04:58:29,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:58:29,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:58:29,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:29,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:58:29,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:58:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:58:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:58:30,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 04:58:30,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 04:58:30,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 04:58:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:58:30,360 INFO L87 Difference]: Start difference. First operand 135154 states and 235378 transitions. Second operand 24 states. [2019-09-08 04:58:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:58:38,394 INFO L93 Difference]: Finished difference Result 255797 states and 443895 transitions. [2019-09-08 04:58:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 04:58:38,395 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 280 [2019-09-08 04:58:38,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:58:38,940 INFO L225 Difference]: With dead ends: 255797 [2019-09-08 04:58:38,940 INFO L226 Difference]: Without dead ends: 125520 [2019-09-08 04:58:39,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=1037, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 04:58:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125520 states. [2019-09-08 04:58:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125520 to 123947. [2019-09-08 04:58:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123947 states. [2019-09-08 04:58:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123947 states to 123947 states and 207955 transitions. [2019-09-08 04:58:50,427 INFO L78 Accepts]: Start accepts. Automaton has 123947 states and 207955 transitions. Word has length 280 [2019-09-08 04:58:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:58:50,427 INFO L475 AbstractCegarLoop]: Abstraction has 123947 states and 207955 transitions. [2019-09-08 04:58:50,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 04:58:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123947 states and 207955 transitions. [2019-09-08 04:58:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 04:58:50,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:58:50,468 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:58:50,469 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:58:50,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:58:50,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1625529213, now seen corresponding path program 1 times [2019-09-08 04:58:50,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:58:50,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:58:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:50,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:58:50,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:58:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:58:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-08 04:58:50,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:58:50,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:58:50,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:58:50,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:58:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:58:50,655 INFO L87 Difference]: Start difference. First operand 123947 states and 207955 transitions. Second operand 8 states. [2019-09-08 04:59:01,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:01,888 INFO L93 Difference]: Finished difference Result 375304 states and 658483 transitions. [2019-09-08 04:59:01,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:59:01,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 289 [2019-09-08 04:59:01,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:03,102 INFO L225 Difference]: With dead ends: 375304 [2019-09-08 04:59:03,102 INFO L226 Difference]: Without dead ends: 255509 [2019-09-08 04:59:03,452 INFO L628 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-09-08 04:59:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255509 states. [2019-09-08 04:59:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255509 to 254946. [2019-09-08 04:59:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254946 states. [2019-09-08 04:59:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254946 states to 254946 states and 443028 transitions. [2019-09-08 04:59:25,601 INFO L78 Accepts]: Start accepts. Automaton has 254946 states and 443028 transitions. Word has length 289 [2019-09-08 04:59:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:59:25,602 INFO L475 AbstractCegarLoop]: Abstraction has 254946 states and 443028 transitions. [2019-09-08 04:59:25,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:59:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 254946 states and 443028 transitions. [2019-09-08 04:59:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 04:59:25,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:59:25,668 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:59:25,669 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:59:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:59:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1417574061, now seen corresponding path program 1 times [2019-09-08 04:59:25,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:59:25,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:59:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:59:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:59:25,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:59:25,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:59:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:59:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:59:26,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 3401 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 04:59:26,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:59:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:59:26,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 04:59:26,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 17 [2019-09-08 04:59:26,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:59:26,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:59:26,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:59:26,579 INFO L87 Difference]: Start difference. First operand 254946 states and 443028 transitions. Second operand 17 states. [2019-09-08 04:59:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:59:45,097 INFO L93 Difference]: Finished difference Result 513672 states and 943261 transitions. [2019-09-08 04:59:45,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 04:59:45,097 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 297 [2019-09-08 04:59:45,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:59:46,376 INFO L225 Difference]: With dead ends: 513672 [2019-09-08 04:59:46,376 INFO L226 Difference]: Without dead ends: 260359 [2019-09-08 04:59:48,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2019-09-08 04:59:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260359 states. [2019-09-08 05:00:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260359 to 255038. [2019-09-08 05:00:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255038 states. [2019-09-08 05:00:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255038 states to 255038 states and 443176 transitions. [2019-09-08 05:00:15,625 INFO L78 Accepts]: Start accepts. Automaton has 255038 states and 443176 transitions. Word has length 297 [2019-09-08 05:00:15,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:15,625 INFO L475 AbstractCegarLoop]: Abstraction has 255038 states and 443176 transitions. [2019-09-08 05:00:15,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 05:00:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 255038 states and 443176 transitions. [2019-09-08 05:00:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-08 05:00:15,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:15,699 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:15,699 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:15,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1831827569, now seen corresponding path program 1 times [2019-09-08 05:00:15,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:15,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:00:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:15,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:00:15,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:00:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:00:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:15,837 INFO L87 Difference]: Start difference. First operand 255038 states and 443176 transitions. Second operand 3 states. [2019-09-08 05:00:32,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:00:32,416 INFO L93 Difference]: Finished difference Result 510481 states and 887210 transitions. [2019-09-08 05:00:32,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:00:32,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-08 05:00:32,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:00:33,652 INFO L225 Difference]: With dead ends: 510481 [2019-09-08 05:00:33,653 INFO L226 Difference]: Without dead ends: 255556 [2019-09-08 05:00:35,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:00:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255556 states. [2019-09-08 05:00:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255556 to 255550. [2019-09-08 05:00:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255550 states. [2019-09-08 05:00:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255550 states to 255550 states and 444149 transitions. [2019-09-08 05:00:56,884 INFO L78 Accepts]: Start accepts. Automaton has 255550 states and 444149 transitions. Word has length 303 [2019-09-08 05:00:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:00:56,885 INFO L475 AbstractCegarLoop]: Abstraction has 255550 states and 444149 transitions. [2019-09-08 05:00:56,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:00:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 255550 states and 444149 transitions. [2019-09-08 05:00:56,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-09-08 05:00:56,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:00:56,970 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:00:56,970 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:00:56,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:00:56,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1567836179, now seen corresponding path program 1 times [2019-09-08 05:00:56,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:00:56,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:00:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:56,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:00:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:00:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:00:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:00:58,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:00:58,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:00:58,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:00:58,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:00:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:00:58,383 INFO L87 Difference]: Start difference. First operand 255550 states and 444149 transitions. Second operand 6 states. [2019-09-08 05:01:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:16,504 INFO L93 Difference]: Finished difference Result 510923 states and 888054 transitions. [2019-09-08 05:01:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:01:16,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 304 [2019-09-08 05:01:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:17,820 INFO L225 Difference]: With dead ends: 510923 [2019-09-08 05:01:17,820 INFO L226 Difference]: Without dead ends: 255556 [2019-09-08 05:01:25,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:01:25,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255556 states. [2019-09-08 05:01:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255556 to 255550. [2019-09-08 05:01:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255550 states. [2019-09-08 05:01:39,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255550 states to 255550 states and 444137 transitions. [2019-09-08 05:01:39,099 INFO L78 Accepts]: Start accepts. Automaton has 255550 states and 444137 transitions. Word has length 304 [2019-09-08 05:01:39,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:01:39,100 INFO L475 AbstractCegarLoop]: Abstraction has 255550 states and 444137 transitions. [2019-09-08 05:01:39,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:01:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 255550 states and 444137 transitions. [2019-09-08 05:01:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-08 05:01:39,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:01:39,183 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:01:39,183 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:01:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:01:39,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1824820190, now seen corresponding path program 1 times [2019-09-08 05:01:39,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:01:39,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:01:39,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:39,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:01:39,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:01:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:01:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:01:39,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:01:39,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:01:39,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:01:39,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:01:39,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:39,341 INFO L87 Difference]: Start difference. First operand 255550 states and 444137 transitions. Second operand 3 states. [2019-09-08 05:01:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:01:56,360 INFO L93 Difference]: Finished difference Result 511949 states and 889988 transitions. [2019-09-08 05:01:56,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:01:56,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-09-08 05:01:56,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:01:58,438 INFO L225 Difference]: With dead ends: 511949 [2019-09-08 05:01:58,439 INFO L226 Difference]: Without dead ends: 256518 [2019-09-08 05:01:59,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:01:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256518 states. [2019-09-08 05:02:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256518 to 256512. [2019-09-08 05:02:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256512 states. [2019-09-08 05:02:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256512 states to 256512 states and 445962 transitions. [2019-09-08 05:02:22,976 INFO L78 Accepts]: Start accepts. Automaton has 256512 states and 445962 transitions. Word has length 297 [2019-09-08 05:02:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:02:22,976 INFO L475 AbstractCegarLoop]: Abstraction has 256512 states and 445962 transitions. [2019-09-08 05:02:22,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:02:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 256512 states and 445962 transitions. [2019-09-08 05:02:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-09-08 05:02:24,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:02:24,263 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:02:24,263 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:02:24,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:02:24,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1868528337, now seen corresponding path program 1 times [2019-09-08 05:02:24,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:02:24,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:02:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:24,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:02:24,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:02:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:02:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:02:24,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:02:24,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:02:24,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:02:24,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:02:24,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:02:24,426 INFO L87 Difference]: Start difference. First operand 256512 states and 445962 transitions. Second operand 3 states. [2019-09-08 05:02:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:02:43,097 INFO L93 Difference]: Finished difference Result 514760 states and 895238 transitions. [2019-09-08 05:02:43,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:02:43,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-09-08 05:02:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:02:44,473 INFO L225 Difference]: With dead ends: 514760 [2019-09-08 05:02:44,473 INFO L226 Difference]: Without dead ends: 258378 [2019-09-08 05:02:45,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:02:45,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258378 states. [2019-09-08 05:02:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258378 to 258372. [2019-09-08 05:02:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258372 states. [2019-09-08 05:03:00,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258372 states to 258372 states and 449381 transitions. [2019-09-08 05:03:00,171 INFO L78 Accepts]: Start accepts. Automaton has 258372 states and 449381 transitions. Word has length 305 [2019-09-08 05:03:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:03:00,171 INFO L475 AbstractCegarLoop]: Abstraction has 258372 states and 449381 transitions. [2019-09-08 05:03:00,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:03:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 258372 states and 449381 transitions. [2019-09-08 05:03:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-08 05:03:00,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:03:00,271 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:03:00,271 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:03:00,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:03:00,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1698715618, now seen corresponding path program 1 times [2019-09-08 05:03:00,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:03:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:03:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:00,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:03:00,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:03:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:03:00,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:03:00,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:03:00,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:03:00,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:03:00,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:03:00,431 INFO L87 Difference]: Start difference. First operand 258372 states and 449381 transitions. Second operand 3 states. [2019-09-08 05:03:17,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:03:17,915 INFO L93 Difference]: Finished difference Result 520163 states and 905120 transitions. [2019-09-08 05:03:17,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:03:17,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 299 [2019-09-08 05:03:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:03:19,205 INFO L225 Difference]: With dead ends: 520163 [2019-09-08 05:03:19,205 INFO L226 Difference]: Without dead ends: 261942 [2019-09-08 05:03:19,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:03:20,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261942 states. [2019-09-08 05:03:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261942 to 261936. [2019-09-08 05:03:40,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261936 states. [2019-09-08 05:03:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261936 states to 261936 states and 455824 transitions. [2019-09-08 05:03:41,876 INFO L78 Accepts]: Start accepts. Automaton has 261936 states and 455824 transitions. Word has length 299 [2019-09-08 05:03:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:03:41,876 INFO L475 AbstractCegarLoop]: Abstraction has 261936 states and 455824 transitions. [2019-09-08 05:03:41,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:03:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 261936 states and 455824 transitions. [2019-09-08 05:03:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-09-08 05:03:43,620 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:03:43,620 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:03:43,621 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:03:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:03:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1303448403, now seen corresponding path program 1 times [2019-09-08 05:03:43,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:03:43,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:03:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:43,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:03:43,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:03:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:03:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:03:43,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:03:43,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:03:43,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:03:43,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:03:43,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:03:43,761 INFO L87 Difference]: Start difference. First operand 261936 states and 455824 transitions. Second operand 3 states. [2019-09-08 05:04:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:03,246 INFO L93 Difference]: Finished difference Result 530529 states and 924122 transitions. [2019-09-08 05:04:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:04:03,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-09-08 05:04:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:04,574 INFO L225 Difference]: With dead ends: 530529 [2019-09-08 05:04:04,574 INFO L226 Difference]: Without dead ends: 268760 [2019-09-08 05:04:05,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:04:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268760 states. [2019-09-08 05:04:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268760 to 268754. [2019-09-08 05:04:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268754 states. [2019-09-08 05:04:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268754 states to 268754 states and 468305 transitions. [2019-09-08 05:04:19,972 INFO L78 Accepts]: Start accepts. Automaton has 268754 states and 468305 transitions. Word has length 300 [2019-09-08 05:04:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:19,972 INFO L475 AbstractCegarLoop]: Abstraction has 268754 states and 468305 transitions. [2019-09-08 05:04:19,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:04:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 268754 states and 468305 transitions. [2019-09-08 05:04:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-09-08 05:04:20,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:20,107 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:20,107 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1044794462, now seen corresponding path program 1 times [2019-09-08 05:04:20,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:20,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:20,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:20,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:04:21,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:04:21,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:04:21,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:04:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:04:21,757 INFO L87 Difference]: Start difference. First operand 268754 states and 468305 transitions. Second operand 3 states. [2019-09-08 05:04:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:41,131 INFO L93 Difference]: Finished difference Result 550399 states and 960596 transitions. [2019-09-08 05:04:41,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:04:41,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 301 [2019-09-08 05:04:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:42,488 INFO L225 Difference]: With dead ends: 550399 [2019-09-08 05:04:42,488 INFO L226 Difference]: Without dead ends: 281818 [2019-09-08 05:04:43,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:04:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281818 states. [2019-09-08 05:04:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281818 to 281812. [2019-09-08 05:04:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281812 states. [2019-09-08 05:04:59,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281812 states to 281812 states and 492114 transitions. [2019-09-08 05:04:59,522 INFO L78 Accepts]: Start accepts. Automaton has 281812 states and 492114 transitions. Word has length 301 [2019-09-08 05:04:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:59,523 INFO L475 AbstractCegarLoop]: Abstraction has 281812 states and 492114 transitions. [2019-09-08 05:04:59,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:04:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 281812 states and 492114 transitions. [2019-09-08 05:04:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-08 05:04:59,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:59,711 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:59,712 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:59,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1255439445, now seen corresponding path program 1 times [2019-09-08 05:04:59,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:59,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:59,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 05:05:00,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:05:00,093 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:05:00,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:05:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:00,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 3444 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:05:00,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:05:00,767 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 05:05:00,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:05:00,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 5] total 26 [2019-09-08 05:05:00,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:05:00,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:05:00,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:05:00,786 INFO L87 Difference]: Start difference. First operand 281812 states and 492114 transitions. Second operand 26 states. [2019-09-08 05:05:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:05:27,464 INFO L93 Difference]: Finished difference Result 559682 states and 1031225 transitions. [2019-09-08 05:05:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 05:05:27,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 308 [2019-09-08 05:05:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:05:29,275 INFO L225 Difference]: With dead ends: 559682 [2019-09-08 05:05:29,275 INFO L226 Difference]: Without dead ends: 306369 [2019-09-08 05:05:31,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 781 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=3673, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 05:05:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306369 states. [2019-09-08 05:05:54,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306369 to 294904. [2019-09-08 05:05:54,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294904 states. [2019-09-08 05:05:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294904 states to 294904 states and 516214 transitions. [2019-09-08 05:05:56,731 INFO L78 Accepts]: Start accepts. Automaton has 294904 states and 516214 transitions. Word has length 308 [2019-09-08 05:05:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:05:56,732 INFO L475 AbstractCegarLoop]: Abstraction has 294904 states and 516214 transitions. [2019-09-08 05:05:56,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:05:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 294904 states and 516214 transitions. [2019-09-08 05:05:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 05:05:58,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:05:58,605 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:05:58,605 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:05:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:05:58,606 INFO L82 PathProgramCache]: Analyzing trace with hash 86451575, now seen corresponding path program 1 times [2019-09-08 05:05:58,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:05:58,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:05:58,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:05:58,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:05:58,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:05:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:05:58,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:05:58,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:05:58,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:05:58,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:05:58,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:05:58,747 INFO L87 Difference]: Start difference. First operand 294904 states and 516214 transitions. Second operand 3 states. [2019-09-08 05:06:22,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:22,241 INFO L93 Difference]: Finished difference Result 613848 states and 1077131 transitions. [2019-09-08 05:06:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:22,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 302 [2019-09-08 05:06:22,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:23,909 INFO L225 Difference]: With dead ends: 613848 [2019-09-08 05:06:23,910 INFO L226 Difference]: Without dead ends: 319993 [2019-09-08 05:06:24,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319993 states. [2019-09-08 05:06:41,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319993 to 319987. [2019-09-08 05:06:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319987 states. [2019-09-08 05:06:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319987 states to 319987 states and 561668 transitions. [2019-09-08 05:06:44,225 INFO L78 Accepts]: Start accepts. Automaton has 319987 states and 561668 transitions. Word has length 302 [2019-09-08 05:06:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:44,226 INFO L475 AbstractCegarLoop]: Abstraction has 319987 states and 561668 transitions. [2019-09-08 05:06:44,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 319987 states and 561668 transitions. [2019-09-08 05:06:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-09-08 05:06:44,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:44,532 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:44,532 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:44,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 860073163, now seen corresponding path program 1 times [2019-09-08 05:06:44,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:44,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:44,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:44,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 05:06:44,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:44,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:44,676 INFO L87 Difference]: Start difference. First operand 319987 states and 561668 transitions. Second operand 3 states.