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_productSimulator.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:13:16,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:13:16,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:13:16,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:13:16,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:13:16,257 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:13:16,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:13:16,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:13:16,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:13:16,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:13:16,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:13:16,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:13:16,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:13:16,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:13:16,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:13:16,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:13:16,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:13:16,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:13:16,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:13:16,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:13:16,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:13:16,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:13:16,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:13:16,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:13:16,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:13:16,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:13:16,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:13:16,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:13:16,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:13:16,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:13:16,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:13:16,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:13:16,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:13:16,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:13:16,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:13:16,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:13:16,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:13:16,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:13:16,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:13:16,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:13:16,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:13:16,295 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-10-02 13:13:16,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:13:16,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:13:16,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:13:16,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:13:16,327 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:13:16,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:13:16,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:13:16,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:13:16,328 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:13:16,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:13:16,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:13:16,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:13:16,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:13:16,329 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:13:16,329 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:13:16,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:13:16,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:13:16,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:13:16,330 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:13:16,330 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:13:16,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:13:16,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:13:16,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:13:16,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:13:16,331 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:13:16,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:13:16,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:13:16,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:13:16,332 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:13:16,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:13:16,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:13:16,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:13:16,378 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:13:16,378 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:13:16,379 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c [2019-10-02 13:13:16,459 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03c46430/39b5cea440ac4bafa44b5f395a8f9514/FLAG51ba5344d [2019-10-02 13:13:17,154 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:13:17,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec27_productSimulator.cil.c [2019-10-02 13:13:17,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03c46430/39b5cea440ac4bafa44b5f395a8f9514/FLAG51ba5344d [2019-10-02 13:13:17,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e03c46430/39b5cea440ac4bafa44b5f395a8f9514 [2019-10-02 13:13:17,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:13:17,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:13:17,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:13:17,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:13:17,340 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:13:17,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:13:17" (1/1) ... [2019-10-02 13:13:17,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7354cb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:17, skipping insertion in model container [2019-10-02 13:13:17,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:13:17" (1/1) ... [2019-10-02 13:13:17,351 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:13:17,444 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:13:18,212 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:13:18,234 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:13:18,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:13:18,549 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:13:18,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18 WrapperNode [2019-10-02 13:13:18,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:13:18,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:13:18,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:13:18,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:13:18,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... [2019-10-02 13:13:18,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:13:18,771 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:13:18,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:13:18,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:13:18,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:13:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:13:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:13:18,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:13:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:13:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:13:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:13:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:13:18,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:13:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:13:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:13:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:13:18,853 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:13:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:13:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:13:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:13:18,854 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:13:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:13:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:13:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:13:18,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:13:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:13:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:13:18,856 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:13:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:13:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:13:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:13:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:13:18,857 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:13:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:13:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:13:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:13:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:13:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:13:18,858 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:13:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:13:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:13:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:13:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:13:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:13:18,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:13:18,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:13:18,860 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:13:18,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:13:18,860 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:13:18,860 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:13:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:13:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:13:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:13:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:13:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:13:18,861 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:13:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:13:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:13:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:13:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:13:18,862 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:13:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:13:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:13:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:13:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:13:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:13:18,863 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:13:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:13:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:13:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:13:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:13:18,864 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:13:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:13:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2019-10-02 13:13:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Encrypt [2019-10-02 13:13:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2019-10-02 13:13:18,865 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__AddressBook [2019-10-02 13:13:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2019-10-02 13:13:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__role__Sign [2019-10-02 13:13:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:13:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:13:18,866 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2019-10-02 13:13:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__AutoResponder [2019-10-02 13:13:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2019-10-02 13:13:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Forward [2019-10-02 13:13:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2019-10-02 13:13:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Verify [2019-10-02 13:13:18,867 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2019-10-02 13:13:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__role__Decrypt [2019-10-02 13:13:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:13:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:13:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:13:18,868 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:13:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:13:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:13:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:13:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:13:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:13:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:13:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:13:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:13:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:13:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:13:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2019-10-02 13:13:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__role__Keys [2019-10-02 13:13:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:13:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2019-10-02 13:13:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__role__Keys [2019-10-02 13:13:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:13:18,871 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2019-10-02 13:13:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__role__Keys [2019-10-02 13:13:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:13:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:13:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:13:18,872 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:13:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:13:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:13:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:13:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:13:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:13:18,873 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:13:18,874 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:13:18,874 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:13:18,874 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:13:18,874 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:13:18,874 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:13:18,874 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:13:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:13:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2019-10-02 13:13:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Encrypt [2019-10-02 13:13:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2019-10-02 13:13:18,875 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Sign [2019-10-02 13:13:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2019-10-02 13:13:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__role__Verify [2019-10-02 13:13:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:13:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2019-10-02 13:13:18,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__role__Encrypt [2019-10-02 13:13:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:13:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:13:18,877 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:13:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:13:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:13:18,877 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:13:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:13:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:13:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:13:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:13:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:13:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:13:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:13:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:13:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:13:18,879 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:13:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:13:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:13:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:13:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:13:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:13:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:13:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:13:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:13:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:13:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:13:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:13:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:13:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:13:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:13:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:13:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:13:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:13:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:13:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:13:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:13:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:13:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:13:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:13:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:13:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:13:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:13:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:13:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:13:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:13:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:13:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:13:18,886 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:13:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:13:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:13:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__VerifyForward_spec__1 [2019-10-02 13:13:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:13:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:13:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:13:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:13:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:13:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:13:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:13:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:13:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:13:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:13:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:13:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:13:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:13:18,891 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:13:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:13:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:13:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:13:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:13:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:13:18,892 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:13:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:13:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:13:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:13:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:13:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:13:18,893 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:13:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:13:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:13:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:13:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:13:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:13:18,894 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:13:18,895 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:13:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2019-10-02 13:13:18,896 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Encrypt [2019-10-02 13:13:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2019-10-02 13:13:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__AddressBook [2019-10-02 13:13:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2019-10-02 13:13:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__role__Sign [2019-10-02 13:13:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2019-10-02 13:13:18,917 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__AutoResponder [2019-10-02 13:13:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2019-10-02 13:13:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Forward [2019-10-02 13:13:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2019-10-02 13:13:18,918 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Verify [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__role__Decrypt [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:13:18,919 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:13:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:13:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:13:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:13:18,920 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2019-10-02 13:13:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__role__Keys [2019-10-02 13:13:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2019-10-02 13:13:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__role__Keys [2019-10-02 13:13:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2019-10-02 13:13:18,932 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__role__Keys [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Encrypt [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Sign [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__role__Verify [2019-10-02 13:13:18,933 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2019-10-02 13:13:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__role__Encrypt [2019-10-02 13:13:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:13:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:13:18,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:13:21,246 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:13:21,247 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:13:21,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:13:21 BoogieIcfgContainer [2019-10-02 13:13:21,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:13:21,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:13:21,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:13:21,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:13:21,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:13:17" (1/3) ... [2019-10-02 13:13:21,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266b372c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:13:21, skipping insertion in model container [2019-10-02 13:13:21,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:13:18" (2/3) ... [2019-10-02 13:13:21,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@266b372c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:13:21, skipping insertion in model container [2019-10-02 13:13:21,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:13:21" (3/3) ... [2019-10-02 13:13:21,259 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec27_productSimulator.cil.c [2019-10-02 13:13:21,269 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:13:21,282 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:13:21,301 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:13:21,351 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:13:21,352 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:13:21,352 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:13:21,352 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:13:21,352 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:13:21,352 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:13:21,352 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:13:21,353 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:13:21,353 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:13:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states. [2019-10-02 13:13:21,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 13:13:21,438 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:21,439 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:21,442 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1302396452, now seen corresponding path program 1 times [2019-10-02 13:13:21,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:21,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:21,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:21,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:13:22,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:22,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:13:22,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:13:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:13:22,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:13:22,324 INFO L87 Difference]: Start difference. First operand 816 states. Second operand 6 states. [2019-10-02 13:13:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:22,565 INFO L93 Difference]: Finished difference Result 1550 states and 2157 transitions. [2019-10-02 13:13:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:13:22,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 205 [2019-10-02 13:13:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:22,606 INFO L225 Difference]: With dead ends: 1550 [2019-10-02 13:13:22,606 INFO L226 Difference]: Without dead ends: 787 [2019-10-02 13:13:22,622 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2019-10-02 13:13:22,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2019-10-02 13:13:22,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2019-10-02 13:13:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1072 transitions. [2019-10-02 13:13:22,759 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1072 transitions. Word has length 205 [2019-10-02 13:13:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:22,761 INFO L475 AbstractCegarLoop]: Abstraction has 787 states and 1072 transitions. [2019-10-02 13:13:22,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:13:22,761 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1072 transitions. [2019-10-02 13:13:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 13:13:22,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:22,772 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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] [2019-10-02 13:13:22,773 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 988197411, now seen corresponding path program 1 times [2019-10-02 13:13:22,773 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:22,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:13:23,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:23,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:13:23,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:13:23,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:13:23,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:13:23,040 INFO L87 Difference]: Start difference. First operand 787 states and 1072 transitions. Second operand 4 states. [2019-10-02 13:13:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:23,825 INFO L93 Difference]: Finished difference Result 1531 states and 2109 transitions. [2019-10-02 13:13:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:13:23,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 211 [2019-10-02 13:13:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:23,833 INFO L225 Difference]: With dead ends: 1531 [2019-10-02 13:13:23,833 INFO L226 Difference]: Without dead ends: 788 [2019-10-02 13:13:23,836 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:13:23,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-10-02 13:13:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2019-10-02 13:13:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-10-02 13:13:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1067 transitions. [2019-10-02 13:13:23,882 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1067 transitions. Word has length 211 [2019-10-02 13:13:23,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:23,886 INFO L475 AbstractCegarLoop]: Abstraction has 788 states and 1067 transitions. [2019-10-02 13:13:23,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:13:23,887 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1067 transitions. [2019-10-02 13:13:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:13:23,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:23,898 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:23,898 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:23,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1021601412, now seen corresponding path program 1 times [2019-10-02 13:13:23,899 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:23,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:23,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:23,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:13:24,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:24,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:24,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:24,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:24,232 INFO L87 Difference]: Start difference. First operand 788 states and 1067 transitions. Second operand 3 states. [2019-10-02 13:13:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:24,384 INFO L93 Difference]: Finished difference Result 2240 states and 3094 transitions. [2019-10-02 13:13:24,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:24,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-02 13:13:24,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:24,395 INFO L225 Difference]: With dead ends: 2240 [2019-10-02 13:13:24,395 INFO L226 Difference]: Without dead ends: 1497 [2019-10-02 13:13:24,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-10-02 13:13:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1494. [2019-10-02 13:13:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-10-02 13:13:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 2049 transitions. [2019-10-02 13:13:24,503 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 2049 transitions. Word has length 230 [2019-10-02 13:13:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:24,503 INFO L475 AbstractCegarLoop]: Abstraction has 1494 states and 2049 transitions. [2019-10-02 13:13:24,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 2049 transitions. [2019-10-02 13:13:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:13:24,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:24,513 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:24,513 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash 83138754, now seen corresponding path program 1 times [2019-10-02 13:13:24,514 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:24,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:24,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:13:24,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:24,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:24,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:24,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:24,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:24,742 INFO L87 Difference]: Start difference. First operand 1494 states and 2049 transitions. Second operand 3 states. [2019-10-02 13:13:24,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:24,946 INFO L93 Difference]: Finished difference Result 1497 states and 2051 transitions. [2019-10-02 13:13:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:24,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 13:13:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:24,952 INFO L225 Difference]: With dead ends: 1497 [2019-10-02 13:13:24,952 INFO L226 Difference]: Without dead ends: 789 [2019-10-02 13:13:24,954 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:24,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-02 13:13:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2019-10-02 13:13:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-02 13:13:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1061 transitions. [2019-10-02 13:13:25,081 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1061 transitions. Word has length 231 [2019-10-02 13:13:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:25,081 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1061 transitions. [2019-10-02 13:13:25,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1061 transitions. [2019-10-02 13:13:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 13:13:25,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:25,087 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 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] [2019-10-02 13:13:25,088 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash -575856261, now seen corresponding path program 1 times [2019-10-02 13:13:25,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:25,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:25,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 13:13:25,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:25,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:13:25,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:13:25,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:13:25,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:13:25,285 INFO L87 Difference]: Start difference. First operand 789 states and 1061 transitions. Second operand 4 states. [2019-10-02 13:13:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:26,020 INFO L93 Difference]: Finished difference Result 1515 states and 2046 transitions. [2019-10-02 13:13:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:13:26,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 245 [2019-10-02 13:13:26,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:26,028 INFO L225 Difference]: With dead ends: 1515 [2019-10-02 13:13:26,028 INFO L226 Difference]: Without dead ends: 795 [2019-10-02 13:13:26,032 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:13:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-10-02 13:13:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 789. [2019-10-02 13:13:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-02 13:13:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1046 transitions. [2019-10-02 13:13:26,084 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1046 transitions. Word has length 245 [2019-10-02 13:13:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:26,084 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1046 transitions. [2019-10-02 13:13:26,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:13:26,085 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1046 transitions. [2019-10-02 13:13:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-02 13:13:26,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:26,092 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:13:26,092 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:26,093 INFO L82 PathProgramCache]: Analyzing trace with hash 218526341, now seen corresponding path program 1 times [2019-10-02 13:13:26,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:26,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:26,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:26,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:26,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:13:26,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:26,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:26,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:26,416 INFO L87 Difference]: Start difference. First operand 789 states and 1046 transitions. Second operand 3 states. [2019-10-02 13:13:26,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:26,466 INFO L93 Difference]: Finished difference Result 1225 states and 1607 transitions. [2019-10-02 13:13:26,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:26,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-10-02 13:13:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:26,471 INFO L225 Difference]: With dead ends: 1225 [2019-10-02 13:13:26,472 INFO L226 Difference]: Without dead ends: 792 [2019-10-02 13:13:26,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-10-02 13:13:26,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 791. [2019-10-02 13:13:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-02 13:13:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1048 transitions. [2019-10-02 13:13:26,511 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1048 transitions. Word has length 272 [2019-10-02 13:13:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:26,511 INFO L475 AbstractCegarLoop]: Abstraction has 791 states and 1048 transitions. [2019-10-02 13:13:26,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1048 transitions. [2019-10-02 13:13:26,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 13:13:26,518 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:26,518 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:13:26,518 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:26,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:26,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1200585663, now seen corresponding path program 1 times [2019-10-02 13:13:26,519 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:26,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:13:26,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:26,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:26,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:26,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:26,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:26,764 INFO L87 Difference]: Start difference. First operand 791 states and 1048 transitions. Second operand 3 states. [2019-10-02 13:13:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:26,824 INFO L93 Difference]: Finished difference Result 1514 states and 2048 transitions. [2019-10-02 13:13:26,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:26,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-10-02 13:13:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:26,830 INFO L225 Difference]: With dead ends: 1514 [2019-10-02 13:13:26,831 INFO L226 Difference]: Without dead ends: 846 [2019-10-02 13:13:26,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-02 13:13:26,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 845. [2019-10-02 13:13:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-10-02 13:13:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1136 transitions. [2019-10-02 13:13:26,887 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1136 transitions. Word has length 280 [2019-10-02 13:13:26,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:26,888 INFO L475 AbstractCegarLoop]: Abstraction has 845 states and 1136 transitions. [2019-10-02 13:13:26,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1136 transitions. [2019-10-02 13:13:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 13:13:26,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:26,948 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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-10-02 13:13:26,949 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash -398027279, now seen corresponding path program 1 times [2019-10-02 13:13:26,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:26,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:26,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:26,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:27,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:27,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 13:13:27,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 13:13:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 13:13:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:13:27,236 INFO L87 Difference]: Start difference. First operand 845 states and 1136 transitions. Second operand 9 states. [2019-10-02 13:13:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:27,574 INFO L93 Difference]: Finished difference Result 1285 states and 1726 transitions. [2019-10-02 13:13:27,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:13:27,574 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 281 [2019-10-02 13:13:27,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:27,580 INFO L225 Difference]: With dead ends: 1285 [2019-10-02 13:13:27,580 INFO L226 Difference]: Without dead ends: 865 [2019-10-02 13:13:27,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:13:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-10-02 13:13:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 849. [2019-10-02 13:13:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-10-02 13:13:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1141 transitions. [2019-10-02 13:13:27,622 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1141 transitions. Word has length 281 [2019-10-02 13:13:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:27,623 INFO L475 AbstractCegarLoop]: Abstraction has 849 states and 1141 transitions. [2019-10-02 13:13:27,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 13:13:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1141 transitions. [2019-10-02 13:13:27,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 13:13:27,630 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:27,630 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:13:27,631 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash 308695699, now seen corresponding path program 1 times [2019-10-02 13:13:27,631 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:27,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:27,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:27,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:27,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:27,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:27,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 13:13:27,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 13:13:27,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 13:13:27,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:13:27,880 INFO L87 Difference]: Start difference. First operand 849 states and 1141 transitions. Second operand 4 states. [2019-10-02 13:13:29,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:29,208 INFO L93 Difference]: Finished difference Result 2414 states and 3318 transitions. [2019-10-02 13:13:29,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 13:13:29,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-10-02 13:13:29,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:29,232 INFO L225 Difference]: With dead ends: 2414 [2019-10-02 13:13:29,232 INFO L226 Difference]: Without dead ends: 1611 [2019-10-02 13:13:29,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 13:13:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2019-10-02 13:13:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1608. [2019-10-02 13:13:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-10-02 13:13:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2160 transitions. [2019-10-02 13:13:29,346 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2160 transitions. Word has length 288 [2019-10-02 13:13:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:29,347 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2160 transitions. [2019-10-02 13:13:29,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 13:13:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2160 transitions. [2019-10-02 13:13:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 13:13:29,354 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:29,355 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:13:29,355 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:29,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:29,356 INFO L82 PathProgramCache]: Analyzing trace with hash -803792840, now seen corresponding path program 1 times [2019-10-02 13:13:29,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:29,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:29,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:29,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:29,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:29,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:13:29,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:13:29,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:13:29,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:13:29,695 INFO L87 Difference]: Start difference. First operand 1608 states and 2160 transitions. Second operand 7 states. [2019-10-02 13:13:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:33,891 INFO L93 Difference]: Finished difference Result 3296 states and 4396 transitions. [2019-10-02 13:13:33,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:13:33,892 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 288 [2019-10-02 13:13:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:33,911 INFO L225 Difference]: With dead ends: 3296 [2019-10-02 13:13:33,911 INFO L226 Difference]: Without dead ends: 2478 [2019-10-02 13:13:33,915 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 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-10-02 13:13:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2019-10-02 13:13:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2463. [2019-10-02 13:13:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-10-02 13:13:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3274 transitions. [2019-10-02 13:13:34,064 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3274 transitions. Word has length 288 [2019-10-02 13:13:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:34,066 INFO L475 AbstractCegarLoop]: Abstraction has 2463 states and 3274 transitions. [2019-10-02 13:13:34,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:13:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3274 transitions. [2019-10-02 13:13:34,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 13:13:34,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:34,073 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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-10-02 13:13:34,073 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:34,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:34,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1576359952, now seen corresponding path program 1 times [2019-10-02 13:13:34,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:34,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:34,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:34,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:34,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:35,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:35,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-10-02 13:13:35,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 13:13:35,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 13:13:35,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 13:13:35,028 INFO L87 Difference]: Start difference. First operand 2463 states and 3274 transitions. Second operand 36 states. [2019-10-02 13:13:36,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:36,509 INFO L93 Difference]: Finished difference Result 3431 states and 4533 transitions. [2019-10-02 13:13:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 13:13:36,509 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 289 [2019-10-02 13:13:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:36,527 INFO L225 Difference]: With dead ends: 3431 [2019-10-02 13:13:36,528 INFO L226 Difference]: Without dead ends: 2605 [2019-10-02 13:13:36,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:13:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2019-10-02 13:13:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2600. [2019-10-02 13:13:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2019-10-02 13:13:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3437 transitions. [2019-10-02 13:13:36,677 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3437 transitions. Word has length 289 [2019-10-02 13:13:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:36,678 INFO L475 AbstractCegarLoop]: Abstraction has 2600 states and 3437 transitions. [2019-10-02 13:13:36,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 13:13:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3437 transitions. [2019-10-02 13:13:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:13:36,685 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:36,685 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:36,686 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1491044311, now seen corresponding path program 1 times [2019-10-02 13:13:36,686 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:36,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:36,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:36,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:36,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 13:13:36,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:36,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:36,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:36,978 INFO L87 Difference]: Start difference. First operand 2600 states and 3437 transitions. Second operand 3 states. [2019-10-02 13:13:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:37,120 INFO L93 Difference]: Finished difference Result 5416 states and 7190 transitions. [2019-10-02 13:13:37,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:37,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-02 13:13:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:37,144 INFO L225 Difference]: With dead ends: 5416 [2019-10-02 13:13:37,144 INFO L226 Difference]: Without dead ends: 3734 [2019-10-02 13:13:37,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2019-10-02 13:13:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3731. [2019-10-02 13:13:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2019-10-02 13:13:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4959 transitions. [2019-10-02 13:13:37,385 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4959 transitions. Word has length 298 [2019-10-02 13:13:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:37,386 INFO L475 AbstractCegarLoop]: Abstraction has 3731 states and 4959 transitions. [2019-10-02 13:13:37,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4959 transitions. [2019-10-02 13:13:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 13:13:37,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:37,396 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-10-02 13:13:37,397 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 698994677, now seen corresponding path program 1 times [2019-10-02 13:13:37,397 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:37,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:37,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:37,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:38,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:38,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-02 13:13:38,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 13:13:38,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 13:13:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 13:13:38,434 INFO L87 Difference]: Start difference. First operand 3731 states and 4959 transitions. Second operand 38 states. [2019-10-02 13:13:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:40,144 INFO L93 Difference]: Finished difference Result 4705 states and 6265 transitions. [2019-10-02 13:13:40,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:13:40,145 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 298 [2019-10-02 13:13:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:40,174 INFO L225 Difference]: With dead ends: 4705 [2019-10-02 13:13:40,174 INFO L226 Difference]: Without dead ends: 3965 [2019-10-02 13:13:40,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:13:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2019-10-02 13:13:40,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3944. [2019-10-02 13:13:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2019-10-02 13:13:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5237 transitions. [2019-10-02 13:13:40,378 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5237 transitions. Word has length 298 [2019-10-02 13:13:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:40,379 INFO L475 AbstractCegarLoop]: Abstraction has 3944 states and 5237 transitions. [2019-10-02 13:13:40,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 13:13:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5237 transitions. [2019-10-02 13:13:40,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 13:13:40,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:40,388 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2019-10-02 13:13:40,388 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:40,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:40,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1199145277, now seen corresponding path program 1 times [2019-10-02 13:13:40,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:40,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:40,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:40,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:40,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:41,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:41,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-02 13:13:41,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 13:13:41,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 13:13:41,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:13:41,584 INFO L87 Difference]: Start difference. First operand 3944 states and 5237 transitions. Second operand 40 states. [2019-10-02 13:13:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:43,290 INFO L93 Difference]: Finished difference Result 4916 states and 6499 transitions. [2019-10-02 13:13:43,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 13:13:43,291 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 300 [2019-10-02 13:13:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:43,315 INFO L225 Difference]: With dead ends: 4916 [2019-10-02 13:13:43,316 INFO L226 Difference]: Without dead ends: 4018 [2019-10-02 13:13:43,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 13:13:43,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4018 states. [2019-10-02 13:13:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4018 to 4009. [2019-10-02 13:13:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4009 states. [2019-10-02 13:13:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5318 transitions. [2019-10-02 13:13:43,538 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5318 transitions. Word has length 300 [2019-10-02 13:13:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:43,539 INFO L475 AbstractCegarLoop]: Abstraction has 4009 states and 5318 transitions. [2019-10-02 13:13:43,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 13:13:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5318 transitions. [2019-10-02 13:13:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-10-02 13:13:43,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:43,551 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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-10-02 13:13:43,551 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:43,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:43,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1584122911, now seen corresponding path program 1 times [2019-10-02 13:13:43,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:43,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:43,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:43,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:43,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:13:43,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:43,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:43,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:43,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:43,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:43,849 INFO L87 Difference]: Start difference. First operand 4009 states and 5318 transitions. Second operand 3 states. [2019-10-02 13:13:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:44,127 INFO L93 Difference]: Finished difference Result 11186 states and 15552 transitions. [2019-10-02 13:13:44,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:44,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 291 [2019-10-02 13:13:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:44,193 INFO L225 Difference]: With dead ends: 11186 [2019-10-02 13:13:44,193 INFO L226 Difference]: Without dead ends: 7455 [2019-10-02 13:13:44,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2019-10-02 13:13:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7448. [2019-10-02 13:13:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7448 states. [2019-10-02 13:13:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7448 states to 7448 states and 10201 transitions. [2019-10-02 13:13:44,601 INFO L78 Accepts]: Start accepts. Automaton has 7448 states and 10201 transitions. Word has length 291 [2019-10-02 13:13:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:44,602 INFO L475 AbstractCegarLoop]: Abstraction has 7448 states and 10201 transitions. [2019-10-02 13:13:44,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 7448 states and 10201 transitions. [2019-10-02 13:13:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 13:13:44,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:44,618 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:44,619 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:44,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash 637453276, now seen corresponding path program 1 times [2019-10-02 13:13:44,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:44,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:44,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:13:44,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:44,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:44,825 INFO L87 Difference]: Start difference. First operand 7448 states and 10201 transitions. Second operand 3 states. [2019-10-02 13:13:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:45,149 INFO L93 Difference]: Finished difference Result 15245 states and 21113 transitions. [2019-10-02 13:13:45,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:45,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-10-02 13:13:45,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:45,194 INFO L225 Difference]: With dead ends: 15245 [2019-10-02 13:13:45,195 INFO L226 Difference]: Without dead ends: 8078 [2019-10-02 13:13:45,218 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8078 states. [2019-10-02 13:13:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8078 to 8072. [2019-10-02 13:13:45,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-10-02 13:13:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 11203 transitions. [2019-10-02 13:13:45,575 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 11203 transitions. Word has length 304 [2019-10-02 13:13:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:45,576 INFO L475 AbstractCegarLoop]: Abstraction has 8072 states and 11203 transitions. [2019-10-02 13:13:45,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 11203 transitions. [2019-10-02 13:13:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-10-02 13:13:45,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:45,595 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:45,595 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:45,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:45,596 INFO L82 PathProgramCache]: Analyzing trace with hash 905269746, now seen corresponding path program 1 times [2019-10-02 13:13:45,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:45,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:45,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:45,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 13:13:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:45,794 INFO L87 Difference]: Start difference. First operand 8072 states and 11203 transitions. Second operand 3 states. [2019-10-02 13:13:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:46,039 INFO L93 Difference]: Finished difference Result 17063 states and 24041 transitions. [2019-10-02 13:13:46,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:46,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 305 [2019-10-02 13:13:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:46,083 INFO L225 Difference]: With dead ends: 17063 [2019-10-02 13:13:46,083 INFO L226 Difference]: Without dead ends: 9272 [2019-10-02 13:13:46,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9272 states. [2019-10-02 13:13:46,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9272 to 9266. [2019-10-02 13:13:46,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9266 states. [2019-10-02 13:13:46,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9266 states to 9266 states and 13117 transitions. [2019-10-02 13:13:46,546 INFO L78 Accepts]: Start accepts. Automaton has 9266 states and 13117 transitions. Word has length 305 [2019-10-02 13:13:46,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:46,547 INFO L475 AbstractCegarLoop]: Abstraction has 9266 states and 13117 transitions. [2019-10-02 13:13:46,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 9266 states and 13117 transitions. [2019-10-02 13:13:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 13:13:46,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:46,575 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:46,576 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:46,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:46,576 INFO L82 PathProgramCache]: Analyzing trace with hash 546386693, now seen corresponding path program 1 times [2019-10-02 13:13:46,576 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:46,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:46,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:46,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:46,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:47,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:47,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-02 13:13:47,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 13:13:47,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 13:13:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:13:47,716 INFO L87 Difference]: Start difference. First operand 9266 states and 13117 transitions. Second operand 40 states. [2019-10-02 13:13:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:49,532 INFO L93 Difference]: Finished difference Result 11038 states and 15411 transitions. [2019-10-02 13:13:49,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 13:13:49,532 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 308 [2019-10-02 13:13:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:49,571 INFO L225 Difference]: With dead ends: 11038 [2019-10-02 13:13:49,572 INFO L226 Difference]: Without dead ends: 9338 [2019-10-02 13:13:49,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 13:13:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9338 states. [2019-10-02 13:13:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9338 to 9321. [2019-10-02 13:13:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9321 states. [2019-10-02 13:13:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9321 states to 9321 states and 13184 transitions. [2019-10-02 13:13:50,132 INFO L78 Accepts]: Start accepts. Automaton has 9321 states and 13184 transitions. Word has length 308 [2019-10-02 13:13:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:50,133 INFO L475 AbstractCegarLoop]: Abstraction has 9321 states and 13184 transitions. [2019-10-02 13:13:50,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 13:13:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 9321 states and 13184 transitions. [2019-10-02 13:13:50,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-02 13:13:50,158 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:50,158 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:50,158 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:50,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:50,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1783797644, now seen corresponding path program 1 times [2019-10-02 13:13:50,159 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:50,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:50,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:50,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:51,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:51,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2019-10-02 13:13:51,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-02 13:13:51,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-02 13:13:51,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 13:13:51,048 INFO L87 Difference]: Start difference. First operand 9321 states and 13184 transitions. Second operand 40 states. [2019-10-02 13:13:52,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:52,800 INFO L93 Difference]: Finished difference Result 10806 states and 15096 transitions. [2019-10-02 13:13:52,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 13:13:52,801 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 301 [2019-10-02 13:13:52,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:52,840 INFO L225 Difference]: With dead ends: 10806 [2019-10-02 13:13:52,840 INFO L226 Difference]: Without dead ends: 9531 [2019-10-02 13:13:52,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=3157, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 13:13:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9531 states. [2019-10-02 13:13:53,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9531 to 9514. [2019-10-02 13:13:53,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9514 states. [2019-10-02 13:13:53,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9514 states to 9514 states and 13421 transitions. [2019-10-02 13:13:53,303 INFO L78 Accepts]: Start accepts. Automaton has 9514 states and 13421 transitions. Word has length 301 [2019-10-02 13:13:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:53,304 INFO L475 AbstractCegarLoop]: Abstraction has 9514 states and 13421 transitions. [2019-10-02 13:13:53,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-02 13:13:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 9514 states and 13421 transitions. [2019-10-02 13:13:53,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 13:13:53,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:53,970 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:53,971 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1132897773, now seen corresponding path program 1 times [2019-10-02 13:13:53,971 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:53,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-10-02 13:13:54,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:54,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2019-10-02 13:13:54,954 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-02 13:13:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-02 13:13:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 13:13:54,955 INFO L87 Difference]: Start difference. First operand 9514 states and 13421 transitions. Second operand 42 states. [2019-10-02 13:13:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:56,965 INFO L93 Difference]: Finished difference Result 11305 states and 15744 transitions. [2019-10-02 13:13:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 13:13:56,965 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 310 [2019-10-02 13:13:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:57,011 INFO L225 Difference]: With dead ends: 11305 [2019-10-02 13:13:57,012 INFO L226 Difference]: Without dead ends: 9582 [2019-10-02 13:13:57,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=157, Invalid=3503, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 13:13:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9582 states. [2019-10-02 13:13:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9582 to 9565. [2019-10-02 13:13:57,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9565 states. [2019-10-02 13:13:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9565 states to 9565 states and 13482 transitions. [2019-10-02 13:13:57,532 INFO L78 Accepts]: Start accepts. Automaton has 9565 states and 13482 transitions. Word has length 310 [2019-10-02 13:13:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:57,533 INFO L475 AbstractCegarLoop]: Abstraction has 9565 states and 13482 transitions. [2019-10-02 13:13:57,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-02 13:13:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9565 states and 13482 transitions. [2019-10-02 13:13:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 13:13:57,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:57,551 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:13:57,552 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:57,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:57,552 INFO L82 PathProgramCache]: Analyzing trace with hash -629732835, now seen corresponding path program 1 times [2019-10-02 13:13:57,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:57,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:57,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:57,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-02 13:13:57,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:13:57,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:13:57,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:13:57,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:13:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:57,717 INFO L87 Difference]: Start difference. First operand 9565 states and 13482 transitions. Second operand 3 states. [2019-10-02 13:13:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:13:57,934 INFO L93 Difference]: Finished difference Result 9571 states and 13486 transitions. [2019-10-02 13:13:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:13:57,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-02 13:13:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:13:57,956 INFO L225 Difference]: With dead ends: 9571 [2019-10-02 13:13:57,956 INFO L226 Difference]: Without dead ends: 6613 [2019-10-02 13:13:57,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:13:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6613 states. [2019-10-02 13:13:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6613 to 6610. [2019-10-02 13:13:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6610 states. [2019-10-02 13:13:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6610 states to 6610 states and 9185 transitions. [2019-10-02 13:13:58,284 INFO L78 Accepts]: Start accepts. Automaton has 6610 states and 9185 transitions. Word has length 307 [2019-10-02 13:13:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:13:58,284 INFO L475 AbstractCegarLoop]: Abstraction has 6610 states and 9185 transitions. [2019-10-02 13:13:58,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:13:58,285 INFO L276 IsEmpty]: Start isEmpty. Operand 6610 states and 9185 transitions. [2019-10-02 13:13:58,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-10-02 13:13:58,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:13:58,296 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1] [2019-10-02 13:13:58,297 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:13:58,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:13:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1050992862, now seen corresponding path program 1 times [2019-10-02 13:13:58,297 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:13:58,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:13:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:58,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:58,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:13:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:13:58,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:13:58,756 INFO L224 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-10-02 13:13:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:13:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:13:59,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 3802 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:13:59,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:13:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 13:14:00,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:14:00,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 30 [2019-10-02 13:14:00,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:14:00,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:14:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:14:00,005 INFO L87 Difference]: Start difference. First operand 6610 states and 9185 transitions. Second operand 30 states. [2019-10-02 13:14:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:14,527 INFO L93 Difference]: Finished difference Result 28482 states and 41083 transitions. [2019-10-02 13:14:14,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 13:14:14,529 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 317 [2019-10-02 13:14:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:14,664 INFO L225 Difference]: With dead ends: 28482 [2019-10-02 13:14:14,664 INFO L226 Difference]: Without dead ends: 22005 [2019-10-02 13:14:14,702 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=816, Invalid=6494, Unknown=0, NotChecked=0, Total=7310 [2019-10-02 13:14:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22005 states. [2019-10-02 13:14:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22005 to 16458. [2019-10-02 13:14:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16458 states. [2019-10-02 13:14:16,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16458 states to 16458 states and 23723 transitions. [2019-10-02 13:14:16,079 INFO L78 Accepts]: Start accepts. Automaton has 16458 states and 23723 transitions. Word has length 317 [2019-10-02 13:14:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:16,080 INFO L475 AbstractCegarLoop]: Abstraction has 16458 states and 23723 transitions. [2019-10-02 13:14:16,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:14:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 16458 states and 23723 transitions. [2019-10-02 13:14:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-10-02 13:14:16,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:16,135 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:16,135 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash 583642859, now seen corresponding path program 1 times [2019-10-02 13:14:16,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:16,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:16,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:16,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 13:14:16,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:14:16,749 INFO L224 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:14:16,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:17,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 3804 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:14:17,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:14:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-10-02 13:14:17,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:14:17,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2019-10-02 13:14:17,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:14:17,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:14:17,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=499, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:14:17,939 INFO L87 Difference]: Start difference. First operand 16458 states and 23723 transitions. Second operand 24 states. [2019-10-02 13:14:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:30,323 INFO L93 Difference]: Finished difference Result 38984 states and 57359 transitions. [2019-10-02 13:14:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-02 13:14:30,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 319 [2019-10-02 13:14:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:30,434 INFO L225 Difference]: With dead ends: 38984 [2019-10-02 13:14:30,434 INFO L226 Difference]: Without dead ends: 22689 [2019-10-02 13:14:30,491 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=540, Invalid=5622, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 13:14:30,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22689 states. [2019-10-02 13:14:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22689 to 16844. [2019-10-02 13:14:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16844 states. [2019-10-02 13:14:32,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16844 states to 16844 states and 24423 transitions. [2019-10-02 13:14:32,650 INFO L78 Accepts]: Start accepts. Automaton has 16844 states and 24423 transitions. Word has length 319 [2019-10-02 13:14:32,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:32,650 INFO L475 AbstractCegarLoop]: Abstraction has 16844 states and 24423 transitions. [2019-10-02 13:14:32,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:14:32,650 INFO L276 IsEmpty]: Start isEmpty. Operand 16844 states and 24423 transitions. [2019-10-02 13:14:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 13:14:32,675 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:32,675 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:32,676 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:32,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1962402938, now seen corresponding path program 1 times [2019-10-02 13:14:32,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:32,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:32,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 13:14:33,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:33,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 13:14:33,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:14:33,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:14:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:14:33,292 INFO L87 Difference]: Start difference. First operand 16844 states and 24423 transitions. Second operand 24 states. [2019-10-02 13:14:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:34,551 INFO L93 Difference]: Finished difference Result 29371 states and 42723 transitions. [2019-10-02 13:14:34,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:14:34,551 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 329 [2019-10-02 13:14:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:34,639 INFO L225 Difference]: With dead ends: 29371 [2019-10-02 13:14:34,639 INFO L226 Difference]: Without dead ends: 17274 [2019-10-02 13:14:34,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 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-10-02 13:14:34,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17274 states. [2019-10-02 13:14:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17274 to 17274. [2019-10-02 13:14:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17274 states. [2019-10-02 13:14:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17274 states to 17274 states and 25029 transitions. [2019-10-02 13:14:35,843 INFO L78 Accepts]: Start accepts. Automaton has 17274 states and 25029 transitions. Word has length 329 [2019-10-02 13:14:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:35,844 INFO L475 AbstractCegarLoop]: Abstraction has 17274 states and 25029 transitions. [2019-10-02 13:14:35,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:14:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17274 states and 25029 transitions. [2019-10-02 13:14:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 13:14:35,865 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:35,866 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:35,866 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:35,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1457750693, now seen corresponding path program 1 times [2019-10-02 13:14:35,867 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:35,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:35,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:35,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:35,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2019-10-02 13:14:36,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:14:36,099 INFO L224 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-10-02 13:14:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:36,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 3887 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:14:36,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:14:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 13:14:37,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:14:37,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2019-10-02 13:14:37,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:14:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:14:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:14:37,017 INFO L87 Difference]: Start difference. First operand 17274 states and 25029 transitions. Second operand 14 states. [2019-10-02 13:14:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:46,310 INFO L93 Difference]: Finished difference Result 58123 states and 88652 transitions. [2019-10-02 13:14:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 13:14:46,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 329 [2019-10-02 13:14:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:46,491 INFO L225 Difference]: With dead ends: 58123 [2019-10-02 13:14:46,491 INFO L226 Difference]: Without dead ends: 41042 [2019-10-02 13:14:46,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-10-02 13:14:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41042 states. [2019-10-02 13:14:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41042 to 40361. [2019-10-02 13:14:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40361 states. [2019-10-02 13:14:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40361 states to 40361 states and 60516 transitions. [2019-10-02 13:14:49,838 INFO L78 Accepts]: Start accepts. Automaton has 40361 states and 60516 transitions. Word has length 329 [2019-10-02 13:14:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:14:49,839 INFO L475 AbstractCegarLoop]: Abstraction has 40361 states and 60516 transitions. [2019-10-02 13:14:49,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:14:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40361 states and 60516 transitions. [2019-10-02 13:14:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-02 13:14:49,872 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:14:49,872 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:14:49,872 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:14:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:14:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1192987570, now seen corresponding path program 1 times [2019-10-02 13:14:49,873 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:14:49,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:14:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:49,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:14:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:14:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:14:50,116 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 13:14:50,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:14:50,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:14:50,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:14:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:14:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:14:50,118 INFO L87 Difference]: Start difference. First operand 40361 states and 60516 transitions. Second operand 7 states. [2019-10-02 13:14:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:14:55,367 INFO L93 Difference]: Finished difference Result 101046 states and 196155 transitions. [2019-10-02 13:14:55,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:14:55,368 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 321 [2019-10-02 13:14:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:14:55,868 INFO L225 Difference]: With dead ends: 101046 [2019-10-02 13:14:55,869 INFO L226 Difference]: Without dead ends: 81031 [2019-10-02 13:14:55,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:14:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81031 states. [2019-10-02 13:15:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81031 to 81025. [2019-10-02 13:15:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81025 states. [2019-10-02 13:15:02,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81025 states to 81025 states and 149648 transitions. [2019-10-02 13:15:02,252 INFO L78 Accepts]: Start accepts. Automaton has 81025 states and 149648 transitions. Word has length 321 [2019-10-02 13:15:02,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:02,253 INFO L475 AbstractCegarLoop]: Abstraction has 81025 states and 149648 transitions. [2019-10-02 13:15:02,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:15:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 81025 states and 149648 transitions. [2019-10-02 13:15:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-10-02 13:15:02,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:02,280 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:02,280 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:02,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash 539028772, now seen corresponding path program 1 times [2019-10-02 13:15:02,281 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:02,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:02,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:02,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 13:15:03,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:03,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2019-10-02 13:15:03,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-02 13:15:03,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-02 13:15:03,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 13:15:03,158 INFO L87 Difference]: Start difference. First operand 81025 states and 149648 transitions. Second operand 36 states. [2019-10-02 13:15:10,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:10,064 INFO L93 Difference]: Finished difference Result 142432 states and 263729 transitions. [2019-10-02 13:15:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 13:15:10,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 322 [2019-10-02 13:15:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:10,542 INFO L225 Difference]: With dead ends: 142432 [2019-10-02 13:15:10,542 INFO L226 Difference]: Without dead ends: 85773 [2019-10-02 13:15:10,710 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=133, Invalid=2519, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:15:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85773 states. [2019-10-02 13:15:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85773 to 85693. [2019-10-02 13:15:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85693 states. [2019-10-02 13:15:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85693 states to 85693 states and 158268 transitions. [2019-10-02 13:15:14,900 INFO L78 Accepts]: Start accepts. Automaton has 85693 states and 158268 transitions. Word has length 322 [2019-10-02 13:15:14,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:14,901 INFO L475 AbstractCegarLoop]: Abstraction has 85693 states and 158268 transitions. [2019-10-02 13:15:14,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-02 13:15:14,901 INFO L276 IsEmpty]: Start isEmpty. Operand 85693 states and 158268 transitions. [2019-10-02 13:15:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-02 13:15:14,952 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:14,953 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:14,953 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:14,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1247485575, now seen corresponding path program 1 times [2019-10-02 13:15:14,954 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:14,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:14,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:14,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:14,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 13:15:18,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:18,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2019-10-02 13:15:18,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-02 13:15:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-02 13:15:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 13:15:18,622 INFO L87 Difference]: Start difference. First operand 85693 states and 158268 transitions. Second operand 38 states. [2019-10-02 13:15:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:23,259 INFO L93 Difference]: Finished difference Result 147992 states and 293585 transitions. [2019-10-02 13:15:23,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:15:23,260 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 331 [2019-10-02 13:15:23,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:23,732 INFO L225 Difference]: With dead ends: 147992 [2019-10-02 13:15:23,733 INFO L226 Difference]: Without dead ends: 85553 [2019-10-02 13:15:23,913 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=2829, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:15:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85553 states. [2019-10-02 13:15:28,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85553 to 85553. [2019-10-02 13:15:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85553 states. [2019-10-02 13:15:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85553 states to 85553 states and 154576 transitions. [2019-10-02 13:15:29,071 INFO L78 Accepts]: Start accepts. Automaton has 85553 states and 154576 transitions. Word has length 331 [2019-10-02 13:15:29,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:15:29,072 INFO L475 AbstractCegarLoop]: Abstraction has 85553 states and 154576 transitions. [2019-10-02 13:15:29,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-02 13:15:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 85553 states and 154576 transitions. [2019-10-02 13:15:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 13:15:29,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:15:29,124 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:15:29,124 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:15:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:15:29,124 INFO L82 PathProgramCache]: Analyzing trace with hash -443334228, now seen corresponding path program 1 times [2019-10-02 13:15:29,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:15:29,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:15:29,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:29,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:15:29,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:15:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:15:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 13:15:29,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:15:29,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:15:29,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:15:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:15:29,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:15:29,377 INFO L87 Difference]: Start difference. First operand 85553 states and 154576 transitions. Second operand 8 states. [2019-10-02 13:15:49,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:15:49,193 INFO L93 Difference]: Finished difference Result 325854 states and 713151 transitions. [2019-10-02 13:15:49,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:15:49,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 332 [2019-10-02 13:15:49,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:15:51,665 INFO L225 Difference]: With dead ends: 325854 [2019-10-02 13:15:51,665 INFO L226 Difference]: Without dead ends: 248583 [2019-10-02 13:15:51,987 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:15:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248583 states. [2019-10-02 13:16:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248583 to 248265. [2019-10-02 13:16:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248265 states. [2019-10-02 13:16:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248265 states to 248265 states and 512154 transitions. [2019-10-02 13:16:16,175 INFO L78 Accepts]: Start accepts. Automaton has 248265 states and 512154 transitions. Word has length 332 [2019-10-02 13:16:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:16,176 INFO L475 AbstractCegarLoop]: Abstraction has 248265 states and 512154 transitions. [2019-10-02 13:16:16,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:16:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 248265 states and 512154 transitions. [2019-10-02 13:16:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-10-02 13:16:16,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:16,238 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:16,238 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:16,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:16,238 INFO L82 PathProgramCache]: Analyzing trace with hash 276527534, now seen corresponding path program 1 times [2019-10-02 13:16:16,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:16,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:16,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:16,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:16,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 13:16:16,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-10-02 13:16:16,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:16:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:16:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:16:16,964 INFO L87 Difference]: Start difference. First operand 248265 states and 512154 transitions. Second operand 30 states. [2019-10-02 13:16:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:16:32,798 INFO L93 Difference]: Finished difference Result 278560 states and 558206 transitions. [2019-10-02 13:16:32,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:16:32,799 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 333 [2019-10-02 13:16:32,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:16:35,319 INFO L225 Difference]: With dead ends: 278560 [2019-10-02 13:16:35,319 INFO L226 Difference]: Without dead ends: 240217 [2019-10-02 13:16:35,599 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=1697, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 13:16:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240217 states. [2019-10-02 13:16:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240217 to 238865. [2019-10-02 13:16:56,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238865 states. [2019-10-02 13:16:57,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238865 states to 238865 states and 496598 transitions. [2019-10-02 13:16:57,651 INFO L78 Accepts]: Start accepts. Automaton has 238865 states and 496598 transitions. Word has length 333 [2019-10-02 13:16:57,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:16:57,652 INFO L475 AbstractCegarLoop]: Abstraction has 238865 states and 496598 transitions. [2019-10-02 13:16:57,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:16:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 238865 states and 496598 transitions. [2019-10-02 13:16:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-10-02 13:16:57,710 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:16:57,711 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:16:57,711 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:16:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:16:57,711 INFO L82 PathProgramCache]: Analyzing trace with hash -837629092, now seen corresponding path program 1 times [2019-10-02 13:16:57,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:16:57,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:16:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:16:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:16:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:16:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-02 13:16:57,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:16:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:16:57,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:16:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:16:57,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:16:57,988 INFO L87 Difference]: Start difference. First operand 238865 states and 496598 transitions. Second operand 11 states. [2019-10-02 13:17:24,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:17:24,633 INFO L93 Difference]: Finished difference Result 431304 states and 928802 transitions. [2019-10-02 13:17:24,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:17:24,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 335 [2019-10-02 13:17:24,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:17:26,355 INFO L225 Difference]: With dead ends: 431304 [2019-10-02 13:17:26,356 INFO L226 Difference]: Without dead ends: 250417 [2019-10-02 13:17:27,389 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:17:27,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250417 states. [2019-10-02 13:17:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250417 to 241321. [2019-10-02 13:17:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241321 states. [2019-10-02 13:17:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241321 states to 241321 states and 499186 transitions. [2019-10-02 13:17:45,868 INFO L78 Accepts]: Start accepts. Automaton has 241321 states and 499186 transitions. Word has length 335 [2019-10-02 13:17:45,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:17:45,868 INFO L475 AbstractCegarLoop]: Abstraction has 241321 states and 499186 transitions. [2019-10-02 13:17:45,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:17:45,869 INFO L276 IsEmpty]: Start isEmpty. Operand 241321 states and 499186 transitions. [2019-10-02 13:17:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-10-02 13:17:45,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:17:45,930 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:17:45,930 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:17:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:17:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1622498268, now seen corresponding path program 1 times [2019-10-02 13:17:45,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:17:45,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:17:45,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:45,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:45,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:17:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:46,153 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-02 13:17:46,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:17:46,153 INFO L224 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:17:46,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:17:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:17:46,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 3930 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 13:17:46,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:17:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 13:17:47,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:17:47,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2019-10-02 13:17:47,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 13:17:47,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 13:17:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-02 13:17:47,256 INFO L87 Difference]: Start difference. First operand 241321 states and 499186 transitions. Second operand 14 states. [2019-10-02 13:18:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:18:11,103 INFO L93 Difference]: Finished difference Result 488649 states and 1070938 transitions. [2019-10-02 13:18:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:18:11,103 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 340 [2019-10-02 13:18:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:18:12,730 INFO L225 Difference]: With dead ends: 488649 [2019-10-02 13:18:12,730 INFO L226 Difference]: Without dead ends: 247549 [2019-10-02 13:18:13,363 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:18:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247549 states. [2019-10-02 13:18:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247549 to 243769. [2019-10-02 13:18:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243769 states. [2019-10-02 13:18:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243769 states to 243769 states and 503164 transitions. [2019-10-02 13:18:39,757 INFO L78 Accepts]: Start accepts. Automaton has 243769 states and 503164 transitions. Word has length 340 [2019-10-02 13:18:39,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:18:39,758 INFO L475 AbstractCegarLoop]: Abstraction has 243769 states and 503164 transitions. [2019-10-02 13:18:39,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 13:18:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 243769 states and 503164 transitions. [2019-10-02 13:18:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-02 13:18:39,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:18:39,831 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:18:39,831 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:18:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:18:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1349108903, now seen corresponding path program 1 times [2019-10-02 13:18:39,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:18:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:18:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:39,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:18:39,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:18:39,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:18:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-02 13:18:40,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:18:40,166 INFO L224 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:18:40,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:18:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:18:42,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 3850 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:18:42,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:18:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-10-02 13:18:42,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:18:42,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 24 [2019-10-02 13:18:42,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:18:42,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:18:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:18:42,801 INFO L87 Difference]: Start difference. First operand 243769 states and 503164 transitions. Second operand 24 states. [2019-10-02 13:19:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:19:13,653 INFO L93 Difference]: Finished difference Result 488419 states and 1012130 transitions. [2019-10-02 13:19:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 13:19:13,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 332 [2019-10-02 13:19:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:19:15,066 INFO L225 Difference]: With dead ends: 488419 [2019-10-02 13:19:15,066 INFO L226 Difference]: Without dead ends: 244881 [2019-10-02 13:19:15,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=1785, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:19:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244881 states. [2019-10-02 13:19:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244881 to 243777. [2019-10-02 13:19:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243777 states. [2019-10-02 13:19:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243777 states to 243777 states and 502706 transitions. [2019-10-02 13:19:33,603 INFO L78 Accepts]: Start accepts. Automaton has 243777 states and 502706 transitions. Word has length 332 [2019-10-02 13:19:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:19:33,603 INFO L475 AbstractCegarLoop]: Abstraction has 243777 states and 502706 transitions. [2019-10-02 13:19:33,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:19:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 243777 states and 502706 transitions. [2019-10-02 13:19:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-10-02 13:19:33,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:19:33,664 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:19:33,664 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:19:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:19:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1743588627, now seen corresponding path program 1 times [2019-10-02 13:19:33,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:19:33,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:19:33,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:33,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:33,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:19:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 13:19:35,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:19:35,445 INFO L224 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:19:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:19:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:19:36,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 3852 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:19:36,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:19:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-10-02 13:19:36,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:19:36,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-10-02 13:19:36,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:19:36,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:19:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:19:36,419 INFO L87 Difference]: Start difference. First operand 243777 states and 502706 transitions. Second operand 13 states. [2019-10-02 13:20:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:20:21,892 INFO L93 Difference]: Finished difference Result 738343 states and 1603450 transitions. [2019-10-02 13:20:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:20:21,892 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 334 [2019-10-02 13:20:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:20:25,401 INFO L225 Difference]: With dead ends: 738343 [2019-10-02 13:20:25,401 INFO L226 Difference]: Without dead ends: 494797 [2019-10-02 13:20:27,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:20:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494797 states. [2019-10-02 13:21:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494797 to 454566. [2019-10-02 13:21:14,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454566 states. [2019-10-02 13:21:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454566 states to 454566 states and 956414 transitions. [2019-10-02 13:21:18,145 INFO L78 Accepts]: Start accepts. Automaton has 454566 states and 956414 transitions. Word has length 334 [2019-10-02 13:21:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:21:18,146 INFO L475 AbstractCegarLoop]: Abstraction has 454566 states and 956414 transitions. [2019-10-02 13:21:18,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:21:18,146 INFO L276 IsEmpty]: Start isEmpty. Operand 454566 states and 956414 transitions. [2019-10-02 13:21:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 13:21:18,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:21:18,251 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:21:18,251 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:21:18,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:21:18,251 INFO L82 PathProgramCache]: Analyzing trace with hash -146774389, now seen corresponding path program 1 times [2019-10-02 13:21:18,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:21:18,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:21:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:21:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 13:21:30,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:21:30,301 INFO L224 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-10-02 13:21:30,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:21:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:21:31,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 3865 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:21:31,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:21:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:21:31,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:21:31,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 4] total 33 [2019-10-02 13:21:31,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 13:21:31,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 13:21:31,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=986, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:21:31,221 INFO L87 Difference]: Start difference. First operand 454566 states and 956414 transitions. Second operand 33 states.