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_spec1_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:57:15,164 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:57:15,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:57:15,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:57:15,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:57:15,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:57:15,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:57:15,184 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:57:15,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:57:15,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:57:15,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:57:15,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:57:15,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:57:15,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:57:15,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:57:15,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:57:15,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:57:15,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:57:15,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:57:15,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:57:15,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:57:15,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:57:15,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:57:15,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:57:15,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:57:15,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:57:15,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:57:15,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:57:15,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:57:15,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:57:15,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:57:15,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:57:15,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:57:15,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:57:15,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:57:15,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:57:15,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:57:15,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:57:15,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:57:15,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:57:15,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:57:15,215 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 12:57:15,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:57:15,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:57:15,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:57:15,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:57:15,233 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:57:15,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:57:15,234 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:57:15,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:57:15,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:57:15,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:57:15,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:57:15,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:57:15,235 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:57:15,235 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:57:15,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:57:15,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:57:15,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:57:15,236 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:57:15,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:57:15,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:57:15,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:57:15,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:57:15,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:57:15,238 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:57:15,238 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:57:15,238 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:57:15,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:57:15,239 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:57:15,239 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:57:15,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:57:15,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:57:15,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:57:15,324 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:57:15,325 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:57:15,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c [2019-10-02 12:57:15,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d44626583/9a9539da00274789baa7294bacb3aa39/FLAG09a7413e4 [2019-10-02 12:57:16,093 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:57:16,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c [2019-10-02 12:57:16,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d44626583/9a9539da00274789baa7294bacb3aa39/FLAG09a7413e4 [2019-10-02 12:57:16,285 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d44626583/9a9539da00274789baa7294bacb3aa39 [2019-10-02 12:57:16,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:57:16,298 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:57:16,299 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:57:16,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:57:16,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:57:16,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:57:16" (1/1) ... [2019-10-02 12:57:16,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@218b528e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:16, skipping insertion in model container [2019-10-02 12:57:16,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:57:16" (1/1) ... [2019-10-02 12:57:16,317 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:57:16,410 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:57:17,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:57:17,232 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:57:17,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:57:17,488 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:57:17,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17 WrapperNode [2019-10-02 12:57:17,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:57:17,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:57:17,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:57:17,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:57:17,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (1/1) ... [2019-10-02 12:57:17,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:57:17,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:57:17,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:57:17,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:57:17,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (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 12:57:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:57:17,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:57:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:57:17,827 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:57:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-10-02 12:57:17,828 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Sign [2019-10-02 12:57:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:57:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:57:17,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:57:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:57:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:57:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:57:17,831 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:57:17,832 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:57:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:57:17,833 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:57:17,836 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:57:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:57:17,837 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:57:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:57:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:57:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:57:17,838 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:57:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:57:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:57:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:57:17,839 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:57:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:57:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:57:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:57:17,840 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:57:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-10-02 12:57:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:57:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:57:17,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:57:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:57:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:57:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:57:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:57:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:57:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:57:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:57:17,843 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:57:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:57:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:57:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:57:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:57:17,844 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:57:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:57:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:57:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:57:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:57:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:57:17,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:57:17,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:57:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:57:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:57:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:57:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:57:17,848 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:57:17,849 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-10-02 12:57:17,849 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:57:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:57:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:57:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:57:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:57:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:57:17,850 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:57:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:57:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:57:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:57:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:57:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-10-02 12:57:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:57:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:57:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:57:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:57:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:57:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:57:17,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:57:17,854 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:57:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:57:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:57:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:57:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:57:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:57:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:57:17,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:57:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:57:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:57:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:57:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:57:17,857 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:57:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:57:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:57:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:57:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:57:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:57:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:57:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:57:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:57:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:57:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:57:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:57:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:57:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:57:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:57:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:57:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:57:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:57:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:57:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:57:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:57:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:57:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:57:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:57:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-10-02 12:57:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Sign [2019-10-02 12:57:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:57:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:57:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:57:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:57:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:57:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:57:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:57:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:57:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:57:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:57:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:57:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:57:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:57:17,884 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:57:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:57:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:57:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:57:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:57:17,885 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:57:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:57:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:57:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:57:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:57:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:57:17,886 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:57:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:57:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:57:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:57:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:57:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:57:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:57:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:57:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:57:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:57:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:57:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:57:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:57:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:57:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-10-02 12:57:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:57:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:57:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:57:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:57:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:57:17,890 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:57:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:57:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:57:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:57:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:57:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:57:17,891 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:57:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:57:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:57:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:57:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:57:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:57:17,892 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:57:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:57:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:57:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:57:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:57:17,893 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:57:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:57:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:57:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:57:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:57:17,894 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:57:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:57:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:57:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:57:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:57:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:57:17,895 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:57:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:57:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:57:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:57:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:57:17,896 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:57:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:57:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:57:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:57:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:57:17,897 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:57:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:57:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:57:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:57:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:57:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:57:17,898 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:57:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:57:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-10-02 12:57:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:57:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:57:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:57:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-10-02 12:57:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-10-02 12:57:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:57:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:57:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:57:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:57:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:57:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:57:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:57:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:57:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:57:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:57:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:57:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:57:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:57:20,373 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:57:20,374 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:57:20,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:57:20 BoogieIcfgContainer [2019-10-02 12:57:20,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:57:20,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:57:20,378 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:57:20,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:57:20,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:57:16" (1/3) ... [2019-10-02 12:57:20,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755514af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:57:20, skipping insertion in model container [2019-10-02 12:57:20,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:17" (2/3) ... [2019-10-02 12:57:20,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755514af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:57:20, skipping insertion in model container [2019-10-02 12:57:20,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:57:20" (3/3) ... [2019-10-02 12:57:20,386 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product30.cil.c [2019-10-02 12:57:20,399 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:57:20,414 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:57:20,434 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:57:20,480 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:57:20,481 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:57:20,481 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:57:20,481 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:57:20,481 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:57:20,482 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:57:20,486 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:57:20,486 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:57:20,486 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:57:20,529 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states. [2019-10-02 12:57:20,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:57:20,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:20,570 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:20,573 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:20,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -928970746, now seen corresponding path program 1 times [2019-10-02 12:57:20,582 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:20,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:20,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:20,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:20,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:57:21,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:21,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:57:21,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:57:21,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:57:21,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:57:21,368 INFO L87 Difference]: Start difference. First operand 544 states. Second operand 2 states. [2019-10-02 12:57:21,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:21,458 INFO L93 Difference]: Finished difference Result 774 states and 1022 transitions. [2019-10-02 12:57:21,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:57:21,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-02 12:57:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:21,497 INFO L225 Difference]: With dead ends: 774 [2019-10-02 12:57:21,499 INFO L226 Difference]: Without dead ends: 493 [2019-10-02 12:57:21,513 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 12:57:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-02 12:57:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2019-10-02 12:57:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2019-10-02 12:57:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 655 transitions. [2019-10-02 12:57:21,675 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 655 transitions. Word has length 158 [2019-10-02 12:57:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:21,678 INFO L475 AbstractCegarLoop]: Abstraction has 493 states and 655 transitions. [2019-10-02 12:57:21,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:57:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 655 transitions. [2019-10-02 12:57:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:57:21,690 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:21,690 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:21,691 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:21,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1108945686, now seen corresponding path program 1 times [2019-10-02 12:57:21,696 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:21,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:21,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:21,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:57:21,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:21,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:22,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:22,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:22,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:22,002 INFO L87 Difference]: Start difference. First operand 493 states and 655 transitions. Second operand 3 states. [2019-10-02 12:57:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:22,054 INFO L93 Difference]: Finished difference Result 757 states and 990 transitions. [2019-10-02 12:57:22,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:22,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 12:57:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:22,059 INFO L225 Difference]: With dead ends: 757 [2019-10-02 12:57:22,060 INFO L226 Difference]: Without dead ends: 496 [2019-10-02 12:57:22,062 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 12:57:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-10-02 12:57:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 495. [2019-10-02 12:57:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-10-02 12:57:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 657 transitions. [2019-10-02 12:57:22,095 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 657 transitions. Word has length 159 [2019-10-02 12:57:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:22,096 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 657 transitions. [2019-10-02 12:57:22,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 657 transitions. [2019-10-02 12:57:22,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:57:22,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:22,099 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:22,100 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash -224355654, now seen corresponding path program 1 times [2019-10-02 12:57:22,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:22,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:22,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:22,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:57:22,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:22,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:22,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:22,234 INFO L87 Difference]: Start difference. First operand 495 states and 657 transitions. Second operand 3 states. [2019-10-02 12:57:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:22,269 INFO L93 Difference]: Finished difference Result 966 states and 1312 transitions. [2019-10-02 12:57:22,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:22,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-10-02 12:57:22,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:22,274 INFO L225 Difference]: With dead ends: 966 [2019-10-02 12:57:22,274 INFO L226 Difference]: Without dead ends: 536 [2019-10-02 12:57:22,276 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 12:57:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-10-02 12:57:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 535. [2019-10-02 12:57:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-02 12:57:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 726 transitions. [2019-10-02 12:57:22,301 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 726 transitions. Word has length 169 [2019-10-02 12:57:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:22,302 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 726 transitions. [2019-10-02 12:57:22,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 726 transitions. [2019-10-02 12:57:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:57:22,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:22,306 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:22,306 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:22,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:22,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1274478536, now seen corresponding path program 1 times [2019-10-02 12:57:22,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:22,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:22,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:22,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:22,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:57:22,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:22,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:22,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:22,505 INFO L87 Difference]: Start difference. First operand 535 states and 726 transitions. Second operand 3 states. [2019-10-02 12:57:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:22,569 INFO L93 Difference]: Finished difference Result 1083 states and 1514 transitions. [2019-10-02 12:57:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:22,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-10-02 12:57:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:22,581 INFO L225 Difference]: With dead ends: 1083 [2019-10-02 12:57:22,581 INFO L226 Difference]: Without dead ends: 613 [2019-10-02 12:57:22,583 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 12:57:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-02 12:57:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 612. [2019-10-02 12:57:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-10-02 12:57:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 858 transitions. [2019-10-02 12:57:22,622 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 858 transitions. Word has length 170 [2019-10-02 12:57:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:22,623 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 858 transitions. [2019-10-02 12:57:22,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 858 transitions. [2019-10-02 12:57:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:57:22,631 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:22,632 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:22,632 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash 124962842, now seen corresponding path program 1 times [2019-10-02 12:57:22,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:22,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:22,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:57:22,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:22,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:22,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:22,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:22,910 INFO L87 Difference]: Start difference. First operand 612 states and 858 transitions. Second operand 3 states. [2019-10-02 12:57:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:22,963 INFO L93 Difference]: Finished difference Result 1308 states and 1900 transitions. [2019-10-02 12:57:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:22,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-10-02 12:57:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:22,970 INFO L225 Difference]: With dead ends: 1308 [2019-10-02 12:57:22,971 INFO L226 Difference]: Without dead ends: 761 [2019-10-02 12:57:22,973 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 12:57:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-02 12:57:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 760. [2019-10-02 12:57:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-02 12:57:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1110 transitions. [2019-10-02 12:57:23,035 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1110 transitions. Word has length 171 [2019-10-02 12:57:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:23,037 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 1110 transitions. [2019-10-02 12:57:23,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1110 transitions. [2019-10-02 12:57:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:57:23,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:23,045 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:23,045 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1376144088, now seen corresponding path program 1 times [2019-10-02 12:57:23,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:23,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:23,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:57:23,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:23,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:23,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:23,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:23,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:23,262 INFO L87 Difference]: Start difference. First operand 760 states and 1110 transitions. Second operand 3 states. [2019-10-02 12:57:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:23,324 INFO L93 Difference]: Finished difference Result 1740 states and 2636 transitions. [2019-10-02 12:57:23,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:23,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-10-02 12:57:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:23,333 INFO L225 Difference]: With dead ends: 1740 [2019-10-02 12:57:23,333 INFO L226 Difference]: Without dead ends: 1045 [2019-10-02 12:57:23,337 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 12:57:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-10-02 12:57:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1044. [2019-10-02 12:57:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-10-02 12:57:23,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1590 transitions. [2019-10-02 12:57:23,399 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1590 transitions. Word has length 172 [2019-10-02 12:57:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:23,401 INFO L475 AbstractCegarLoop]: Abstraction has 1044 states and 1590 transitions. [2019-10-02 12:57:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1590 transitions. [2019-10-02 12:57:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:57:23,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:23,409 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:57:23,409 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1552369098, now seen corresponding path program 1 times [2019-10-02 12:57:23,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:23,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:23,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:57:25,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:25,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2019-10-02 12:57:25,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 12:57:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 12:57:25,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1717, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:57:25,046 INFO L87 Difference]: Start difference. First operand 1044 states and 1590 transitions. Second operand 43 states. [2019-10-02 12:57:28,800 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-10-02 12:57:30,656 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2019-10-02 12:57:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:59,910 INFO L93 Difference]: Finished difference Result 8728 states and 13507 transitions. [2019-10-02 12:57:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2019-10-02 12:57:59,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 175 [2019-10-02 12:57:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:59,965 INFO L225 Difference]: With dead ends: 8728 [2019-10-02 12:57:59,965 INFO L226 Difference]: Without dead ends: 7356 [2019-10-02 12:57:59,994 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17671 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2814, Invalid=49856, Unknown=0, NotChecked=0, Total=52670 [2019-10-02 12:58:00,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7356 states. [2019-10-02 12:58:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7356 to 7096. [2019-10-02 12:58:00,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7096 states. [2019-10-02 12:58:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7096 states to 7096 states and 11041 transitions. [2019-10-02 12:58:00,435 INFO L78 Accepts]: Start accepts. Automaton has 7096 states and 11041 transitions. Word has length 175 [2019-10-02 12:58:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:00,435 INFO L475 AbstractCegarLoop]: Abstraction has 7096 states and 11041 transitions. [2019-10-02 12:58:00,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 12:58:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 7096 states and 11041 transitions. [2019-10-02 12:58:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:58:00,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:00,496 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:58:00,497 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1334273833, now seen corresponding path program 1 times [2019-10-02 12:58:00,498 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:00,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:00,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:00,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:58:00,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:00,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:58:00,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:58:00,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:58:00,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:00,746 INFO L87 Difference]: Start difference. First operand 7096 states and 11041 transitions. Second operand 3 states. [2019-10-02 12:58:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:01,176 INFO L93 Difference]: Finished difference Result 17338 states and 27812 transitions. [2019-10-02 12:58:01,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:58:01,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-10-02 12:58:01,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:01,254 INFO L225 Difference]: With dead ends: 17338 [2019-10-02 12:58:01,254 INFO L226 Difference]: Without dead ends: 10366 [2019-10-02 12:58:01,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:58:01,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10366 states. [2019-10-02 12:58:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10366 to 10360. [2019-10-02 12:58:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10360 states. [2019-10-02 12:58:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 16817 transitions. [2019-10-02 12:58:01,859 INFO L78 Accepts]: Start accepts. Automaton has 10360 states and 16817 transitions. Word has length 175 [2019-10-02 12:58:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:01,860 INFO L475 AbstractCegarLoop]: Abstraction has 10360 states and 16817 transitions. [2019-10-02 12:58:01,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:58:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 10360 states and 16817 transitions. [2019-10-02 12:58:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:58:01,911 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:01,912 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:58:01,912 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:01,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:01,913 INFO L82 PathProgramCache]: Analyzing trace with hash 987157089, now seen corresponding path program 1 times [2019-10-02 12:58:01,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:01,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:01,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:58:02,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:02,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:58:02,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:58:02,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:58:02,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:02,176 INFO L87 Difference]: Start difference. First operand 10360 states and 16817 transitions. Second operand 11 states. [2019-10-02 12:58:02,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:02,788 INFO L93 Difference]: Finished difference Result 13082 states and 20347 transitions. [2019-10-02 12:58:02,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:02,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-10-02 12:58:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:02,869 INFO L225 Difference]: With dead ends: 13082 [2019-10-02 12:58:02,869 INFO L226 Difference]: Without dead ends: 10484 [2019-10-02 12:58:02,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:58:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10484 states. [2019-10-02 12:58:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10484 to 10482. [2019-10-02 12:58:04,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10482 states. [2019-10-02 12:58:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10482 states to 10482 states and 17013 transitions. [2019-10-02 12:58:04,098 INFO L78 Accepts]: Start accepts. Automaton has 10482 states and 17013 transitions. Word has length 178 [2019-10-02 12:58:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:04,102 INFO L475 AbstractCegarLoop]: Abstraction has 10482 states and 17013 transitions. [2019-10-02 12:58:04,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:58:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 10482 states and 17013 transitions. [2019-10-02 12:58:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:58:04,152 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:04,152 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:58:04,153 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:04,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -461828534, now seen corresponding path program 1 times [2019-10-02 12:58:04,153 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:04,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:04,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:04,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:58:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:04,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:58:04,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:58:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:58:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:58:04,325 INFO L87 Difference]: Start difference. First operand 10482 states and 17013 transitions. Second operand 5 states. [2019-10-02 12:58:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:05,571 INFO L93 Difference]: Finished difference Result 19518 states and 31064 transitions. [2019-10-02 12:58:05,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:58:05,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-10-02 12:58:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:05,657 INFO L225 Difference]: With dead ends: 19518 [2019-10-02 12:58:05,657 INFO L226 Difference]: Without dead ends: 18264 [2019-10-02 12:58:05,674 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:58:05,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18264 states. [2019-10-02 12:58:06,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18264 to 18106. [2019-10-02 12:58:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18106 states. [2019-10-02 12:58:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18106 states to 18106 states and 29188 transitions. [2019-10-02 12:58:06,765 INFO L78 Accepts]: Start accepts. Automaton has 18106 states and 29188 transitions. Word has length 178 [2019-10-02 12:58:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:06,766 INFO L475 AbstractCegarLoop]: Abstraction has 18106 states and 29188 transitions. [2019-10-02 12:58:06,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:58:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 18106 states and 29188 transitions. [2019-10-02 12:58:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:58:06,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:06,836 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-10-02 12:58:06,836 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1823034921, now seen corresponding path program 1 times [2019-10-02 12:58:06,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:06,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:58:07,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:58:07,332 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 12:58:07,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:07,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 2699 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:58:07,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:58:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:58:08,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:58:08,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 26 [2019-10-02 12:58:08,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:58:08,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:58:08,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:58:08,178 INFO L87 Difference]: Start difference. First operand 18106 states and 29188 transitions. Second operand 26 states. [2019-10-02 12:58:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:15,061 INFO L93 Difference]: Finished difference Result 30745 states and 49384 transitions. [2019-10-02 12:58:15,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:58:15,062 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2019-10-02 12:58:15,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:15,146 INFO L225 Difference]: With dead ends: 30745 [2019-10-02 12:58:15,147 INFO L226 Difference]: Without dead ends: 16582 [2019-10-02 12:58:15,222 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 12:58:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-10-02 12:58:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16550. [2019-10-02 12:58:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16550 states. [2019-10-02 12:58:16,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16550 states to 16550 states and 27058 transitions. [2019-10-02 12:58:16,497 INFO L78 Accepts]: Start accepts. Automaton has 16550 states and 27058 transitions. Word has length 178 [2019-10-02 12:58:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:16,498 INFO L475 AbstractCegarLoop]: Abstraction has 16550 states and 27058 transitions. [2019-10-02 12:58:16,498 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:58:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16550 states and 27058 transitions. [2019-10-02 12:58:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:58:16,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:16,551 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:16,551 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2100812667, now seen corresponding path program 1 times [2019-10-02 12:58:16,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:16,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:16,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:16,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:16,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:58:16,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:16,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:58:16,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:58:16,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:58:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:16,775 INFO L87 Difference]: Start difference. First operand 16550 states and 27058 transitions. Second operand 11 states. [2019-10-02 12:58:17,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:17,734 INFO L93 Difference]: Finished difference Result 19602 states and 30989 transitions. [2019-10-02 12:58:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:17,734 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 12:58:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:17,797 INFO L225 Difference]: With dead ends: 19602 [2019-10-02 12:58:17,797 INFO L226 Difference]: Without dead ends: 14842 [2019-10-02 12:58:17,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:58:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14842 states. [2019-10-02 12:58:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14842 to 14820. [2019-10-02 12:58:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14820 states. [2019-10-02 12:58:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14820 states to 14820 states and 24767 transitions. [2019-10-02 12:58:18,734 INFO L78 Accepts]: Start accepts. Automaton has 14820 states and 24767 transitions. Word has length 179 [2019-10-02 12:58:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:18,735 INFO L475 AbstractCegarLoop]: Abstraction has 14820 states and 24767 transitions. [2019-10-02 12:58:18,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:58:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 14820 states and 24767 transitions. [2019-10-02 12:58:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:58:18,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:18,782 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 12:58:18,782 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1396347252, now seen corresponding path program 1 times [2019-10-02 12:58:18,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:18,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:58:18,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:58:18,910 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 12:58:19,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:19,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 2702 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:58:19,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:58:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:58:19,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:58:19,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 12:58:19,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:58:19,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:58:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:58:19,606 INFO L87 Difference]: Start difference. First operand 14820 states and 24767 transitions. Second operand 12 states. [2019-10-02 12:58:21,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:21,906 INFO L93 Difference]: Finished difference Result 25706 states and 42501 transitions. [2019-10-02 12:58:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:58:21,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2019-10-02 12:58:21,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:21,953 INFO L225 Difference]: With dead ends: 25706 [2019-10-02 12:58:21,953 INFO L226 Difference]: Without dead ends: 10952 [2019-10-02 12:58:21,988 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:58:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10952 states. [2019-10-02 12:58:22,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10952 to 10926. [2019-10-02 12:58:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10926 states. [2019-10-02 12:58:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10926 states to 10926 states and 17783 transitions. [2019-10-02 12:58:22,551 INFO L78 Accepts]: Start accepts. Automaton has 10926 states and 17783 transitions. Word has length 180 [2019-10-02 12:58:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:22,553 INFO L475 AbstractCegarLoop]: Abstraction has 10926 states and 17783 transitions. [2019-10-02 12:58:22,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:58:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 10926 states and 17783 transitions. [2019-10-02 12:58:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:58:22,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:22,591 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:22,591 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1299164324, now seen corresponding path program 1 times [2019-10-02 12:58:22,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:22,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:22,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:23,155 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:58:23,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:23,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:58:23,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:58:23,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:58:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:58:23,158 INFO L87 Difference]: Start difference. First operand 10926 states and 17783 transitions. Second operand 26 states. [2019-10-02 12:58:32,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:32,112 INFO L93 Difference]: Finished difference Result 25725 states and 40716 transitions. [2019-10-02 12:58:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:58:32,112 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 188 [2019-10-02 12:58:32,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:32,212 INFO L225 Difference]: With dead ends: 25725 [2019-10-02 12:58:32,212 INFO L226 Difference]: Without dead ends: 23862 [2019-10-02 12:58:32,231 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:58:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23862 states. [2019-10-02 12:58:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23862 to 22181. [2019-10-02 12:58:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22181 states. [2019-10-02 12:58:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22181 states to 22181 states and 36116 transitions. [2019-10-02 12:58:33,551 INFO L78 Accepts]: Start accepts. Automaton has 22181 states and 36116 transitions. Word has length 188 [2019-10-02 12:58:33,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:33,551 INFO L475 AbstractCegarLoop]: Abstraction has 22181 states and 36116 transitions. [2019-10-02 12:58:33,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:58:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 22181 states and 36116 transitions. [2019-10-02 12:58:33,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:58:33,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:33,605 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:33,605 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:33,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:33,606 INFO L82 PathProgramCache]: Analyzing trace with hash -450965432, now seen corresponding path program 1 times [2019-10-02 12:58:33,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:33,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:33,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:33,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:33,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 12:58:33,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:33,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:58:33,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:58:33,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:58:33,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:58:33,798 INFO L87 Difference]: Start difference. First operand 22181 states and 36116 transitions. Second operand 9 states. [2019-10-02 12:58:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:34,338 INFO L93 Difference]: Finished difference Result 23523 states and 37853 transitions. [2019-10-02 12:58:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:34,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-10-02 12:58:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:34,376 INFO L225 Difference]: With dead ends: 23523 [2019-10-02 12:58:34,376 INFO L226 Difference]: Without dead ends: 10938 [2019-10-02 12:58:34,407 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:58:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10938 states. [2019-10-02 12:58:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10938 to 10936. [2019-10-02 12:58:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10936 states. [2019-10-02 12:58:34,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10936 states to 10936 states and 17794 transitions. [2019-10-02 12:58:34,908 INFO L78 Accepts]: Start accepts. Automaton has 10936 states and 17794 transitions. Word has length 189 [2019-10-02 12:58:34,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:34,908 INFO L475 AbstractCegarLoop]: Abstraction has 10936 states and 17794 transitions. [2019-10-02 12:58:34,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:58:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10936 states and 17794 transitions. [2019-10-02 12:58:34,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:58:34,925 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:34,925 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:34,926 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:34,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:34,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1415895277, now seen corresponding path program 2 times [2019-10-02 12:58:34,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:34,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:34,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:34,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:34,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:58:35,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:35,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:58:35,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:58:35,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:58:35,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:58:35,354 INFO L87 Difference]: Start difference. First operand 10936 states and 17794 transitions. Second operand 24 states. [2019-10-02 12:58:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:44,209 INFO L93 Difference]: Finished difference Result 25714 states and 40702 transitions. [2019-10-02 12:58:44,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:58:44,209 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2019-10-02 12:58:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:44,289 INFO L225 Difference]: With dead ends: 25714 [2019-10-02 12:58:44,290 INFO L226 Difference]: Without dead ends: 23855 [2019-10-02 12:58:44,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:58:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23855 states. [2019-10-02 12:58:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23855 to 22176. [2019-10-02 12:58:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22176 states. [2019-10-02 12:58:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22176 states to 22176 states and 36108 transitions. [2019-10-02 12:58:46,049 INFO L78 Accepts]: Start accepts. Automaton has 22176 states and 36108 transitions. Word has length 189 [2019-10-02 12:58:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:46,049 INFO L475 AbstractCegarLoop]: Abstraction has 22176 states and 36108 transitions. [2019-10-02 12:58:46,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:58:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 22176 states and 36108 transitions. [2019-10-02 12:58:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:58:46,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:46,085 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:46,086 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:46,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash 909023967, now seen corresponding path program 1 times [2019-10-02 12:58:46,086 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:46,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:46,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:58:46,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 12:58:46,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:46,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:58:46,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:58:46,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:58:46,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:58:46,279 INFO L87 Difference]: Start difference. First operand 22176 states and 36108 transitions. Second operand 12 states. [2019-10-02 12:58:46,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:46,970 INFO L93 Difference]: Finished difference Result 28630 states and 44499 transitions. [2019-10-02 12:58:46,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:58:46,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2019-10-02 12:58:46,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:47,038 INFO L225 Difference]: With dead ends: 28630 [2019-10-02 12:58:47,038 INFO L226 Difference]: Without dead ends: 22174 [2019-10-02 12:58:47,063 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:58:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22174 states. [2019-10-02 12:58:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22174 to 22158. [2019-10-02 12:58:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22158 states. [2019-10-02 12:58:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22158 states to 22158 states and 36046 transitions. [2019-10-02 12:58:48,274 INFO L78 Accepts]: Start accepts. Automaton has 22158 states and 36046 transitions. Word has length 190 [2019-10-02 12:58:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:48,274 INFO L475 AbstractCegarLoop]: Abstraction has 22158 states and 36046 transitions. [2019-10-02 12:58:48,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:58:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 22158 states and 36046 transitions. [2019-10-02 12:58:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:58:48,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:48,313 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:48,313 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:48,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:48,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1127273185, now seen corresponding path program 2 times [2019-10-02 12:58:48,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:48,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:48,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:48,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:58:48,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:48,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:58:48,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:58:48,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:58:48,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:58:48,477 INFO L87 Difference]: Start difference. First operand 22158 states and 36046 transitions. Second operand 7 states. [2019-10-02 12:58:48,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:48,952 INFO L93 Difference]: Finished difference Result 23502 states and 37787 transitions. [2019-10-02 12:58:48,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:58:48,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-10-02 12:58:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:48,983 INFO L225 Difference]: With dead ends: 23502 [2019-10-02 12:58:48,983 INFO L226 Difference]: Without dead ends: 10948 [2019-10-02 12:58:49,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:58:49,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10948 states. [2019-10-02 12:58:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10948 to 10948. [2019-10-02 12:58:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10948 states. [2019-10-02 12:58:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10948 states to 10948 states and 17811 transitions. [2019-10-02 12:58:49,385 INFO L78 Accepts]: Start accepts. Automaton has 10948 states and 17811 transitions. Word has length 190 [2019-10-02 12:58:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:49,386 INFO L475 AbstractCegarLoop]: Abstraction has 10948 states and 17811 transitions. [2019-10-02 12:58:49,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:58:49,386 INFO L276 IsEmpty]: Start isEmpty. Operand 10948 states and 17811 transitions. [2019-10-02 12:58:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:58:49,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:49,404 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:58:49,404 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:49,404 INFO L82 PathProgramCache]: Analyzing trace with hash 673129298, now seen corresponding path program 3 times [2019-10-02 12:58:49,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:49,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:49,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:49,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:58:49,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:58:49,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:49,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:58:49,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:58:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:58:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:58:49,888 INFO L87 Difference]: Start difference. First operand 10948 states and 17811 transitions. Second operand 26 states. [2019-10-02 12:58:54,047 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-10-02 12:58:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:58,893 INFO L93 Difference]: Finished difference Result 25681 states and 40607 transitions. [2019-10-02 12:58:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:58:58,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 190 [2019-10-02 12:58:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:58,962 INFO L225 Difference]: With dead ends: 25681 [2019-10-02 12:58:58,962 INFO L226 Difference]: Without dead ends: 23814 [2019-10-02 12:58:58,974 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1516 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:58:58,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2019-10-02 12:58:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22163. [2019-10-02 12:58:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22163 states. [2019-10-02 12:59:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22163 states to 22163 states and 36051 transitions. [2019-10-02 12:59:00,743 INFO L78 Accepts]: Start accepts. Automaton has 22163 states and 36051 transitions. Word has length 190 [2019-10-02 12:59:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:00,744 INFO L475 AbstractCegarLoop]: Abstraction has 22163 states and 36051 transitions. [2019-10-02 12:59:00,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:59:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 22163 states and 36051 transitions. [2019-10-02 12:59:00,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:59:00,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:00,781 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:00,781 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:00,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:00,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1616785242, now seen corresponding path program 3 times [2019-10-02 12:59:00,782 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:00,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:00,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:00,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:00,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:59:00,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:00,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:59:00,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:59:00,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:59:00,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:59:00,941 INFO L87 Difference]: Start difference. First operand 22163 states and 36051 transitions. Second operand 9 states. [2019-10-02 12:59:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:01,674 INFO L93 Difference]: Finished difference Result 23511 states and 37796 transitions. [2019-10-02 12:59:01,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:01,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-10-02 12:59:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:01,703 INFO L225 Difference]: With dead ends: 23511 [2019-10-02 12:59:01,704 INFO L226 Difference]: Without dead ends: 10952 [2019-10-02 12:59:01,725 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:59:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10952 states. [2019-10-02 12:59:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10952 to 10948. [2019-10-02 12:59:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10948 states. [2019-10-02 12:59:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10948 states to 10948 states and 17810 transitions. [2019-10-02 12:59:02,092 INFO L78 Accepts]: Start accepts. Automaton has 10948 states and 17810 transitions. Word has length 191 [2019-10-02 12:59:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:02,092 INFO L475 AbstractCegarLoop]: Abstraction has 10948 states and 17810 transitions. [2019-10-02 12:59:02,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:59:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10948 states and 17810 transitions. [2019-10-02 12:59:02,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:59:02,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:02,112 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:02,113 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:02,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:02,113 INFO L82 PathProgramCache]: Analyzing trace with hash -957957856, now seen corresponding path program 1 times [2019-10-02 12:59:02,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:02,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:02,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:02,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:02,579 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:59:02,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:02,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:59:02,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:59:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:59:02,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:59:02,585 INFO L87 Difference]: Start difference. First operand 10948 states and 17810 transitions. Second operand 24 states. [2019-10-02 12:59:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:11,749 INFO L93 Difference]: Finished difference Result 34716 states and 56101 transitions. [2019-10-02 12:59:11,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 12:59:11,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 191 [2019-10-02 12:59:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:11,809 INFO L225 Difference]: With dead ends: 34716 [2019-10-02 12:59:11,809 INFO L226 Difference]: Without dead ends: 23843 [2019-10-02 12:59:11,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 12:59:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23843 states. [2019-10-02 12:59:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23843 to 22160. [2019-10-02 12:59:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22160 states. [2019-10-02 12:59:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22160 states to 22160 states and 36041 transitions. [2019-10-02 12:59:12,577 INFO L78 Accepts]: Start accepts. Automaton has 22160 states and 36041 transitions. Word has length 191 [2019-10-02 12:59:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:12,577 INFO L475 AbstractCegarLoop]: Abstraction has 22160 states and 36041 transitions. [2019-10-02 12:59:12,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:59:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22160 states and 36041 transitions. [2019-10-02 12:59:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:59:12,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:12,615 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:12,616 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1702276276, now seen corresponding path program 1 times [2019-10-02 12:59:12,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:12,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:59:12,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:12,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:59:12,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:59:12,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:59:12,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:59:12,765 INFO L87 Difference]: Start difference. First operand 22160 states and 36041 transitions. Second operand 7 states. [2019-10-02 12:59:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:13,241 INFO L93 Difference]: Finished difference Result 23528 states and 37806 transitions. [2019-10-02 12:59:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:59:13,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-10-02 12:59:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:13,271 INFO L225 Difference]: With dead ends: 23528 [2019-10-02 12:59:13,271 INFO L226 Difference]: Without dead ends: 10974 [2019-10-02 12:59:13,291 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:59:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10974 states. [2019-10-02 12:59:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10974 to 10950. [2019-10-02 12:59:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10950 states. [2019-10-02 12:59:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10950 states to 10950 states and 17812 transitions. [2019-10-02 12:59:13,676 INFO L78 Accepts]: Start accepts. Automaton has 10950 states and 17812 transitions. Word has length 192 [2019-10-02 12:59:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:13,677 INFO L475 AbstractCegarLoop]: Abstraction has 10950 states and 17812 transitions. [2019-10-02 12:59:13,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:59:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 10950 states and 17812 transitions. [2019-10-02 12:59:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:59:13,697 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:13,698 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:13,698 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:13,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1521994172, now seen corresponding path program 1 times [2019-10-02 12:59:13,699 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:13,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:59:14,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:14,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:59:14,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:59:14,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:59:14,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:59:14,324 INFO L87 Difference]: Start difference. First operand 10950 states and 17812 transitions. Second operand 18 states. [2019-10-02 12:59:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:19,036 INFO L93 Difference]: Finished difference Result 14660 states and 22689 transitions. [2019-10-02 12:59:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:59:19,036 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 192 [2019-10-02 12:59:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:19,066 INFO L225 Difference]: With dead ends: 14660 [2019-10-02 12:59:19,067 INFO L226 Difference]: Without dead ends: 12793 [2019-10-02 12:59:19,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1549, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 12:59:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12793 states. [2019-10-02 12:59:19,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12793 to 12634. [2019-10-02 12:59:19,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2019-10-02 12:59:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 20064 transitions. [2019-10-02 12:59:19,476 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 20064 transitions. Word has length 192 [2019-10-02 12:59:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:19,476 INFO L475 AbstractCegarLoop]: Abstraction has 12634 states and 20064 transitions. [2019-10-02 12:59:19,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:59:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 20064 transitions. [2019-10-02 12:59:19,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:59:19,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:19,495 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:19,495 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:19,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2007532888, now seen corresponding path program 1 times [2019-10-02 12:59:19,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:19,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:19,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:19,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:19,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:19,648 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 12:59:19,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:20,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 2747 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:59:20,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:20,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:59:20,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:59:20,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:59:20,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:59:20,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:20,262 INFO L87 Difference]: Start difference. First operand 12634 states and 20064 transitions. Second operand 5 states. [2019-10-02 12:59:20,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:20,621 INFO L93 Difference]: Finished difference Result 15976 states and 24420 transitions. [2019-10-02 12:59:20,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:59:20,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 193 [2019-10-02 12:59:20,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:20,652 INFO L225 Difference]: With dead ends: 15976 [2019-10-02 12:59:20,652 INFO L226 Difference]: Without dead ends: 12733 [2019-10-02 12:59:20,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12733 states. [2019-10-02 12:59:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12733 to 12717. [2019-10-02 12:59:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12717 states. [2019-10-02 12:59:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12717 states to 12717 states and 20185 transitions. [2019-10-02 12:59:21,223 INFO L78 Accepts]: Start accepts. Automaton has 12717 states and 20185 transitions. Word has length 193 [2019-10-02 12:59:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:21,223 INFO L475 AbstractCegarLoop]: Abstraction has 12717 states and 20185 transitions. [2019-10-02 12:59:21,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:59:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 12717 states and 20185 transitions. [2019-10-02 12:59:21,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:59:21,242 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:21,242 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:21,242 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:21,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:21,242 INFO L82 PathProgramCache]: Analyzing trace with hash 749057253, now seen corresponding path program 1 times [2019-10-02 12:59:21,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:21,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:21,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:21,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:21,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:21,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:21,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:21,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:21,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:21,352 INFO L87 Difference]: Start difference. First operand 12717 states and 20185 transitions. Second operand 3 states. [2019-10-02 12:59:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:21,791 INFO L93 Difference]: Finished difference Result 31928 states and 52213 transitions. [2019-10-02 12:59:21,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:21,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-02 12:59:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:21,839 INFO L225 Difference]: With dead ends: 31928 [2019-10-02 12:59:21,839 INFO L226 Difference]: Without dead ends: 19349 [2019-10-02 12:59:21,861 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 12:59:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19349 states. [2019-10-02 12:59:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19349 to 19343. [2019-10-02 12:59:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19343 states. [2019-10-02 12:59:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19343 states to 19343 states and 31994 transitions. [2019-10-02 12:59:22,550 INFO L78 Accepts]: Start accepts. Automaton has 19343 states and 31994 transitions. Word has length 193 [2019-10-02 12:59:22,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:22,550 INFO L475 AbstractCegarLoop]: Abstraction has 19343 states and 31994 transitions. [2019-10-02 12:59:22,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19343 states and 31994 transitions. [2019-10-02 12:59:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:59:22,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:22,589 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:59:22,589 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 537320395, now seen corresponding path program 1 times [2019-10-02 12:59:22,589 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:22,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:22,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:22,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:22,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:22,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:22,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:22,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:22,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:22,699 INFO L87 Difference]: Start difference. First operand 19343 states and 31994 transitions. Second operand 3 states. [2019-10-02 12:59:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:23,471 INFO L93 Difference]: Finished difference Result 50839 states and 85903 transitions. [2019-10-02 12:59:23,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:23,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 12:59:23,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:23,558 INFO L225 Difference]: With dead ends: 50839 [2019-10-02 12:59:23,558 INFO L226 Difference]: Without dead ends: 31641 [2019-10-02 12:59:23,596 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 12:59:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31641 states. [2019-10-02 12:59:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31641 to 31635. [2019-10-02 12:59:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31635 states. [2019-10-02 12:59:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31635 states to 31635 states and 53693 transitions. [2019-10-02 12:59:25,068 INFO L78 Accepts]: Start accepts. Automaton has 31635 states and 53693 transitions. Word has length 194 [2019-10-02 12:59:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:25,068 INFO L475 AbstractCegarLoop]: Abstraction has 31635 states and 53693 transitions. [2019-10-02 12:59:25,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 31635 states and 53693 transitions. [2019-10-02 12:59:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:59:25,137 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:25,137 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:59:25,137 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:25,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1627916295, now seen corresponding path program 1 times [2019-10-02 12:59:25,137 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:25,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:25,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:25,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:25,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:25,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:25,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:25,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:25,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:25,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:25,251 INFO L87 Difference]: Start difference. First operand 31635 states and 53693 transitions. Second operand 3 states. [2019-10-02 12:59:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:27,000 INFO L93 Difference]: Finished difference Result 88087 states and 151564 transitions. [2019-10-02 12:59:27,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:27,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-02 12:59:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:27,166 INFO L225 Difference]: With dead ends: 88087 [2019-10-02 12:59:27,166 INFO L226 Difference]: Without dead ends: 56603 [2019-10-02 12:59:27,214 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 12:59:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56603 states. [2019-10-02 12:59:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56603 to 56597. [2019-10-02 12:59:29,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56597 states. [2019-10-02 12:59:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56597 states to 56597 states and 97278 transitions. [2019-10-02 12:59:29,334 INFO L78 Accepts]: Start accepts. Automaton has 56597 states and 97278 transitions. Word has length 195 [2019-10-02 12:59:29,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:29,334 INFO L475 AbstractCegarLoop]: Abstraction has 56597 states and 97278 transitions. [2019-10-02 12:59:29,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 56597 states and 97278 transitions. [2019-10-02 12:59:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:59:29,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:29,453 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-10-02 12:59:29,454 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:29,454 INFO L82 PathProgramCache]: Analyzing trace with hash -529772117, now seen corresponding path program 1 times [2019-10-02 12:59:29,454 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:29,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:29,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:29,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:29,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:29,560 INFO L87 Difference]: Start difference. First operand 56597 states and 97278 transitions. Second operand 3 states. [2019-10-02 12:59:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:34,928 INFO L93 Difference]: Finished difference Result 159127 states and 274630 transitions. [2019-10-02 12:59:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:34,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 12:59:34,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:35,284 INFO L225 Difference]: With dead ends: 159127 [2019-10-02 12:59:35,284 INFO L226 Difference]: Without dead ends: 102689 [2019-10-02 12:59:35,387 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 12:59:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102689 states. [2019-10-02 12:59:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102689 to 102683. [2019-10-02 12:59:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102683 states. [2019-10-02 12:59:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102683 states to 102683 states and 176003 transitions. [2019-10-02 12:59:39,853 INFO L78 Accepts]: Start accepts. Automaton has 102683 states and 176003 transitions. Word has length 196 [2019-10-02 12:59:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:39,854 INFO L475 AbstractCegarLoop]: Abstraction has 102683 states and 176003 transitions. [2019-10-02 12:59:39,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 102683 states and 176003 transitions. [2019-10-02 12:59:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:59:40,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:40,034 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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 12:59:40,034 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 169665385, now seen corresponding path program 1 times [2019-10-02 12:59:40,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:40,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:40,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:40,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:40,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:40,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:40,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:40,144 INFO L87 Difference]: Start difference. First operand 102683 states and 176003 transitions. Second operand 3 states. [2019-10-02 12:59:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:48,336 INFO L93 Difference]: Finished difference Result 292754 states and 503100 transitions. [2019-10-02 12:59:48,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:48,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-02 12:59:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:48,993 INFO L225 Difference]: With dead ends: 292754 [2019-10-02 12:59:48,993 INFO L226 Difference]: Without dead ends: 190243 [2019-10-02 12:59:49,187 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 12:59:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190243 states. [2019-10-02 13:00:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190243 to 190237. [2019-10-02 13:00:04,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190237 states. [2019-10-02 13:00:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190237 states to 190237 states and 324228 transitions. [2019-10-02 13:00:05,245 INFO L78 Accepts]: Start accepts. Automaton has 190237 states and 324228 transitions. Word has length 197 [2019-10-02 13:00:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:05,246 INFO L475 AbstractCegarLoop]: Abstraction has 190237 states and 324228 transitions. [2019-10-02 13:00:05,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 190237 states and 324228 transitions. [2019-10-02 13:00:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:00:05,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:05,504 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:00:05,504 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:05,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1599696949, now seen corresponding path program 1 times [2019-10-02 13:00:05,505 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:05,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:05,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:05,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:06,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:06,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:06,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:06,520 INFO L87 Difference]: Start difference. First operand 190237 states and 324228 transitions. Second operand 3 states. [2019-10-02 13:00:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:20,949 INFO L93 Difference]: Finished difference Result 357594 states and 604636 transitions. [2019-10-02 13:00:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:20,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 13:00:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:22,085 INFO L225 Difference]: With dead ends: 357594 [2019-10-02 13:00:22,086 INFO L226 Difference]: Without dead ends: 352663 [2019-10-02 13:00:22,181 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:00:22,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352663 states. [2019-10-02 13:00:45,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352663 to 352657. [2019-10-02 13:00:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352657 states. [2019-10-02 13:00:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352657 states to 352657 states and 592052 transitions. [2019-10-02 13:00:46,347 INFO L78 Accepts]: Start accepts. Automaton has 352657 states and 592052 transitions. Word has length 198 [2019-10-02 13:00:46,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:46,347 INFO L475 AbstractCegarLoop]: Abstraction has 352657 states and 592052 transitions. [2019-10-02 13:00:46,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:46,347 INFO L276 IsEmpty]: Start isEmpty. Operand 352657 states and 592052 transitions. [2019-10-02 13:00:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:00:46,651 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:46,651 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:00:46,651 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1121983817, now seen corresponding path program 1 times [2019-10-02 13:00:46,652 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:46,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 13:00:53,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:53,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:53,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:53,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:53,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:53,943 INFO L87 Difference]: Start difference. First operand 352657 states and 592052 transitions. Second operand 3 states. [2019-10-02 13:01:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:07,147 INFO L93 Difference]: Finished difference Result 358208 states and 599325 transitions. [2019-10-02 13:01:07,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:01:07,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-02 13:01:07,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:08,607 INFO L225 Difference]: With dead ends: 358208 [2019-10-02 13:01:08,607 INFO L226 Difference]: Without dead ends: 353457 [2019-10-02 13:01:08,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:01:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353457 states. [2019-10-02 13:01:34,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353457 to 352728. [2019-10-02 13:01:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352728 states. [2019-10-02 13:01:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352728 states to 352728 states and 592021 transitions. [2019-10-02 13:01:35,135 INFO L78 Accepts]: Start accepts. Automaton has 352728 states and 592021 transitions. Word has length 199 [2019-10-02 13:01:35,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:35,135 INFO L475 AbstractCegarLoop]: Abstraction has 352728 states and 592021 transitions. [2019-10-02 13:01:35,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:01:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 352728 states and 592021 transitions. [2019-10-02 13:01:36,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-02 13:01:36,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:36,653 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:01:36,654 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 36469589, now seen corresponding path program 1 times [2019-10-02 13:01:36,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:36,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:36,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:36,823 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-02 13:01:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:01:36,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:01:36,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:01:36,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:01:36,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:01:36,825 INFO L87 Difference]: Start difference. First operand 352728 states and 592021 transitions. Second operand 5 states. [2019-10-02 13:01:56,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:56,025 INFO L93 Difference]: Finished difference Result 354471 states and 594153 transitions. [2019-10-02 13:01:56,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:01:56,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 339 [2019-10-02 13:01:56,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:57,245 INFO L225 Difference]: With dead ends: 354471 [2019-10-02 13:01:57,245 INFO L226 Difference]: Without dead ends: 351451 [2019-10-02 13:01:57,352 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:01:57,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351451 states. [2019-10-02 13:02:22,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351451 to 350586. [2019-10-02 13:02:22,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350586 states. [2019-10-02 13:02:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350586 states to 350586 states and 589192 transitions. [2019-10-02 13:02:30,759 INFO L78 Accepts]: Start accepts. Automaton has 350586 states and 589192 transitions. Word has length 339 [2019-10-02 13:02:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:30,760 INFO L475 AbstractCegarLoop]: Abstraction has 350586 states and 589192 transitions. [2019-10-02 13:02:30,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:02:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 350586 states and 589192 transitions. [2019-10-02 13:02:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-10-02 13:02:32,625 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:32,625 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:02:32,627 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:32,628 INFO L82 PathProgramCache]: Analyzing trace with hash 376269367, now seen corresponding path program 1 times [2019-10-02 13:02:32,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:32,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:32,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:32,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:32,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-02 13:02:32,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:02:32,854 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:02:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:34,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 3545 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-02 13:02:35,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:02:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 13:02:35,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:02:35,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [9] total 26 [2019-10-02 13:02:35,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:02:35,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:02:35,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:02:35,625 INFO L87 Difference]: Start difference. First operand 350586 states and 589192 transitions. Second operand 26 states. [2019-10-02 13:03:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:03:13,203 INFO L93 Difference]: Finished difference Result 353222 states and 592551 transitions. [2019-10-02 13:03:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-02 13:03:13,203 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 340 [2019-10-02 13:03:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:03:14,780 INFO L225 Difference]: With dead ends: 353222 [2019-10-02 13:03:14,780 INFO L226 Difference]: Without dead ends: 350898 [2019-10-02 13:03:14,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=605, Invalid=7405, Unknown=0, NotChecked=0, Total=8010 [2019-10-02 13:03:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350898 states. [2019-10-02 13:03:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350898 to 350697. [2019-10-02 13:03:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350697 states. [2019-10-02 13:03:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350697 states to 350697 states and 589362 transitions. [2019-10-02 13:03:44,378 INFO L78 Accepts]: Start accepts. Automaton has 350697 states and 589362 transitions. Word has length 340 [2019-10-02 13:03:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:44,379 INFO L475 AbstractCegarLoop]: Abstraction has 350697 states and 589362 transitions. [2019-10-02 13:03:44,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:03:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 350697 states and 589362 transitions. [2019-10-02 13:03:45,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-02 13:03:45,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:45,854 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:03:45,855 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:45,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2144765845, now seen corresponding path program 1 times [2019-10-02 13:03:45,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:45,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:45,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:45,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:53,057 WARN L191 SmtUtils]: Spent 7.06 s on a formula simplification that was a NOOP. DAG size: 3 [2019-10-02 13:03:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 13:03:53,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:03:53,222 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:03:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:53,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 3656 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 13:03:53,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:03:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 13:03:54,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:03:54,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5] total 19 [2019-10-02 13:03:54,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:03:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:03:54,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:03:54,057 INFO L87 Difference]: Start difference. First operand 350697 states and 589362 transitions. Second operand 19 states. [2019-10-02 13:04:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:08,289 INFO L93 Difference]: Finished difference Result 355679 states and 596121 transitions. [2019-10-02 13:04:08,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 13:04:08,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 371 [2019-10-02 13:04:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:09,544 INFO L225 Difference]: With dead ends: 355679 [2019-10-02 13:04:09,545 INFO L226 Difference]: Without dead ends: 352517 [2019-10-02 13:04:09,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-10-02 13:04:09,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352517 states. [2019-10-02 13:04:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352517 to 351863. [2019-10-02 13:04:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351863 states. [2019-10-02 13:04:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351863 states to 351863 states and 591077 transitions. [2019-10-02 13:04:41,309 INFO L78 Accepts]: Start accepts. Automaton has 351863 states and 591077 transitions. Word has length 371 [2019-10-02 13:04:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:41,309 INFO L475 AbstractCegarLoop]: Abstraction has 351863 states and 591077 transitions. [2019-10-02 13:04:41,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:04:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 351863 states and 591077 transitions. [2019-10-02 13:04:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-02 13:04:42,917 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:42,917 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:04:42,918 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:42,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:42,918 INFO L82 PathProgramCache]: Analyzing trace with hash -711259532, now seen corresponding path program 2 times [2019-10-02 13:04:42,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:42,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:42,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:42,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 13:04:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:04:43,166 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:04:43,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:04:43,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:04:43,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 3546 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 13:04:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:04:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:04:44,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:04:44,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-02 13:04:44,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:04:44,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:04:44,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:04:44,153 INFO L87 Difference]: Start difference. First operand 351863 states and 591077 transitions. Second operand 16 states. [2019-10-02 13:06:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:06:01,482 INFO L93 Difference]: Finished difference Result 1061734 states and 1836156 transitions. [2019-10-02 13:06:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-02 13:06:01,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 341 [2019-10-02 13:06:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:06:05,575 INFO L225 Difference]: With dead ends: 1061734 [2019-10-02 13:06:05,575 INFO L226 Difference]: Without dead ends: 1059721 [2019-10-02 13:06:05,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=554, Invalid=3352, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 13:06:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059721 states. [2019-10-02 13:07:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059721 to 710097. [2019-10-02 13:07:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710097 states. [2019-10-02 13:07:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710097 states to 710097 states and 1227234 transitions. [2019-10-02 13:07:30,770 INFO L78 Accepts]: Start accepts. Automaton has 710097 states and 1227234 transitions. Word has length 341 [2019-10-02 13:07:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:07:30,770 INFO L475 AbstractCegarLoop]: Abstraction has 710097 states and 1227234 transitions. [2019-10-02 13:07:30,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:07:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 710097 states and 1227234 transitions.