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_spec3_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:22:25,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:22:25,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:22:25,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:22:25,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:22:25,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:22:25,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:22:25,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:22:25,990 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:22:25,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:22:25,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:22:25,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:22:25,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:22:25,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:22:26,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:22:26,001 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:22:26,002 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:22:26,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:22:26,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:22:26,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:22:26,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:22:26,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:22:26,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:22:26,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:22:26,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:22:26,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:22:26,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:22:26,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:22:26,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:22:26,035 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:22:26,035 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:22:26,036 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:22:26,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:22:26,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:22:26,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:22:26,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:22:26,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:22:26,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:22:26,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:22:26,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:22:26,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:22:26,045 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:22:26,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:22:26,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:22:26,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:22:26,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:22:26,074 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:22:26,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:22:26,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:22:26,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:22:26,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:22:26,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:22:26,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:22:26,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:22:26,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:22:26,078 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:22:26,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:22:26,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:22:26,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:22:26,079 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:22:26,079 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:22:26,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:22:26,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:22:26,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:22:26,080 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:22:26,080 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:22:26,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:22:26,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:22:26,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:22:26,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:22:26,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:22:26,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:22:26,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:22:26,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:22:26,143 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:22:26,143 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:22:26,144 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product33.cil.c [2019-10-02 13:22:26,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae35c9141/02353d775b204bf29a55cecb15378671/FLAG502d16eba [2019-10-02 13:22:26,886 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:22:26,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product33.cil.c [2019-10-02 13:22:26,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae35c9141/02353d775b204bf29a55cecb15378671/FLAG502d16eba [2019-10-02 13:22:27,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae35c9141/02353d775b204bf29a55cecb15378671 [2019-10-02 13:22:27,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:22:27,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:22:27,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:22:27,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:22:27,088 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:22:27,089 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:22:27" (1/1) ... [2019-10-02 13:22:27,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34519ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:27, skipping insertion in model container [2019-10-02 13:22:27,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:22:27" (1/1) ... [2019-10-02 13:22:27,099 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:22:27,189 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:22:28,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:22:28,056 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:22:28,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:22:28,290 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:22:28,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28 WrapperNode [2019-10-02 13:22:28,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:22:28,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:22:28,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:22:28,294 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:22:28,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (1/1) ... [2019-10-02 13:22:28,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:22:28,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:22:28,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:22:28,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:22:28,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (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:22:28,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:22:28,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:22:28,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:22:28,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:22:28,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:22:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:22:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:22:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:22:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:22:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:22:28,594 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:22:28,594 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:22:28,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:22:28,595 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:22:28,596 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:22:28,596 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:22:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:22:28,598 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:22:28,599 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:22:28,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:22:28,599 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:22:28,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:22:28,599 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 13:22:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:22:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:22:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:22:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:22:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:22:28,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:22:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:22:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:22:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:22:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:22:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:22:28,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:22:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:22:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:22:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:22:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:22:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:22:28,602 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:22:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:22:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:22:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:22:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:22:28,603 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:22:28,604 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:22:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:22:28,606 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:22:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:22:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:22:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:22:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:22:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:22:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:22:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:22:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:22:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:22:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:22:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:22:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:22:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 13:22:28,610 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:22:28,610 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:22:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:22:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:22:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:22:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:22:28,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:22:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:22:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:22:28,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:22:28,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:22:28,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:22:28,613 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:22:28,614 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:22:28,614 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:22:28,614 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:22:28,614 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:22:28,615 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:22:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:22:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:22:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:22:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:22:28,616 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:22:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:22:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:22:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 13:22:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:22:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:22:28,617 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:22:28,618 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:22:28,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:22:28,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:22:28,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:22:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:22:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:22:28,619 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:22:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:22:28,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:22:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:22:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:22:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:22:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:22:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:22:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:22:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:22:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:22:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:22:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:22:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:22:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:22:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:22:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:22:28,624 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:22:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:22:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:22:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:22:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:22:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:22:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:22:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:22:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:22:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:22:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:22:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:22:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:22:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:22:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:22:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:22:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:22:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:22:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:22:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:22:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 13:22:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:22:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:22:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:22:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:22:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:22:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:22:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:22:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:22:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:22:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:22:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:22:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:22:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:22:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:22:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:22:28,646 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:22:28,647 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:22:28,647 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:22:28,647 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:22:28,647 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:22:28,647 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:22:28,647 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:22:28,648 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:22:28,648 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:22:28,648 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:22:28,648 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:22:28,648 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:22:28,648 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:22:28,649 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:22:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:22:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:22:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:22:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:22:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:22:28,650 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:22:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:22:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:22:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:22:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:22:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:22:28,651 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:22:28,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:22:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:22:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:22:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:22:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:22:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:22:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:22:28,654 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:22:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:22:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:22:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:22:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:22:28,655 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 13:22:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:22:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:22:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:22:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-10-02 13:22:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:22:28,656 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 13:22:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 13:22:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:22:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:22:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:22:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-10-02 13:22:28,657 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:22:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:22:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:22:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:22:28,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:22:30,844 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:22:30,845 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:22:30,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:22:30 BoogieIcfgContainer [2019-10-02 13:22:30,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:22:30,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:22:30,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:22:30,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:22:30,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:22:27" (1/3) ... [2019-10-02 13:22:30,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c478781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:22:30, skipping insertion in model container [2019-10-02 13:22:30,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:22:28" (2/3) ... [2019-10-02 13:22:30,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c478781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:22:30, skipping insertion in model container [2019-10-02 13:22:30,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:22:30" (3/3) ... [2019-10-02 13:22:30,858 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product33.cil.c [2019-10-02 13:22:30,870 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:22:30,890 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:22:30,912 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:22:30,970 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:22:30,971 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:22:30,971 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:22:30,975 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:22:30,975 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:22:30,975 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:22:30,975 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:22:30,976 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:22:30,976 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:22:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states. [2019-10-02 13:22:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 13:22:31,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:31,069 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:31,074 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -420941133, now seen corresponding path program 1 times [2019-10-02 13:22:31,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:31,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:31,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:31,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:31,923 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:31,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:31,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:22:31,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:22:31,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:22:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:22:31,949 INFO L87 Difference]: Start difference. First operand 602 states. Second operand 2 states. [2019-10-02 13:22:32,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:32,048 INFO L93 Difference]: Finished difference Result 935 states and 1233 transitions. [2019-10-02 13:22:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:22:32,050 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 195 [2019-10-02 13:22:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:32,076 INFO L225 Difference]: With dead ends: 935 [2019-10-02 13:22:32,076 INFO L226 Difference]: Without dead ends: 579 [2019-10-02 13:22:32,084 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:22:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-02 13:22:32,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-02 13:22:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-02 13:22:32,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 765 transitions. [2019-10-02 13:22:32,209 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 765 transitions. Word has length 195 [2019-10-02 13:22:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:32,211 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 765 transitions. [2019-10-02 13:22:32,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:22:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 765 transitions. [2019-10-02 13:22:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:22:32,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:32,217 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:32,218 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:32,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1855300541, now seen corresponding path program 1 times [2019-10-02 13:22:32,219 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:32,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:32,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:32,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:32,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:32,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:32,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:32,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:32,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:32,481 INFO L87 Difference]: Start difference. First operand 579 states and 765 transitions. Second operand 3 states. [2019-10-02 13:22:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:32,585 INFO L93 Difference]: Finished difference Result 918 states and 1196 transitions. [2019-10-02 13:22:32,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:32,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:22:32,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:32,604 INFO L225 Difference]: With dead ends: 918 [2019-10-02 13:22:32,605 INFO L226 Difference]: Without dead ends: 582 [2019-10-02 13:22:32,610 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:22:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-02 13:22:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 581. [2019-10-02 13:22:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 13:22:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 767 transitions. [2019-10-02 13:22:32,652 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 767 transitions. Word has length 196 [2019-10-02 13:22:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:32,653 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 767 transitions. [2019-10-02 13:22:32,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 767 transitions. [2019-10-02 13:22:32,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 13:22:32,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:32,658 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:32,659 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:32,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2077671956, now seen corresponding path program 1 times [2019-10-02 13:22:32,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:32,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:32,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:32,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:32,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:32,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:32,950 INFO L87 Difference]: Start difference. First operand 581 states and 767 transitions. Second operand 3 states. [2019-10-02 13:22:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:33,007 INFO L93 Difference]: Finished difference Result 1140 states and 1535 transitions. [2019-10-02 13:22:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:33,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-10-02 13:22:33,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:33,016 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 13:22:33,017 INFO L226 Difference]: Without dead ends: 624 [2019-10-02 13:22:33,019 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:22:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-10-02 13:22:33,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 623. [2019-10-02 13:22:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 13:22:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 839 transitions. [2019-10-02 13:22:33,075 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 839 transitions. Word has length 208 [2019-10-02 13:22:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:33,076 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 839 transitions. [2019-10-02 13:22:33,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 839 transitions. [2019-10-02 13:22:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 13:22:33,083 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:33,084 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:33,084 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash -339129856, now seen corresponding path program 1 times [2019-10-02 13:22:33,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:33,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:33,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:22:33,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:22:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:22:33,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:22:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:22:33,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:22:33,374 INFO L87 Difference]: Start difference. First operand 623 states and 839 transitions. Second operand 3 states. [2019-10-02 13:22:33,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:33,435 INFO L93 Difference]: Finished difference Result 1263 states and 1746 transitions. [2019-10-02 13:22:33,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:22:33,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-02 13:22:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:33,446 INFO L225 Difference]: With dead ends: 1263 [2019-10-02 13:22:33,446 INFO L226 Difference]: Without dead ends: 705 [2019-10-02 13:22:33,450 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:22:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-10-02 13:22:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 704. [2019-10-02 13:22:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-10-02 13:22:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 977 transitions. [2019-10-02 13:22:33,510 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 977 transitions. Word has length 209 [2019-10-02 13:22:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:33,511 INFO L475 AbstractCegarLoop]: Abstraction has 704 states and 977 transitions. [2019-10-02 13:22:33,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:22:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 977 transitions. [2019-10-02 13:22:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 13:22:33,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:33,520 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:33,520 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:33,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:33,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1667814782, now seen corresponding path program 1 times [2019-10-02 13:22:33,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:33,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:33,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:22:34,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:34,123 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:22:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:34,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 2993 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:34,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 13:22:35,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:35,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-10-02 13:22:35,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:22:35,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:22:35,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:22:35,209 INFO L87 Difference]: Start difference. First operand 704 states and 977 transitions. Second operand 26 states. [2019-10-02 13:22:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:46,258 INFO L93 Difference]: Finished difference Result 2769 states and 3880 transitions. [2019-10-02 13:22:46,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:22:46,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 212 [2019-10-02 13:22:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:46,288 INFO L225 Difference]: With dead ends: 2769 [2019-10-02 13:22:46,289 INFO L226 Difference]: Without dead ends: 2101 [2019-10-02 13:22:46,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=5172, Unknown=0, NotChecked=0, Total=5700 [2019-10-02 13:22:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-10-02 13:22:46,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2061. [2019-10-02 13:22:46,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-10-02 13:22:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2866 transitions. [2019-10-02 13:22:46,483 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2866 transitions. Word has length 212 [2019-10-02 13:22:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:46,484 INFO L475 AbstractCegarLoop]: Abstraction has 2061 states and 2866 transitions. [2019-10-02 13:22:46,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:22:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2866 transitions. [2019-10-02 13:22:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-02 13:22:46,495 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:46,496 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] [2019-10-02 13:22:46,496 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1861716502, now seen corresponding path program 1 times [2019-10-02 13:22:46,497 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:46,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:46,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:46,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:46,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:46,855 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:22:46,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:46,856 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:22:47,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:47,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 2993 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:22:47,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 13:22:47,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:47,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-10-02 13:22:47,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:22:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:22:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:22:47,735 INFO L87 Difference]: Start difference. First operand 2061 states and 2866 transitions. Second operand 16 states. [2019-10-02 13:22:50,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:22:50,614 INFO L93 Difference]: Finished difference Result 4149 states and 5828 transitions. [2019-10-02 13:22:50,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:22:50,615 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 214 [2019-10-02 13:22:50,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:22:50,630 INFO L225 Difference]: With dead ends: 4149 [2019-10-02 13:22:50,630 INFO L226 Difference]: Without dead ends: 2123 [2019-10-02 13:22:50,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-10-02 13:22:50,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-10-02 13:22:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2123. [2019-10-02 13:22:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2123 states. [2019-10-02 13:22:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2123 states to 2123 states and 2968 transitions. [2019-10-02 13:22:50,746 INFO L78 Accepts]: Start accepts. Automaton has 2123 states and 2968 transitions. Word has length 214 [2019-10-02 13:22:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:22:50,747 INFO L475 AbstractCegarLoop]: Abstraction has 2123 states and 2968 transitions. [2019-10-02 13:22:50,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:22:50,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 2968 transitions. [2019-10-02 13:22:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 13:22:50,754 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:22:50,754 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:22:50,755 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:22:50,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:22:50,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1939475813, now seen corresponding path program 1 times [2019-10-02 13:22:50,755 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:22:50,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:22:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:50,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:50,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:22:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:22:51,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:22:51,094 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:22:51,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:22:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:22:51,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 2996 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:22:51,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:22:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:22:52,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:22:52,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 22 [2019-10-02 13:22:52,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 13:22:52,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 13:22:52,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:22:52,030 INFO L87 Difference]: Start difference. First operand 2123 states and 2968 transitions. Second operand 22 states. [2019-10-02 13:23:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:00,959 INFO L93 Difference]: Finished difference Result 4314 states and 6105 transitions. [2019-10-02 13:23:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:23:00,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2019-10-02 13:23:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:00,976 INFO L225 Difference]: With dead ends: 4314 [2019-10-02 13:23:00,976 INFO L226 Difference]: Without dead ends: 2252 [2019-10-02 13:23:00,984 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=4228, Unknown=0, NotChecked=0, Total=4692 [2019-10-02 13:23:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-10-02 13:23:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2207. [2019-10-02 13:23:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2207 states. [2019-10-02 13:23:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2207 states to 2207 states and 3102 transitions. [2019-10-02 13:23:01,105 INFO L78 Accepts]: Start accepts. Automaton has 2207 states and 3102 transitions. Word has length 215 [2019-10-02 13:23:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:01,106 INFO L475 AbstractCegarLoop]: Abstraction has 2207 states and 3102 transitions. [2019-10-02 13:23:01,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 13:23:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2207 states and 3102 transitions. [2019-10-02 13:23:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:23:01,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:01,115 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:01,115 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:01,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1619834895, now seen corresponding path program 1 times [2019-10-02 13:23:01,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:01,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:01,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:01,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:23:01,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:01,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:23:01,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:23:01,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:23:01,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:23:01,426 INFO L87 Difference]: Start difference. First operand 2207 states and 3102 transitions. Second operand 16 states. [2019-10-02 13:23:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:01,934 INFO L93 Difference]: Finished difference Result 3712 states and 5129 transitions. [2019-10-02 13:23:01,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:23:01,935 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 216 [2019-10-02 13:23:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:01,954 INFO L225 Difference]: With dead ends: 3712 [2019-10-02 13:23:01,955 INFO L226 Difference]: Without dead ends: 2230 [2019-10-02 13:23:01,963 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:23:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2019-10-02 13:23:02,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 2202. [2019-10-02 13:23:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states. [2019-10-02 13:23:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3071 transitions. [2019-10-02 13:23:02,094 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3071 transitions. Word has length 216 [2019-10-02 13:23:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:02,095 INFO L475 AbstractCegarLoop]: Abstraction has 2202 states and 3071 transitions. [2019-10-02 13:23:02,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:23:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3071 transitions. [2019-10-02 13:23:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 13:23:02,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:02,104 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:02,104 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash -208645030, now seen corresponding path program 1 times [2019-10-02 13:23:02,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:02,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:23:02,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:02,331 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:23:02,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:03,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 2997 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:23:03,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:23:03,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:03,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-10-02 13:23:03,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:23:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:23:03,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:23:03,224 INFO L87 Difference]: Start difference. First operand 2202 states and 3071 transitions. Second operand 12 states. [2019-10-02 13:23:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:08,393 INFO L93 Difference]: Finished difference Result 6833 states and 9578 transitions. [2019-10-02 13:23:08,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 13:23:08,394 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 216 [2019-10-02 13:23:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:08,424 INFO L225 Difference]: With dead ends: 6833 [2019-10-02 13:23:08,424 INFO L226 Difference]: Without dead ends: 4706 [2019-10-02 13:23:08,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:23:08,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4706 states. [2019-10-02 13:23:08,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4706 to 4673. [2019-10-02 13:23:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4673 states. [2019-10-02 13:23:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 6500 transitions. [2019-10-02 13:23:08,672 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 6500 transitions. Word has length 216 [2019-10-02 13:23:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:08,672 INFO L475 AbstractCegarLoop]: Abstraction has 4673 states and 6500 transitions. [2019-10-02 13:23:08,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:23:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 6500 transitions. [2019-10-02 13:23:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 13:23:08,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:08,683 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:08,684 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash 997602436, now seen corresponding path program 1 times [2019-10-02 13:23:08,684 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:08,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:08,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:23:08,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:08,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 13:23:08,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 13:23:08,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 13:23:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 13:23:08,984 INFO L87 Difference]: Start difference. First operand 4673 states and 6500 transitions. Second operand 12 states. [2019-10-02 13:23:22,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:22,870 INFO L93 Difference]: Finished difference Result 32635 states and 43631 transitions. [2019-10-02 13:23:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 13:23:22,871 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 217 [2019-10-02 13:23:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:23,039 INFO L225 Difference]: With dead ends: 32635 [2019-10-02 13:23:23,040 INFO L226 Difference]: Without dead ends: 25215 [2019-10-02 13:23:23,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2019-10-02 13:23:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25215 states. [2019-10-02 13:23:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25215 to 24183. [2019-10-02 13:23:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24183 states. [2019-10-02 13:23:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24183 states to 24183 states and 32227 transitions. [2019-10-02 13:23:25,583 INFO L78 Accepts]: Start accepts. Automaton has 24183 states and 32227 transitions. Word has length 217 [2019-10-02 13:23:25,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:25,584 INFO L475 AbstractCegarLoop]: Abstraction has 24183 states and 32227 transitions. [2019-10-02 13:23:25,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 13:23:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24183 states and 32227 transitions. [2019-10-02 13:23:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 13:23:25,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:25,600 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:25,600 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1139047270, now seen corresponding path program 1 times [2019-10-02 13:23:25,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:25,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:25,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:25,970 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:23:25,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:25,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 13:23:25,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:23:25,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:23:25,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:23:25,972 INFO L87 Difference]: Start difference. First operand 24183 states and 32227 transitions. Second operand 18 states. [2019-10-02 13:23:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:26,809 INFO L93 Difference]: Finished difference Result 42458 states and 56173 transitions. [2019-10-02 13:23:26,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:23:26,810 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 218 [2019-10-02 13:23:26,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:26,880 INFO L225 Difference]: With dead ends: 42458 [2019-10-02 13:23:26,880 INFO L226 Difference]: Without dead ends: 15361 [2019-10-02 13:23:26,954 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:23:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15361 states. [2019-10-02 13:23:28,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15361 to 14037. [2019-10-02 13:23:28,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14037 states. [2019-10-02 13:23:28,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14037 states to 14037 states and 18774 transitions. [2019-10-02 13:23:28,088 INFO L78 Accepts]: Start accepts. Automaton has 14037 states and 18774 transitions. Word has length 218 [2019-10-02 13:23:28,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:28,090 INFO L475 AbstractCegarLoop]: Abstraction has 14037 states and 18774 transitions. [2019-10-02 13:23:28,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:23:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14037 states and 18774 transitions. [2019-10-02 13:23:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 13:23:28,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:28,104 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:28,104 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:28,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:28,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2010049684, now seen corresponding path program 1 times [2019-10-02 13:23:28,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:28,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:28,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:28,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 13:23:28,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:28,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:23:28,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:23:28,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:23:28,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:23:28,318 INFO L87 Difference]: Start difference. First operand 14037 states and 18774 transitions. Second operand 8 states. [2019-10-02 13:23:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:30,966 INFO L93 Difference]: Finished difference Result 37650 states and 50052 transitions. [2019-10-02 13:23:30,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:23:30,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 13:23:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:31,079 INFO L225 Difference]: With dead ends: 37650 [2019-10-02 13:23:31,080 INFO L226 Difference]: Without dead ends: 27751 [2019-10-02 13:23:31,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27751 states. [2019-10-02 13:23:32,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27751 to 27195. [2019-10-02 13:23:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27195 states. [2019-10-02 13:23:32,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27195 states to 27195 states and 36201 transitions. [2019-10-02 13:23:32,431 INFO L78 Accepts]: Start accepts. Automaton has 27195 states and 36201 transitions. Word has length 227 [2019-10-02 13:23:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:32,432 INFO L475 AbstractCegarLoop]: Abstraction has 27195 states and 36201 transitions. [2019-10-02 13:23:32,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:23:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27195 states and 36201 transitions. [2019-10-02 13:23:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 13:23:32,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:32,451 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:32,451 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:32,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1554149145, now seen corresponding path program 1 times [2019-10-02 13:23:32,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:32,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:32,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:32,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:32,750 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:23:32,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:32,752 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:23:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:33,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 3042 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:23:33,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:23:33,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:33,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 20 [2019-10-02 13:23:33,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 13:23:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 13:23:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2019-10-02 13:23:33,651 INFO L87 Difference]: Start difference. First operand 27195 states and 36201 transitions. Second operand 20 states. [2019-10-02 13:23:41,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:41,701 INFO L93 Difference]: Finished difference Result 55748 states and 74877 transitions. [2019-10-02 13:23:41,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 13:23:41,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 228 [2019-10-02 13:23:41,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:41,827 INFO L225 Difference]: With dead ends: 55748 [2019-10-02 13:23:41,827 INFO L226 Difference]: Without dead ends: 28633 [2019-10-02 13:23:41,885 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=3969, Unknown=0, NotChecked=0, Total=4422 [2019-10-02 13:23:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28633 states. [2019-10-02 13:23:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28633 to 27162. [2019-10-02 13:23:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27162 states. [2019-10-02 13:23:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27162 states to 27162 states and 36159 transitions. [2019-10-02 13:23:43,203 INFO L78 Accepts]: Start accepts. Automaton has 27162 states and 36159 transitions. Word has length 228 [2019-10-02 13:23:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:43,204 INFO L475 AbstractCegarLoop]: Abstraction has 27162 states and 36159 transitions. [2019-10-02 13:23:43,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 13:23:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 27162 states and 36159 transitions. [2019-10-02 13:23:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:23:43,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:43,224 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:43,224 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:43,225 INFO L82 PathProgramCache]: Analyzing trace with hash -265227416, now seen corresponding path program 1 times [2019-10-02 13:23:43,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:43,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:43,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:43,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:43,632 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 13:23:43,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:23:43,633 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:23:43,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:44,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 3042 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:23:44,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:23:44,440 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 13:23:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:23:44,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2019-10-02 13:23:44,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 13:23:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 13:23:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=802, Unknown=0, NotChecked=0, Total=870 [2019-10-02 13:23:44,450 INFO L87 Difference]: Start difference. First operand 27162 states and 36159 transitions. Second operand 30 states. [2019-10-02 13:23:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:23:57,684 INFO L93 Difference]: Finished difference Result 56357 states and 75612 transitions. [2019-10-02 13:23:57,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-10-02 13:23:57,684 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 229 [2019-10-02 13:23:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:23:57,793 INFO L225 Difference]: With dead ends: 56357 [2019-10-02 13:23:57,793 INFO L226 Difference]: Without dead ends: 28813 [2019-10-02 13:23:57,843 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1912 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=659, Invalid=7351, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 13:23:57,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28813 states. [2019-10-02 13:23:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28813 to 27939. [2019-10-02 13:23:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27939 states. [2019-10-02 13:23:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27939 states to 27939 states and 37190 transitions. [2019-10-02 13:23:58,875 INFO L78 Accepts]: Start accepts. Automaton has 27939 states and 37190 transitions. Word has length 229 [2019-10-02 13:23:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:23:58,876 INFO L475 AbstractCegarLoop]: Abstraction has 27939 states and 37190 transitions. [2019-10-02 13:23:58,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 13:23:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 27939 states and 37190 transitions. [2019-10-02 13:23:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:23:58,897 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:23:58,897 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:23:58,898 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:23:58,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:23:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash 698297302, now seen corresponding path program 1 times [2019-10-02 13:23:58,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:23:58,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:23:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:58,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:23:58,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:23:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:23:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:23:59,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:23:59,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:23:59,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:23:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:23:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:23:59,131 INFO L87 Difference]: Start difference. First operand 27939 states and 37190 transitions. Second operand 13 states. [2019-10-02 13:24:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:00,151 INFO L93 Difference]: Finished difference Result 41228 states and 55283 transitions. [2019-10-02 13:24:00,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:24:00,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 230 [2019-10-02 13:24:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:00,240 INFO L225 Difference]: With dead ends: 41228 [2019-10-02 13:24:00,240 INFO L226 Difference]: Without dead ends: 30228 [2019-10-02 13:24:00,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:24:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30228 states. [2019-10-02 13:24:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30228 to 28826. [2019-10-02 13:24:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28826 states. [2019-10-02 13:24:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28826 states to 28826 states and 38630 transitions. [2019-10-02 13:24:01,234 INFO L78 Accepts]: Start accepts. Automaton has 28826 states and 38630 transitions. Word has length 230 [2019-10-02 13:24:01,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:01,234 INFO L475 AbstractCegarLoop]: Abstraction has 28826 states and 38630 transitions. [2019-10-02 13:24:01,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:24:01,235 INFO L276 IsEmpty]: Start isEmpty. Operand 28826 states and 38630 transitions. [2019-10-02 13:24:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:24:01,257 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:01,257 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:24:01,257 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1768257344, now seen corresponding path program 2 times [2019-10-02 13:24:01,258 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:01,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:01,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:01,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:01,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:01,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:01,453 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:24:01,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:24:02,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:24:02,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:24:02,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 3043 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-02 13:24:02,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:24:02,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:24:02,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-10-02 13:24:02,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:24:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:24:02,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:24:02,292 INFO L87 Difference]: Start difference. First operand 28826 states and 38630 transitions. Second operand 18 states. [2019-10-02 13:24:03,496 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-10-02 13:24:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:13,478 INFO L93 Difference]: Finished difference Result 76962 states and 103175 transitions. [2019-10-02 13:24:13,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:24:13,479 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2019-10-02 13:24:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:13,647 INFO L225 Difference]: With dead ends: 76962 [2019-10-02 13:24:13,647 INFO L226 Difference]: Without dead ends: 45891 [2019-10-02 13:24:13,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=1709, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 13:24:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45891 states. [2019-10-02 13:24:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45891 to 39734. [2019-10-02 13:24:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39734 states. [2019-10-02 13:24:16,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39734 states to 39734 states and 53018 transitions. [2019-10-02 13:24:16,705 INFO L78 Accepts]: Start accepts. Automaton has 39734 states and 53018 transitions. Word has length 230 [2019-10-02 13:24:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:16,706 INFO L475 AbstractCegarLoop]: Abstraction has 39734 states and 53018 transitions. [2019-10-02 13:24:16,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:24:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 39734 states and 53018 transitions. [2019-10-02 13:24:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:24:16,738 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:16,738 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:16,738 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1627219553, now seen corresponding path program 1 times [2019-10-02 13:24:16,739 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:16,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:16,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:16,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:24:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:24:17,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:24:17,238 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:24:17,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:17,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 3042 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 13:24:17,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:24:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:17,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:24:17,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4] total 24 [2019-10-02 13:24:17,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 13:24:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 13:24:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-10-02 13:24:17,996 INFO L87 Difference]: Start difference. First operand 39734 states and 53018 transitions. Second operand 24 states. [2019-10-02 13:24:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:25,556 INFO L93 Difference]: Finished difference Result 80489 states and 107480 transitions. [2019-10-02 13:24:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:24:25,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 231 [2019-10-02 13:24:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:25,702 INFO L225 Difference]: With dead ends: 80489 [2019-10-02 13:24:25,703 INFO L226 Difference]: Without dead ends: 40883 [2019-10-02 13:24:25,774 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2019-10-02 13:24:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40883 states. [2019-10-02 13:24:27,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40883 to 39270. [2019-10-02 13:24:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39270 states. [2019-10-02 13:24:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39270 states to 39270 states and 52442 transitions. [2019-10-02 13:24:27,145 INFO L78 Accepts]: Start accepts. Automaton has 39270 states and 52442 transitions. Word has length 231 [2019-10-02 13:24:27,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:27,145 INFO L475 AbstractCegarLoop]: Abstraction has 39270 states and 52442 transitions. [2019-10-02 13:24:27,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 13:24:27,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39270 states and 52442 transitions. [2019-10-02 13:24:27,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 13:24:27,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:27,163 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:27,164 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:27,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:27,164 INFO L82 PathProgramCache]: Analyzing trace with hash -767897967, now seen corresponding path program 1 times [2019-10-02 13:24:27,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:27,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:27,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:27,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:27,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:27,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:27,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:27,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:27,331 INFO L87 Difference]: Start difference. First operand 39270 states and 52442 transitions. Second operand 3 states. [2019-10-02 13:24:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:28,622 INFO L93 Difference]: Finished difference Result 79300 states and 106436 transitions. [2019-10-02 13:24:28,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:28,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-10-02 13:24:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:28,722 INFO L225 Difference]: With dead ends: 79300 [2019-10-02 13:24:28,722 INFO L226 Difference]: Without dead ends: 40216 [2019-10-02 13:24:28,777 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:24:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40216 states. [2019-10-02 13:24:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40216 to 40134. [2019-10-02 13:24:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40134 states. [2019-10-02 13:24:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40134 states to 40134 states and 54092 transitions. [2019-10-02 13:24:30,119 INFO L78 Accepts]: Start accepts. Automaton has 40134 states and 54092 transitions. Word has length 229 [2019-10-02 13:24:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:30,120 INFO L475 AbstractCegarLoop]: Abstraction has 40134 states and 54092 transitions. [2019-10-02 13:24:30,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 40134 states and 54092 transitions. [2019-10-02 13:24:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 13:24:30,136 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:30,136 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:30,137 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 965105857, now seen corresponding path program 1 times [2019-10-02 13:24:30,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:30,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:30,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:30,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:30,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:31,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:31,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:31,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:31,755 INFO L87 Difference]: Start difference. First operand 40134 states and 54092 transitions. Second operand 3 states. [2019-10-02 13:24:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:32,800 INFO L93 Difference]: Finished difference Result 81884 states and 111292 transitions. [2019-10-02 13:24:32,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:32,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-10-02 13:24:32,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:32,913 INFO L225 Difference]: With dead ends: 81884 [2019-10-02 13:24:32,913 INFO L226 Difference]: Without dead ends: 41952 [2019-10-02 13:24:32,971 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:24:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41952 states. [2019-10-02 13:24:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41952 to 41328. [2019-10-02 13:24:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41328 states. [2019-10-02 13:24:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41328 states to 41328 states and 56573 transitions. [2019-10-02 13:24:34,680 INFO L78 Accepts]: Start accepts. Automaton has 41328 states and 56573 transitions. Word has length 230 [2019-10-02 13:24:34,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:34,681 INFO L475 AbstractCegarLoop]: Abstraction has 41328 states and 56573 transitions. [2019-10-02 13:24:34,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:34,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41328 states and 56573 transitions. [2019-10-02 13:24:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-02 13:24:34,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:34,704 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:34,705 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:34,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash -324343247, now seen corresponding path program 1 times [2019-10-02 13:24:34,705 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:34,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:34,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:34,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:34,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:34,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:34,848 INFO L87 Difference]: Start difference. First operand 41328 states and 56573 transitions. Second operand 3 states. [2019-10-02 13:24:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:36,146 INFO L93 Difference]: Finished difference Result 85904 states and 119222 transitions. [2019-10-02 13:24:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:36,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 231 [2019-10-02 13:24:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:36,268 INFO L225 Difference]: With dead ends: 85904 [2019-10-02 13:24:36,268 INFO L226 Difference]: Without dead ends: 44802 [2019-10-02 13:24:36,334 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:24:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44802 states. [2019-10-02 13:24:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44802 to 44758. [2019-10-02 13:24:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44758 states. [2019-10-02 13:24:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44758 states to 44758 states and 62777 transitions. [2019-10-02 13:24:38,332 INFO L78 Accepts]: Start accepts. Automaton has 44758 states and 62777 transitions. Word has length 231 [2019-10-02 13:24:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:38,332 INFO L475 AbstractCegarLoop]: Abstraction has 44758 states and 62777 transitions. [2019-10-02 13:24:38,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 44758 states and 62777 transitions. [2019-10-02 13:24:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:24:38,382 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:38,382 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:38,382 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:38,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1293450529, now seen corresponding path program 1 times [2019-10-02 13:24:38,383 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:38,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:38,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:38,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:38,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:38,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:38,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:38,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:38,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:38,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:38,518 INFO L87 Difference]: Start difference. First operand 44758 states and 62777 transitions. Second operand 3 states. [2019-10-02 13:24:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:39,841 INFO L93 Difference]: Finished difference Result 95904 states and 137454 transitions. [2019-10-02 13:24:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:39,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 13:24:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:40,071 INFO L225 Difference]: With dead ends: 95904 [2019-10-02 13:24:40,071 INFO L226 Difference]: Without dead ends: 51392 [2019-10-02 13:24:40,153 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:24:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51392 states. [2019-10-02 13:24:42,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51392 to 51386. [2019-10-02 13:24:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51386 states. [2019-10-02 13:24:42,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51386 states to 51386 states and 74779 transitions. [2019-10-02 13:24:42,447 INFO L78 Accepts]: Start accepts. Automaton has 51386 states and 74779 transitions. Word has length 232 [2019-10-02 13:24:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:42,447 INFO L475 AbstractCegarLoop]: Abstraction has 51386 states and 74779 transitions. [2019-10-02 13:24:42,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 51386 states and 74779 transitions. [2019-10-02 13:24:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 13:24:42,543 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:42,544 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:42,544 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:42,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1247086033, now seen corresponding path program 1 times [2019-10-02 13:24:42,544 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:42,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:42,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:42,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:42,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:42,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:42,689 INFO L87 Difference]: Start difference. First operand 51386 states and 74779 transitions. Second operand 3 states. [2019-10-02 13:24:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:46,101 INFO L93 Difference]: Finished difference Result 115196 states and 172096 transitions. [2019-10-02 13:24:46,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:46,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-02 13:24:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:46,274 INFO L225 Difference]: With dead ends: 115196 [2019-10-02 13:24:46,274 INFO L226 Difference]: Without dead ends: 64068 [2019-10-02 13:24:46,348 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:24:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64068 states. [2019-10-02 13:24:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64068 to 63986. [2019-10-02 13:24:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63986 states. [2019-10-02 13:24:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63986 states to 63986 states and 97149 transitions. [2019-10-02 13:24:48,952 INFO L78 Accepts]: Start accepts. Automaton has 63986 states and 97149 transitions. Word has length 233 [2019-10-02 13:24:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:48,953 INFO L475 AbstractCegarLoop]: Abstraction has 63986 states and 97149 transitions. [2019-10-02 13:24:48,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 63986 states and 97149 transitions. [2019-10-02 13:24:49,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-02 13:24:49,066 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:49,067 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:49,067 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:49,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:49,067 INFO L82 PathProgramCache]: Analyzing trace with hash -839671423, now seen corresponding path program 1 times [2019-10-02 13:24:49,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:49,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:49,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:49,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:49,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:49,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:49,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:49,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:49,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:49,196 INFO L87 Difference]: Start difference. First operand 63986 states and 97149 transitions. Second operand 3 states. [2019-10-02 13:24:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:24:52,242 INFO L93 Difference]: Finished difference Result 153444 states and 240058 transitions. [2019-10-02 13:24:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:24:52,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-10-02 13:24:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:24:52,519 INFO L225 Difference]: With dead ends: 153444 [2019-10-02 13:24:52,519 INFO L226 Difference]: Without dead ends: 89724 [2019-10-02 13:24:52,641 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:24:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89724 states. [2019-10-02 13:24:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89724 to 89718. [2019-10-02 13:24:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89718 states. [2019-10-02 13:24:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89718 states to 89718 states and 142463 transitions. [2019-10-02 13:24:59,189 INFO L78 Accepts]: Start accepts. Automaton has 89718 states and 142463 transitions. Word has length 234 [2019-10-02 13:24:59,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:24:59,189 INFO L475 AbstractCegarLoop]: Abstraction has 89718 states and 142463 transitions. [2019-10-02 13:24:59,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:24:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 89718 states and 142463 transitions. [2019-10-02 13:24:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 13:24:59,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:24:59,433 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:24:59,433 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:24:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:24:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash -432856719, now seen corresponding path program 1 times [2019-10-02 13:24:59,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:24:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:24:59,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:59,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:24:59,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:24:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:24:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:24:59,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:24:59,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:24:59,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:24:59,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:24:59,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:24:59,574 INFO L87 Difference]: Start difference. First operand 89718 states and 142463 transitions. Second operand 3 states. [2019-10-02 13:25:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:07,478 INFO L93 Difference]: Finished difference Result 226788 states and 368302 transitions. [2019-10-02 13:25:07,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:25:07,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-02 13:25:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:07,868 INFO L225 Difference]: With dead ends: 226788 [2019-10-02 13:25:07,868 INFO L226 Difference]: Without dead ends: 137352 [2019-10-02 13:25:08,009 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:25:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137352 states. [2019-10-02 13:25:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137352 to 137346. [2019-10-02 13:25:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137346 states. [2019-10-02 13:25:18,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137346 states to 137346 states and 224649 transitions. [2019-10-02 13:25:18,487 INFO L78 Accepts]: Start accepts. Automaton has 137346 states and 224649 transitions. Word has length 235 [2019-10-02 13:25:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:18,488 INFO L475 AbstractCegarLoop]: Abstraction has 137346 states and 224649 transitions. [2019-10-02 13:25:18,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:25:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 137346 states and 224649 transitions. [2019-10-02 13:25:18,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 13:25:18,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:18,889 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:25:18,889 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1248338337, now seen corresponding path program 1 times [2019-10-02 13:25:18,890 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:18,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:18,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:18,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:18,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:19,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:19,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:19,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:19,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:19,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:19,035 INFO L87 Difference]: Start difference. First operand 137346 states and 224649 transitions. Second operand 3 states. [2019-10-02 13:25:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:25:31,751 INFO L93 Difference]: Finished difference Result 365024 states and 605600 transitions. [2019-10-02 13:25:31,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:25:31,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-10-02 13:25:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:25:32,486 INFO L225 Difference]: With dead ends: 365024 [2019-10-02 13:25:32,487 INFO L226 Difference]: Without dead ends: 227980 [2019-10-02 13:25:32,720 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:25:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227980 states. [2019-10-02 13:25:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227980 to 227974. [2019-10-02 13:25:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227974 states. [2019-10-02 13:25:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227974 states to 227974 states and 378251 transitions. [2019-10-02 13:25:51,024 INFO L78 Accepts]: Start accepts. Automaton has 227974 states and 378251 transitions. Word has length 236 [2019-10-02 13:25:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:25:51,025 INFO L475 AbstractCegarLoop]: Abstraction has 227974 states and 378251 transitions. [2019-10-02 13:25:51,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:25:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 227974 states and 378251 transitions. [2019-10-02 13:25:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 13:25:51,791 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:25:51,791 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:25:51,791 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:25:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:25:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash 176311505, now seen corresponding path program 1 times [2019-10-02 13:25:51,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:25:51,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:25:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:51,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:25:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:25:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:25:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:25:51,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:25:51,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:25:51,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:25:51,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:25:51,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:25:51,925 INFO L87 Difference]: Start difference. First operand 227974 states and 378251 transitions. Second operand 3 states. [2019-10-02 13:26:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:26:13,698 INFO L93 Difference]: Finished difference Result 436312 states and 717987 transitions. [2019-10-02 13:26:13,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:26:13,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-02 13:26:13,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:26:14,951 INFO L225 Difference]: With dead ends: 436312 [2019-10-02 13:26:14,951 INFO L226 Difference]: Without dead ends: 399988 [2019-10-02 13:26:15,091 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:26:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399988 states. [2019-10-02 13:26:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399988 to 399982. [2019-10-02 13:26:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399982 states. [2019-10-02 13:26:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399982 states to 399982 states and 663915 transitions. [2019-10-02 13:26:47,463 INFO L78 Accepts]: Start accepts. Automaton has 399982 states and 663915 transitions. Word has length 237 [2019-10-02 13:26:47,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:26:47,463 INFO L475 AbstractCegarLoop]: Abstraction has 399982 states and 663915 transitions. [2019-10-02 13:26:47,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:26:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 399982 states and 663915 transitions. [2019-10-02 13:26:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:26:48,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:26:48,752 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:26:48,752 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:26:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:26:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1698032383, now seen corresponding path program 1 times [2019-10-02 13:26:48,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:26:48,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:26:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:48,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:26:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:49,092 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 13:26:49,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:26:49,093 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:26:49,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:26:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:26:49,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 3070 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:26:49,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:26:50,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 13:26:50,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:26:50,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [18] total 32 [2019-10-02 13:26:50,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-02 13:26:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-02 13:26:50,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2019-10-02 13:26:50,125 INFO L87 Difference]: Start difference. First operand 399982 states and 663915 transitions. Second operand 32 states. [2019-10-02 13:27:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:27:26,110 INFO L93 Difference]: Finished difference Result 430062 states and 703516 transitions. [2019-10-02 13:27:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 13:27:26,110 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 238 [2019-10-02 13:27:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:27:28,169 INFO L225 Difference]: With dead ends: 430062 [2019-10-02 13:27:28,169 INFO L226 Difference]: Without dead ends: 409132 [2019-10-02 13:27:28,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=385, Invalid=2807, Unknown=0, NotChecked=0, Total=3192 [2019-10-02 13:27:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409132 states. [2019-10-02 13:27:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409132 to 408032. [2019-10-02 13:27:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408032 states. [2019-10-02 13:28:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408032 states to 408032 states and 674221 transitions. [2019-10-02 13:28:09,997 INFO L78 Accepts]: Start accepts. Automaton has 408032 states and 674221 transitions. Word has length 238 [2019-10-02 13:28:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:28:09,997 INFO L475 AbstractCegarLoop]: Abstraction has 408032 states and 674221 transitions. [2019-10-02 13:28:09,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-02 13:28:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 408032 states and 674221 transitions. [2019-10-02 13:28:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:28:11,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:28:11,271 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:28:11,271 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:28:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:28:11,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1338816020, now seen corresponding path program 1 times [2019-10-02 13:28:11,272 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:28:11,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:28:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:11,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:28:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:28:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:28:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:28:11,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:28:11,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 13:28:11,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:28:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:28:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:28:11,502 INFO L87 Difference]: Start difference. First operand 408032 states and 674221 transitions. Second operand 13 states. [2019-10-02 13:28:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:28:36,247 INFO L93 Difference]: Finished difference Result 427438 states and 700780 transitions. [2019-10-02 13:28:36,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:28:36,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 238 [2019-10-02 13:28:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:28:38,776 INFO L225 Difference]: With dead ends: 427438 [2019-10-02 13:28:38,776 INFO L226 Difference]: Without dead ends: 411769 [2019-10-02 13:28:38,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:28:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411769 states. [2019-10-02 13:29:15,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411769 to 409974. [2019-10-02 13:29:15,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409974 states. [2019-10-02 13:29:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409974 states to 409974 states and 677274 transitions. [2019-10-02 13:29:16,830 INFO L78 Accepts]: Start accepts. Automaton has 409974 states and 677274 transitions. Word has length 238 [2019-10-02 13:29:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:29:16,831 INFO L475 AbstractCegarLoop]: Abstraction has 409974 states and 677274 transitions. [2019-10-02 13:29:16,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:29:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 409974 states and 677274 transitions. [2019-10-02 13:29:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 13:29:18,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:29:18,230 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 13:29:18,230 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:29:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:29:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash -256772181, now seen corresponding path program 1 times [2019-10-02 13:29:18,231 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:29:18,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:29:18,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:18,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:29:18,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:29:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:29:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:29:18,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:29:18,699 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:29:18,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:29:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:29:20,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 3072 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 13:29:20,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:29:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 13:29:20,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:29:20,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2019-10-02 13:29:20,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 13:29:20,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 13:29:20,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1117, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 13:29:20,696 INFO L87 Difference]: Start difference. First operand 409974 states and 677274 transitions. Second operand 35 states. [2019-10-02 13:29:45,735 WARN L191 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20