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_spec6_product26.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:42:04,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:42:04,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:42:04,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:42:04,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:42:04,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:42:04,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:42:04,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:42:04,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:42:04,320 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:42:04,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:42:04,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:42:04,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:42:04,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:42:04,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:42:04,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:42:04,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:42:04,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:42:04,331 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:42:04,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:42:04,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:42:04,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:42:04,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:42:04,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:42:04,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:42:04,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:42:04,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:42:04,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:42:04,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:42:04,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:42:04,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:42:04,357 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:42:04,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:42:04,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:42:04,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:42:04,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:42:04,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:42:04,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:42:04,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:42:04,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:42:04,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:42:04,365 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:42:04,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:42:04,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:42:04,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:42:04,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:42:04,382 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:42:04,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:42:04,383 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:42:04,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:42:04,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:42:04,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:42:04,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:42:04,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:42:04,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:42:04,384 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:42:04,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:42:04,385 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:42:04,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:42:04,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:42:04,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:42:04,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:42:04,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:42:04,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:42:04,386 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:42:04,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:42:04,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:42:04,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:42:04,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:42:04,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:42:04,387 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:42:04,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:42:04,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:42:04,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:42:04,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:42:04,439 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:42:04,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec6_product26.cil.c [2019-10-02 13:42:04,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b4f2756/a877ec80f88641ff8f602ef2a62e0604/FLAGadd6a2b37 [2019-10-02 13:42:05,214 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:42:05,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec6_product26.cil.c [2019-10-02 13:42:05,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b4f2756/a877ec80f88641ff8f602ef2a62e0604/FLAGadd6a2b37 [2019-10-02 13:42:05,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7b4f2756/a877ec80f88641ff8f602ef2a62e0604 [2019-10-02 13:42:05,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:42:05,387 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:42:05,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:42:05,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:42:05,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:42:05,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:42:05" (1/1) ... [2019-10-02 13:42:05,394 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d32cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:05, skipping insertion in model container [2019-10-02 13:42:05,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:42:05" (1/1) ... [2019-10-02 13:42:05,401 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:42:05,496 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:42:06,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:42:06,291 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:42:06,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:42:06,592 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:42:06,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06 WrapperNode [2019-10-02 13:42:06,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:42:06,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:42:06,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:42:06,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:42:06,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (1/1) ... [2019-10-02 13:42:06,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:42:06,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:42:06,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:42:06,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:42:06,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (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:42:06,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:42:06,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:42:06,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:42:06,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:42:06,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:42:06,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:42:06,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:42:06,930 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:42:06,931 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:42:06,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:42:06,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:42:06,931 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:42:06,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:42:06,932 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:42:06,933 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:42:06,933 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:42:06,935 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:42:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:42:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:42:06,936 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:42:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:42:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:42:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:42:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:42:06,937 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:42:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:42:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:42:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:42:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:42:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-10-02 13:42:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:42:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:42:06,940 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:42:06,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:42:06,940 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:42:06,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:42:06,940 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:42:06,940 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:42:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:42:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:42:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:42:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:42:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:42:06,941 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:42:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:42:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:42:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:42:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:42:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:42:06,942 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:42:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:42:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:42:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:42:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:42:06,943 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:42:06,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:42:06,944 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:42:06,944 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:42:06,944 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:42:06,944 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:42:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:42:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:42:06,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:42:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:42:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:42:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:42:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:42:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:42:06,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:42:06,947 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:42:06,947 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:42:06,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:42:06,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:42:06,948 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:42:06,948 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:42:06,948 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:42:06,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:42:06,949 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:42:06,949 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:42:06,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-02 13:42:06,949 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-02 13:42:06,950 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:42:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:42:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:42:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:42:06,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:42:06,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:42:06,953 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:42:06,953 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:42:06,953 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:42:06,953 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__AddressBook [2019-10-02 13:42:06,954 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:42:06,954 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:42:06,954 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:42:06,954 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:42:06,954 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:42:06,954 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-10-02 13:42:06,955 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:42:06,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:42:06,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:42:06,956 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:42:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:42:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:42:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:42:06,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:42:06,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:42:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:42:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:42:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:42:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:42:06,959 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:42:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:42:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:42:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:42:06,960 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:42:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:42:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:42:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:42:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:42:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:42:06,961 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:42:06,962 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:42:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:42:06,966 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:42:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:42:06,967 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:42:06,975 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:42:06,975 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:42:06,975 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:42:06,975 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:42:06,975 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:42:06,976 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:42:06,976 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:42:06,976 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:42:06,976 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:42:06,976 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:42:06,976 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:42:06,977 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:42:06,977 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:42:06,977 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:42:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:42:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:42:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:42:06,978 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:42:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:42:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:42:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:42:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:42:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:42:06,979 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:42:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:42:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:42:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:42:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:42:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:42:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:42:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:42:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:42:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-10-02 13:42:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:42:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:42:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:42:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:42:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:42:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:42:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:42:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:42:06,982 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:42:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:42:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:42:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:42:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:42:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:42:06,983 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:42:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:42:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:42:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:42:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:42:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:42:06,984 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:42:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:42:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:42:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:42:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:42:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:42:06,985 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:42:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:42:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:42:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:42:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:42:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:42:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:42:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:42:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:42:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:42:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:42:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:42:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:42:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__1 [2019-10-02 13:42:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptDecrypt_spec__2 [2019-10-02 13:42:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:42:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:42:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:42:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:42:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:42:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:42:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:42:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:42:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:42:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:42:06,990 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:42:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:42:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:42:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-10-02 13:42:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:42:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:42:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:42:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:42:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__AddressBook [2019-10-02 13:42:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:42:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:42:06,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:42:06,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:42:09,219 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:42:09,219 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:42:09,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:42:09 BoogieIcfgContainer [2019-10-02 13:42:09,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:42:09,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:42:09,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:42:09,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:42:09,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:42:05" (1/3) ... [2019-10-02 13:42:09,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61340d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:42:09, skipping insertion in model container [2019-10-02 13:42:09,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:42:06" (2/3) ... [2019-10-02 13:42:09,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61340d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:42:09, skipping insertion in model container [2019-10-02 13:42:09,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:42:09" (3/3) ... [2019-10-02 13:42:09,230 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec6_product26.cil.c [2019-10-02 13:42:09,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:42:09,253 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:42:09,272 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:42:09,311 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:42:09,312 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:42:09,312 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:42:09,313 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:42:09,313 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:42:09,313 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:42:09,313 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:42:09,313 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:42:09,313 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:42:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states. [2019-10-02 13:42:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 13:42:09,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:09,393 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:09,398 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash 430115854, now seen corresponding path program 1 times [2019-10-02 13:42:09,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:09,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:10,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:10,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:42:10,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:42:10,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:42:10,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:42:10,234 INFO L87 Difference]: Start difference. First operand 609 states. Second operand 2 states. [2019-10-02 13:42:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:10,374 INFO L93 Difference]: Finished difference Result 893 states and 1209 transitions. [2019-10-02 13:42:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:42:10,375 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 185 [2019-10-02 13:42:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:10,408 INFO L225 Difference]: With dead ends: 893 [2019-10-02 13:42:10,409 INFO L226 Difference]: Without dead ends: 580 [2019-10-02 13:42:10,421 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:42:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-10-02 13:42:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2019-10-02 13:42:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-10-02 13:42:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 790 transitions. [2019-10-02 13:42:10,578 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 790 transitions. Word has length 185 [2019-10-02 13:42:10,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:10,582 INFO L475 AbstractCegarLoop]: Abstraction has 580 states and 790 transitions. [2019-10-02 13:42:10,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:42:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 790 transitions. [2019-10-02 13:42:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 13:42:10,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:10,597 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:10,597 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1045148671, now seen corresponding path program 1 times [2019-10-02 13:42:10,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:10,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:10,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:10,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:10,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:10,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:42:10,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:42:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:42:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:42:10,903 INFO L87 Difference]: Start difference. First operand 580 states and 790 transitions. Second operand 3 states. [2019-10-02 13:42:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:10,981 INFO L93 Difference]: Finished difference Result 876 states and 1174 transitions. [2019-10-02 13:42:10,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:42:10,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-10-02 13:42:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:10,990 INFO L225 Difference]: With dead ends: 876 [2019-10-02 13:42:10,990 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 13:42:10,999 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:42:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 13:42:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 582. [2019-10-02 13:42:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-02 13:42:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 792 transitions. [2019-10-02 13:42:11,041 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 792 transitions. Word has length 186 [2019-10-02 13:42:11,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:11,042 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 792 transitions. [2019-10-02 13:42:11,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:42:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 792 transitions. [2019-10-02 13:42:11,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:42:11,049 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:11,049 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:11,049 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:11,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:11,050 INFO L82 PathProgramCache]: Analyzing trace with hash -637450832, now seen corresponding path program 1 times [2019-10-02 13:42:11,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:11,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:11,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:11,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:11,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:11,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:42:11,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:42:11,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:42:11,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:42:11,317 INFO L87 Difference]: Start difference. First operand 582 states and 792 transitions. Second operand 3 states. [2019-10-02 13:42:11,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:11,364 INFO L93 Difference]: Finished difference Result 1144 states and 1588 transitions. [2019-10-02 13:42:11,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:42:11,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 13:42:11,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:11,370 INFO L225 Difference]: With dead ends: 1144 [2019-10-02 13:42:11,371 INFO L226 Difference]: Without dead ends: 627 [2019-10-02 13:42:11,374 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:42:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-02 13:42:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 626. [2019-10-02 13:42:11,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 13:42:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 867 transitions. [2019-10-02 13:42:11,405 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 867 transitions. Word has length 198 [2019-10-02 13:42:11,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:11,406 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 867 transitions. [2019-10-02 13:42:11,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:42:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 867 transitions. [2019-10-02 13:42:11,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:42:11,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:11,412 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:11,412 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:11,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:11,412 INFO L82 PathProgramCache]: Analyzing trace with hash 785310459, now seen corresponding path program 1 times [2019-10-02 13:42:11,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:11,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:11,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:11,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:11,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:11,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:11,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:42:11,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:42:11,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:42:11,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:42:11,598 INFO L87 Difference]: Start difference. First operand 626 states and 867 transitions. Second operand 3 states. [2019-10-02 13:42:11,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:11,643 INFO L93 Difference]: Finished difference Result 1273 states and 1808 transitions. [2019-10-02 13:42:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:42:11,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-02 13:42:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:11,652 INFO L225 Difference]: With dead ends: 1273 [2019-10-02 13:42:11,652 INFO L226 Difference]: Without dead ends: 712 [2019-10-02 13:42:11,655 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:42:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2019-10-02 13:42:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 711. [2019-10-02 13:42:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-02 13:42:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1011 transitions. [2019-10-02 13:42:11,706 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1011 transitions. Word has length 199 [2019-10-02 13:42:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:11,708 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 1011 transitions. [2019-10-02 13:42:11,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:42:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1011 transitions. [2019-10-02 13:42:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:42:11,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:11,716 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:11,716 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:11,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:11,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1620732756, now seen corresponding path program 1 times [2019-10-02 13:42:11,717 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:11,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:11,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:42:12,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:12,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:42:12,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:42:12,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:42:12,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:42:12,150 INFO L87 Difference]: Start difference. First operand 711 states and 1011 transitions. Second operand 11 states. [2019-10-02 13:42:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:17,680 INFO L93 Difference]: Finished difference Result 3178 states and 4511 transitions. [2019-10-02 13:42:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:42:17,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 202 [2019-10-02 13:42:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:17,709 INFO L225 Difference]: With dead ends: 3178 [2019-10-02 13:42:17,709 INFO L226 Difference]: Without dead ends: 2898 [2019-10-02 13:42:17,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 13:42:17,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2019-10-02 13:42:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2877. [2019-10-02 13:42:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2019-10-02 13:42:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 4036 transitions. [2019-10-02 13:42:17,910 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 4036 transitions. Word has length 202 [2019-10-02 13:42:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:17,911 INFO L475 AbstractCegarLoop]: Abstraction has 2877 states and 4036 transitions. [2019-10-02 13:42:17,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:42:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 4036 transitions. [2019-10-02 13:42:17,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 13:42:17,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:17,917 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:17,918 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:17,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:17,918 INFO L82 PathProgramCache]: Analyzing trace with hash 246930665, now seen corresponding path program 1 times [2019-10-02 13:42:17,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:17,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:17,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:17,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:42:18,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:18,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:42:18,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:42:18,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:42:18,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:42:18,317 INFO L87 Difference]: Start difference. First operand 2877 states and 4036 transitions. Second operand 18 states. [2019-10-02 13:42:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:18,906 INFO L93 Difference]: Finished difference Result 5358 states and 7607 transitions. [2019-10-02 13:42:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:42:18,906 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 203 [2019-10-02 13:42:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:18,929 INFO L225 Difference]: With dead ends: 5358 [2019-10-02 13:42:18,929 INFO L226 Difference]: Without dead ends: 2894 [2019-10-02 13:42:18,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:42:18,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2019-10-02 13:42:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2892. [2019-10-02 13:42:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2892 states. [2019-10-02 13:42:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4041 transitions. [2019-10-02 13:42:19,087 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4041 transitions. Word has length 203 [2019-10-02 13:42:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:19,088 INFO L475 AbstractCegarLoop]: Abstraction has 2892 states and 4041 transitions. [2019-10-02 13:42:19,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:42:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4041 transitions. [2019-10-02 13:42:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:42:19,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:19,094 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:19,095 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1013825460, now seen corresponding path program 1 times [2019-10-02 13:42:19,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:19,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:19,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:19,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:42:19,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:19,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:42:19,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:42:19,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:42:19,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:42:19,366 INFO L87 Difference]: Start difference. First operand 2892 states and 4041 transitions. Second operand 6 states. [2019-10-02 13:42:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:20,182 INFO L93 Difference]: Finished difference Result 8304 states and 11749 transitions. [2019-10-02 13:42:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:42:20,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-10-02 13:42:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:20,225 INFO L225 Difference]: With dead ends: 8304 [2019-10-02 13:42:20,226 INFO L226 Difference]: Without dead ends: 5871 [2019-10-02 13:42:20,239 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 13:42:20,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2019-10-02 13:42:20,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5800. [2019-10-02 13:42:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5800 states. [2019-10-02 13:42:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5800 states to 5800 states and 8205 transitions. [2019-10-02 13:42:20,544 INFO L78 Accepts]: Start accepts. Automaton has 5800 states and 8205 transitions. Word has length 212 [2019-10-02 13:42:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:20,545 INFO L475 AbstractCegarLoop]: Abstraction has 5800 states and 8205 transitions. [2019-10-02 13:42:20,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:42:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 5800 states and 8205 transitions. [2019-10-02 13:42:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 13:42:20,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:20,553 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:20,553 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:20,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:20,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1460198811, now seen corresponding path program 1 times [2019-10-02 13:42:20,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:20,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:20,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:20,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:20,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:42:20,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:20,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:42:20,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:42:20,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:42:20,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:42:20,766 INFO L87 Difference]: Start difference. First operand 5800 states and 8205 transitions. Second operand 5 states. [2019-10-02 13:42:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:22,373 INFO L93 Difference]: Finished difference Result 21559 states and 30658 transitions. [2019-10-02 13:42:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:42:22,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-02 13:42:22,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:22,506 INFO L225 Difference]: With dead ends: 21559 [2019-10-02 13:42:22,506 INFO L226 Difference]: Without dead ends: 16610 [2019-10-02 13:42:22,542 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:42:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16610 states. [2019-10-02 13:42:24,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16610 to 16514. [2019-10-02 13:42:24,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16514 states. [2019-10-02 13:42:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16514 states to 16514 states and 23470 transitions. [2019-10-02 13:42:24,109 INFO L78 Accepts]: Start accepts. Automaton has 16514 states and 23470 transitions. Word has length 213 [2019-10-02 13:42:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:24,110 INFO L475 AbstractCegarLoop]: Abstraction has 16514 states and 23470 transitions. [2019-10-02 13:42:24,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:42:24,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16514 states and 23470 transitions. [2019-10-02 13:42:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 13:42:24,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:24,124 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:24,124 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2046974930, now seen corresponding path program 1 times [2019-10-02 13:42:24,125 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:24,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:24,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:24,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:24,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 13:42:24,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:24,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:42:24,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:42:24,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:42:24,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:42:24,384 INFO L87 Difference]: Start difference. First operand 16514 states and 23470 transitions. Second operand 11 states. [2019-10-02 13:42:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:25,225 INFO L93 Difference]: Finished difference Result 31215 states and 43918 transitions. [2019-10-02 13:42:25,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:42:25,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 213 [2019-10-02 13:42:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:25,319 INFO L225 Difference]: With dead ends: 31215 [2019-10-02 13:42:25,320 INFO L226 Difference]: Without dead ends: 16438 [2019-10-02 13:42:25,512 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:42:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16438 states. [2019-10-02 13:42:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16438 to 16386. [2019-10-02 13:42:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16386 states. [2019-10-02 13:42:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16386 states to 16386 states and 23087 transitions. [2019-10-02 13:42:26,265 INFO L78 Accepts]: Start accepts. Automaton has 16386 states and 23087 transitions. Word has length 213 [2019-10-02 13:42:26,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:26,266 INFO L475 AbstractCegarLoop]: Abstraction has 16386 states and 23087 transitions. [2019-10-02 13:42:26,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:42:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 16386 states and 23087 transitions. [2019-10-02 13:42:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:42:26,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:26,290 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:26,290 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:26,291 INFO L82 PathProgramCache]: Analyzing trace with hash -413306007, now seen corresponding path program 1 times [2019-10-02 13:42:26,291 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:26,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:26,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:26,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:26,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:26,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:42:26,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:42:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:42:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:42:26,489 INFO L87 Difference]: Start difference. First operand 16386 states and 23087 transitions. Second operand 3 states. [2019-10-02 13:42:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:27,663 INFO L93 Difference]: Finished difference Result 33367 states and 47315 transitions. [2019-10-02 13:42:27,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:42:27,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 13:42:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:27,735 INFO L225 Difference]: With dead ends: 33367 [2019-10-02 13:42:27,735 INFO L226 Difference]: Without dead ends: 17046 [2019-10-02 13:42:27,775 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:42:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17046 states. [2019-10-02 13:42:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17046 to 17042. [2019-10-02 13:42:28,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17042 states. [2019-10-02 13:42:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17042 states to 17042 states and 24281 transitions. [2019-10-02 13:42:28,496 INFO L78 Accepts]: Start accepts. Automaton has 17042 states and 24281 transitions. Word has length 234 [2019-10-02 13:42:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:28,498 INFO L475 AbstractCegarLoop]: Abstraction has 17042 states and 24281 transitions. [2019-10-02 13:42:28,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:42:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 17042 states and 24281 transitions. [2019-10-02 13:42:28,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:42:28,526 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:28,526 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:28,526 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:28,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1474259572, now seen corresponding path program 1 times [2019-10-02 13:42:28,527 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:28,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:28,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:28,774 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:28,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:28,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:42:28,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:42:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:42:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:42:28,776 INFO L87 Difference]: Start difference. First operand 17042 states and 24281 transitions. Second operand 8 states. [2019-10-02 13:42:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:34,479 INFO L93 Difference]: Finished difference Result 51492 states and 74833 transitions. [2019-10-02 13:42:34,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:42:34,479 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 235 [2019-10-02 13:42:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:34,653 INFO L225 Difference]: With dead ends: 51492 [2019-10-02 13:42:34,653 INFO L226 Difference]: Without dead ends: 34515 [2019-10-02 13:42:34,707 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:42:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34515 states. [2019-10-02 13:42:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34515 to 19526. [2019-10-02 13:42:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19526 states. [2019-10-02 13:42:35,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19526 states to 19526 states and 29149 transitions. [2019-10-02 13:42:35,999 INFO L78 Accepts]: Start accepts. Automaton has 19526 states and 29149 transitions. Word has length 235 [2019-10-02 13:42:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:36,000 INFO L475 AbstractCegarLoop]: Abstraction has 19526 states and 29149 transitions. [2019-10-02 13:42:36,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:42:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 19526 states and 29149 transitions. [2019-10-02 13:42:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:42:36,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:36,047 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:36,048 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 292222328, now seen corresponding path program 1 times [2019-10-02 13:42:36,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:36,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:36,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:36,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:42:36,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:36,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:42:36,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:42:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:42:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:42:36,248 INFO L87 Difference]: Start difference. First operand 19526 states and 29149 transitions. Second operand 8 states. [2019-10-02 13:42:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:42,649 INFO L93 Difference]: Finished difference Result 59480 states and 91685 transitions. [2019-10-02 13:42:42,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:42:42,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-10-02 13:42:42,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:42,824 INFO L225 Difference]: With dead ends: 59480 [2019-10-02 13:42:42,824 INFO L226 Difference]: Without dead ends: 40019 [2019-10-02 13:42:42,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:42:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40019 states. [2019-10-02 13:42:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40019 to 24614. [2019-10-02 13:42:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24614 states. [2019-10-02 13:42:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24614 states to 24614 states and 39725 transitions. [2019-10-02 13:42:44,225 INFO L78 Accepts]: Start accepts. Automaton has 24614 states and 39725 transitions. Word has length 236 [2019-10-02 13:42:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:44,225 INFO L475 AbstractCegarLoop]: Abstraction has 24614 states and 39725 transitions. [2019-10-02 13:42:44,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:42:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24614 states and 39725 transitions. [2019-10-02 13:42:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 13:42:44,300 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:44,300 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:44,301 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:44,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:44,301 INFO L82 PathProgramCache]: Analyzing trace with hash -174648144, now seen corresponding path program 1 times [2019-10-02 13:42:44,301 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:44,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:44,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:44,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:42:44,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:42:44,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:42:44,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:42:44,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:42:44,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:42:44,556 INFO L87 Difference]: Start difference. First operand 24614 states and 39725 transitions. Second operand 8 states. [2019-10-02 13:42:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:42:52,339 INFO L93 Difference]: Finished difference Result 75728 states and 127865 transitions. [2019-10-02 13:42:52,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:42:52,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 252 [2019-10-02 13:42:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:42:52,614 INFO L225 Difference]: With dead ends: 75728 [2019-10-02 13:42:52,614 INFO L226 Difference]: Without dead ends: 51179 [2019-10-02 13:42:52,733 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:42:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51179 states. [2019-10-02 13:42:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51179 to 34918. [2019-10-02 13:42:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34918 states. [2019-10-02 13:42:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34918 states to 34918 states and 62417 transitions. [2019-10-02 13:42:55,823 INFO L78 Accepts]: Start accepts. Automaton has 34918 states and 62417 transitions. Word has length 252 [2019-10-02 13:42:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:42:55,824 INFO L475 AbstractCegarLoop]: Abstraction has 34918 states and 62417 transitions. [2019-10-02 13:42:55,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:42:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34918 states and 62417 transitions. [2019-10-02 13:42:55,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 13:42:55,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:42:55,915 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:42:55,916 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:42:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:42:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1986557285, now seen corresponding path program 1 times [2019-10-02 13:42:55,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:42:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:42:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:55,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:55,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:42:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:42:57,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:42:57,404 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:42:57,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:42:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:42:58,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 3157 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:42:58,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:42:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 13:42:58,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:42:58,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [52] total 58 [2019-10-02 13:42:58,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-02 13:42:58,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-02 13:42:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=3177, Unknown=0, NotChecked=0, Total=3306 [2019-10-02 13:42:58,786 INFO L87 Difference]: Start difference. First operand 34918 states and 62417 transitions. Second operand 58 states. [2019-10-02 13:43:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:43:10,315 INFO L93 Difference]: Finished difference Result 71389 states and 130435 transitions. [2019-10-02 13:43:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 13:43:10,321 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 241 [2019-10-02 13:43:10,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:43:10,573 INFO L225 Difference]: With dead ends: 71389 [2019-10-02 13:43:10,573 INFO L226 Difference]: Without dead ends: 36507 [2019-10-02 13:43:10,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=304, Invalid=7886, Unknown=0, NotChecked=0, Total=8190 [2019-10-02 13:43:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36507 states. [2019-10-02 13:43:15,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36507 to 35774. [2019-10-02 13:43:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35774 states. [2019-10-02 13:43:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35774 states to 35774 states and 63485 transitions. [2019-10-02 13:43:15,881 INFO L78 Accepts]: Start accepts. Automaton has 35774 states and 63485 transitions. Word has length 241 [2019-10-02 13:43:15,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:43:15,881 INFO L475 AbstractCegarLoop]: Abstraction has 35774 states and 63485 transitions. [2019-10-02 13:43:15,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-02 13:43:15,882 INFO L276 IsEmpty]: Start isEmpty. Operand 35774 states and 63485 transitions. [2019-10-02 13:43:16,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 13:43:16,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:43:16,096 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-10-02 13:43:16,097 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:43:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:43:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1654631560, now seen corresponding path program 1 times [2019-10-02 13:43:16,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:43:16,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:43:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:43:16,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:43:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:43:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:43:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 13:43:16,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:43:16,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:43:16,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:43:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:43:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:43:16,302 INFO L87 Difference]: Start difference. First operand 35774 states and 63485 transitions. Second operand 3 states. [2019-10-02 13:43:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:43:18,849 INFO L93 Difference]: Finished difference Result 81585 states and 151203 transitions. [2019-10-02 13:43:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:43:18,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-02 13:43:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:43:19,166 INFO L225 Difference]: With dead ends: 81585 [2019-10-02 13:43:19,166 INFO L226 Difference]: Without dead ends: 45890 [2019-10-02 13:43:19,284 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:43:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45890 states. [2019-10-02 13:43:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45890 to 45886. [2019-10-02 13:43:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45886 states. [2019-10-02 13:43:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45886 states to 45886 states and 87549 transitions. [2019-10-02 13:43:24,637 INFO L78 Accepts]: Start accepts. Automaton has 45886 states and 87549 transitions. Word has length 260 [2019-10-02 13:43:24,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:43:24,637 INFO L475 AbstractCegarLoop]: Abstraction has 45886 states and 87549 transitions. [2019-10-02 13:43:24,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:43:24,637 INFO L276 IsEmpty]: Start isEmpty. Operand 45886 states and 87549 transitions. [2019-10-02 13:43:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 13:43:24,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:43:24,754 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:24,754 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:43:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:43:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1625683354, now seen corresponding path program 1 times [2019-10-02 13:43:24,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:43:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:43:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:43:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:43:24,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:43:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:43:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 13:43:27,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:43:27,162 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:43:27,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:43:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:43:27,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 3222 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:43:27,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:43:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:43:28,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:43:28,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [68] total 72 [2019-10-02 13:43:28,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-02 13:43:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-02 13:43:28,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=4954, Unknown=0, NotChecked=0, Total=5112 [2019-10-02 13:43:28,073 INFO L87 Difference]: Start difference. First operand 45886 states and 87549 transitions. Second operand 72 states. [2019-10-02 13:46:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:46:03,712 INFO L93 Difference]: Finished difference Result 313073 states and 579515 transitions. [2019-10-02 13:46:03,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 441 states. [2019-10-02 13:46:03,713 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 260 [2019-10-02 13:46:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:46:05,356 INFO L225 Difference]: With dead ends: 313073 [2019-10-02 13:46:05,356 INFO L226 Difference]: Without dead ends: 261291 [2019-10-02 13:46:05,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 291 SyntacticMatches, 2 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94555 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=10101, Invalid=249489, Unknown=0, NotChecked=0, Total=259590 [2019-10-02 13:46:05,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261291 states. [2019-10-02 13:46:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261291 to 251241. [2019-10-02 13:46:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251241 states. [2019-10-02 13:46:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251241 states to 251241 states and 453831 transitions. [2019-10-02 13:46:22,611 INFO L78 Accepts]: Start accepts. Automaton has 251241 states and 453831 transitions. Word has length 260 [2019-10-02 13:46:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:46:22,612 INFO L475 AbstractCegarLoop]: Abstraction has 251241 states and 453831 transitions. [2019-10-02 13:46:22,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-02 13:46:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 251241 states and 453831 transitions. [2019-10-02 13:46:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 13:46:23,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:46:23,226 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,227 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:46:23,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:46:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -481691955, now seen corresponding path program 1 times [2019-10-02 13:46:23,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:46:23,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:46:23,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:46:23,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:46:23,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:46:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:46:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:46:25,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:46:25,232 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:46:25,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:46:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:46:25,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 3168 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:46:25,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:46:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:46:26,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:46:26,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [59] total 66 [2019-10-02 13:46:26,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-02 13:46:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-02 13:46:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=4141, Unknown=0, NotChecked=0, Total=4290 [2019-10-02 13:46:26,365 INFO L87 Difference]: Start difference. First operand 251241 states and 453831 transitions. Second operand 66 states. [2019-10-02 13:46:36,512 WARN L191 SmtUtils]: Spent 5.31 s on a formula simplification that was a NOOP. DAG size: 44 [2019-10-02 13:46:47,563 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 13:47:10,288 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 13:47:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:47:31,914 INFO L93 Difference]: Finished difference Result 429886 states and 810512 transitions. [2019-10-02 13:47:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-10-02 13:47:31,915 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 246 [2019-10-02 13:47:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:47:33,933 INFO L225 Difference]: With dead ends: 429886 [2019-10-02 13:47:33,933 INFO L226 Difference]: Without dead ends: 176400 [2019-10-02 13:47:34,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 254 SyntacticMatches, 2 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11162 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=2782, Invalid=42374, Unknown=0, NotChecked=0, Total=45156 [2019-10-02 13:47:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176400 states. [2019-10-02 13:48:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176400 to 169058. [2019-10-02 13:48:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169058 states. [2019-10-02 13:48:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169058 states to 169058 states and 302648 transitions. [2019-10-02 13:48:01,822 INFO L78 Accepts]: Start accepts. Automaton has 169058 states and 302648 transitions. Word has length 246 [2019-10-02 13:48:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:48:01,822 INFO L475 AbstractCegarLoop]: Abstraction has 169058 states and 302648 transitions. [2019-10-02 13:48:01,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-02 13:48:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 169058 states and 302648 transitions. [2019-10-02 13:48:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 13:48:02,184 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:48:02,184 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:02,185 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:48:02,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:48:02,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1340755410, now seen corresponding path program 1 times [2019-10-02 13:48:02,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:48:02,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:48:02,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:02,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:02,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:48:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 13:48:03,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:48:03,903 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:48:04,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:48:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:48:04,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 3225 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:48:04,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:48:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 13:48:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:48:09,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [54] total 61 [2019-10-02 13:48:09,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-02 13:48:09,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-02 13:48:09,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=3526, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 13:48:09,998 INFO L87 Difference]: Start difference. First operand 169058 states and 302648 transitions. Second operand 61 states. [2019-10-02 13:48:27,115 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-10-02 13:48:49,455 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-10-02 13:49:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:09,476 INFO L93 Difference]: Finished difference Result 344792 states and 624970 transitions. [2019-10-02 13:49:09,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2019-10-02 13:49:09,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 263 [2019-10-02 13:49:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:10,281 INFO L225 Difference]: With dead ends: 344792 [2019-10-02 13:49:10,281 INFO L226 Difference]: Without dead ends: 175807 [2019-10-02 13:49:10,714 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 273 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10306 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=2751, Invalid=39891, Unknown=0, NotChecked=0, Total=42642 [2019-10-02 13:49:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175807 states. [2019-10-02 13:49:26,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175807 to 168543. [2019-10-02 13:49:26,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168543 states. [2019-10-02 13:49:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168543 states to 168543 states and 293188 transitions. [2019-10-02 13:49:28,127 INFO L78 Accepts]: Start accepts. Automaton has 168543 states and 293188 transitions. Word has length 263 [2019-10-02 13:49:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:28,128 INFO L475 AbstractCegarLoop]: Abstraction has 168543 states and 293188 transitions. [2019-10-02 13:49:28,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-02 13:49:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 168543 states and 293188 transitions. [2019-10-02 13:49:28,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 13:49:28,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:28,358 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:28,358 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:28,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1990087588, now seen corresponding path program 1 times [2019-10-02 13:49:28,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:28,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:28,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:28,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 13:49:28,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:49:28,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:49:28,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:49:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:49:28,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:49:28,524 INFO L87 Difference]: Start difference. First operand 168543 states and 293188 transitions. Second operand 5 states. [2019-10-02 13:49:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:49:36,131 INFO L93 Difference]: Finished difference Result 183764 states and 314424 transitions. [2019-10-02 13:49:36,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:49:36,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2019-10-02 13:49:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:49:36,368 INFO L225 Difference]: With dead ends: 183764 [2019-10-02 13:49:36,368 INFO L226 Difference]: Without dead ends: 68626 [2019-10-02 13:49:36,547 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:49:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68626 states. [2019-10-02 13:49:40,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68626 to 68481. [2019-10-02 13:49:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68481 states. [2019-10-02 13:49:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68481 states to 68481 states and 135333 transitions. [2019-10-02 13:49:41,149 INFO L78 Accepts]: Start accepts. Automaton has 68481 states and 135333 transitions. Word has length 269 [2019-10-02 13:49:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:49:41,149 INFO L475 AbstractCegarLoop]: Abstraction has 68481 states and 135333 transitions. [2019-10-02 13:49:41,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:49:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 68481 states and 135333 transitions. [2019-10-02 13:49:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 13:49:41,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:49:41,370 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:49:41,371 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:49:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:49:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1055259742, now seen corresponding path program 1 times [2019-10-02 13:49:41,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:49:41,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:49:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:41,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:41,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:49:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 13:49:43,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:49:43,923 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:49:44,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:49:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:49:44,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 3236 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:49:44,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:49:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:49:45,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:49:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [54] total 59 [2019-10-02 13:49:45,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-02 13:49:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-02 13:49:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=3291, Unknown=0, NotChecked=0, Total=3422 [2019-10-02 13:49:45,105 INFO L87 Difference]: Start difference. First operand 68481 states and 135333 transitions. Second operand 59 states. [2019-10-02 13:49:54,788 WARN L191 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-10-02 13:50:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:50:09,189 INFO L93 Difference]: Finished difference Result 138466 states and 296992 transitions. [2019-10-02 13:50:09,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-10-02 13:50:09,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 268 [2019-10-02 13:50:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:50:09,507 INFO L225 Difference]: With dead ends: 138466 [2019-10-02 13:50:09,507 INFO L226 Difference]: Without dead ends: 70065 [2019-10-02 13:50:09,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 276 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1554 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=670, Invalid=11540, Unknown=0, NotChecked=0, Total=12210 [2019-10-02 13:50:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70065 states. [2019-10-02 13:50:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70065 to 68987. [2019-10-02 13:50:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68987 states. [2019-10-02 13:50:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68987 states to 68987 states and 136140 transitions. [2019-10-02 13:50:14,089 INFO L78 Accepts]: Start accepts. Automaton has 68987 states and 136140 transitions. Word has length 268 [2019-10-02 13:50:14,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:50:14,089 INFO L475 AbstractCegarLoop]: Abstraction has 68987 states and 136140 transitions. [2019-10-02 13:50:14,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-02 13:50:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 68987 states and 136140 transitions. [2019-10-02 13:50:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 13:50:15,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:50:15,008 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:15,008 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:50:15,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:50:15,009 INFO L82 PathProgramCache]: Analyzing trace with hash -585791736, now seen corresponding path program 1 times [2019-10-02 13:50:15,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:50:15,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:50:15,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:15,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:15,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:50:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:50:16,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:50:16,459 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:50:16,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:50:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:50:17,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 3230 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:50:17,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:50:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:50:17,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:50:17,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 5] total 52 [2019-10-02 13:50:17,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 13:50:17,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 13:50:17,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=2540, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:50:17,340 INFO L87 Difference]: Start difference. First operand 68987 states and 136140 transitions. Second operand 52 states. [2019-10-02 13:50:49,968 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-02 13:51:07,928 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-10-02 13:51:30,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:30,557 INFO L93 Difference]: Finished difference Result 213654 states and 404977 transitions. [2019-10-02 13:51:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2019-10-02 13:51:30,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 268 [2019-10-02 13:51:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:31,351 INFO L225 Difference]: With dead ends: 213654 [2019-10-02 13:51:31,351 INFO L226 Difference]: Without dead ends: 169289 [2019-10-02 13:51:31,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 620 GetRequests, 335 SyntacticMatches, 2 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26064 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=5095, Invalid=75845, Unknown=0, NotChecked=0, Total=80940 [2019-10-02 13:51:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169289 states. [2019-10-02 13:51:43,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169289 to 138800. [2019-10-02 13:51:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138800 states. [2019-10-02 13:51:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138800 states to 138800 states and 272732 transitions. [2019-10-02 13:51:43,875 INFO L78 Accepts]: Start accepts. Automaton has 138800 states and 272732 transitions. Word has length 268 [2019-10-02 13:51:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:43,875 INFO L475 AbstractCegarLoop]: Abstraction has 138800 states and 272732 transitions. [2019-10-02 13:51:43,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-10-02 13:51:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 138800 states and 272732 transitions. [2019-10-02 13:51:44,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:51:44,358 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:44,359 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 13:51:44,359 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:44,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:44,359 INFO L82 PathProgramCache]: Analyzing trace with hash -432710140, now seen corresponding path program 1 times [2019-10-02 13:51:44,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:44,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:44,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:44,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:44,539 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:51:44,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:44,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:51:44,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:51:44,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:51:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:51:44,541 INFO L87 Difference]: Start difference. First operand 138800 states and 272732 transitions. Second operand 6 states. [2019-10-02 13:52:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:00,905 INFO L93 Difference]: Finished difference Result 273682 states and 537737 transitions. [2019-10-02 13:52:00,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 13:52:00,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2019-10-02 13:52:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:01,576 INFO L225 Difference]: With dead ends: 273682 [2019-10-02 13:52:01,576 INFO L226 Difference]: Without dead ends: 138805 [2019-10-02 13:52:02,246 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:52:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138805 states. [2019-10-02 13:52:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138805 to 138789. [2019-10-02 13:52:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138789 states. [2019-10-02 13:52:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138789 states to 138789 states and 271917 transitions. [2019-10-02 13:52:17,001 INFO L78 Accepts]: Start accepts. Automaton has 138789 states and 271917 transitions. Word has length 284 [2019-10-02 13:52:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:17,001 INFO L475 AbstractCegarLoop]: Abstraction has 138789 states and 271917 transitions. [2019-10-02 13:52:17,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:52:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 138789 states and 271917 transitions. [2019-10-02 13:52:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-02 13:52:17,390 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:17,391 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:17,391 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:17,391 INFO L82 PathProgramCache]: Analyzing trace with hash -171511054, now seen corresponding path program 1 times [2019-10-02 13:52:17,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:17,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:17,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:17,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 13:52:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-10-02 13:52:17,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:52:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:52:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:52:17,772 INFO L87 Difference]: Start difference. First operand 138789 states and 271917 transitions. Second operand 22 states. [2019-10-02 13:52:42,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:42,842 INFO L93 Difference]: Finished difference Result 192913 states and 377614 transitions. [2019-10-02 13:52:42,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 13:52:42,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 283 [2019-10-02 13:52:42,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:43,770 INFO L225 Difference]: With dead ends: 192913 [2019-10-02 13:52:43,770 INFO L226 Difference]: Without dead ends: 181089 [2019-10-02 13:52:43,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=2708, Unknown=0, NotChecked=0, Total=3080 [2019-10-02 13:52:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181089 states. [2019-10-02 13:53:02,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181089 to 178960. [2019-10-02 13:53:02,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178960 states. [2019-10-02 13:53:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178960 states to 178960 states and 355719 transitions. [2019-10-02 13:53:03,544 INFO L78 Accepts]: Start accepts. Automaton has 178960 states and 355719 transitions. Word has length 283 [2019-10-02 13:53:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:03,545 INFO L475 AbstractCegarLoop]: Abstraction has 178960 states and 355719 transitions. [2019-10-02 13:53:03,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:53:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 178960 states and 355719 transitions. [2019-10-02 13:53:05,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 13:53:05,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:05,036 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:05,036 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1493284832, now seen corresponding path program 1 times [2019-10-02 13:53:05,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:05,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:05,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-02 13:53:05,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:05,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:53:05,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:53:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:53:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:53:05,375 INFO L87 Difference]: Start difference. First operand 178960 states and 355719 transitions. Second operand 18 states. [2019-10-02 13:53:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:26,997 INFO L93 Difference]: Finished difference Result 214928 states and 412203 transitions. [2019-10-02 13:53:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 13:53:26,997 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 284 [2019-10-02 13:53:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:27,879 INFO L225 Difference]: With dead ends: 214928 [2019-10-02 13:53:27,879 INFO L226 Difference]: Without dead ends: 183594 [2019-10-02 13:53:28,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 13:53:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183594 states.