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_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:57:30,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:57:30,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:57:30,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:57:30,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:57:30,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:57:30,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:57:30,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:57:30,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:57:30,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:57:30,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:57:30,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:57:30,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:57:30,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:57:30,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:57:30,376 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:57:30,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:57:30,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:57:30,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:57:30,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:57:30,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:57:30,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:57:30,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:57:30,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:57:30,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:57:30,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:57:30,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:57:30,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:57:30,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:57:30,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:57:30,390 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:57:30,391 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:57:30,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:57:30,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:57:30,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:57:30,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:57:30,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:57:30,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:57:30,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:57:30,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:57:30,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:57:30,397 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:30,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:57:30,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:57:30,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:57:30,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:57:30,413 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:57:30,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:57:30,413 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:57:30,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:57:30,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:57:30,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:57:30,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:57:30,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:57:30,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:57:30,415 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:57:30,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:57:30,415 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:57:30,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:57:30,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:57:30,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:57:30,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:57:30,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:57:30,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:57:30,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:57:30,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:57:30,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:57:30,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:57:30,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:57:30,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:57:30,418 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:57:30,446 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:57:30,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:57:30,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:57:30,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:57:30,464 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:57:30,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product31.cil.c [2019-10-02 12:57:30,528 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd5ab436/4e879f058fbf4929bdaf751464ce1da4/FLAG6e2ff11e8 [2019-10-02 12:57:31,170 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:57:31,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product31.cil.c [2019-10-02 12:57:31,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd5ab436/4e879f058fbf4929bdaf751464ce1da4/FLAG6e2ff11e8 [2019-10-02 12:57:31,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd5ab436/4e879f058fbf4929bdaf751464ce1da4 [2019-10-02 12:57:31,379 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:57:31,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:57:31,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:57:31,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:57:31,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:57:31,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:57:31" (1/1) ... [2019-10-02 12:57:31,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c6c84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:31, skipping insertion in model container [2019-10-02 12:57:31,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:57:31" (1/1) ... [2019-10-02 12:57:31,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:57:31,482 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:57:32,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:57:32,327 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:57:32,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:57:32,626 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:57:32,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:32 WrapperNode [2019-10-02 12:57:32,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:57:32,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:57:32,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:57:32,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:57:32,643 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:32" (1/1) ... [2019-10-02 12:57:32,644 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:32" (1/1) ... [2019-10-02 12:57:32,711 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:32" (1/1) ... [2019-10-02 12:57:32,715 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:32" (1/1) ... [2019-10-02 12:57:32,796 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:32" (1/1) ... [2019-10-02 12:57:32,836 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:32" (1/1) ... [2019-10-02 12:57:32,849 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:32" (1/1) ... [2019-10-02 12:57:32,866 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:57:32,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:57:32,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:57:32,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:57:32,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:32" (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:32,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:57:32,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:57:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:57:32,942 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 12:57:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:57:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 12:57:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 12:57:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 12:57:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 12:57:32,944 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 12:57:32,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 12:57:32,944 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 12:57:32,945 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 12:57:32,945 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 12:57:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 12:57:32,946 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 12:57:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 12:57:32,949 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 12:57:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 12:57:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 12:57:32,950 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 12:57:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 12:57:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 12:57:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 12:57:32,951 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 12:57:32,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:57:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:57:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:57:32,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 12:57:32,954 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 12:57:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 12:57:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 12:57:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 12:57:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:57:32,955 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:57:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:57:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:57:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:57:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 12:57:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 12:57:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 12:57:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 12:57:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 12:57:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 12:57:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 12:57:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 12:57:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:57:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:57:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 12:57:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 12:57:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 12:57:32,958 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 12:57:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 12:57:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 12:57:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 12:57:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 12:57:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 12:57:32,959 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 12:57:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 12:57:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 12:57:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 12:57:32,960 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 12:57:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 12:57:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 12:57:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 12:57:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 12:57:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 12:57:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 12:57:32,962 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 12:57:32,962 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 12:57:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 12:57:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 12:57:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 12:57:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 12:57:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 12:57:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 12:57:32,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 12:57:32,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 12:57:32,964 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 12:57:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 12:57:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 12:57:32,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 12:57:32,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 12:57:32,966 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 12:57:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 12:57:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 12:57:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 12:57:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 12:57:32,967 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 12:57:32,968 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 12:57:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 12:57:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 12:57:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 12:57:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 12:57:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 12:57:32,969 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 12:57:32,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:57:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:57:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:57:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:57:32,971 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 12:57:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:57:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:57:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 12:57:32,972 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 12:57:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__AddressBookEncrypt_spec__1 [2019-10-02 12:57:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 12:57:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 12:57:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 12:57:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 12:57:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 12:57:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 12:57:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 12:57:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 12:57:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 12:57:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 12:57:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 12:57:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 12:57:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 12:57:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 12:57:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 12:57:32,977 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 12:57:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 12:57:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 12:57:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 12:57:32,981 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 12:57:32,982 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 12:57:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 12:57:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 12:57:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 12:57:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 12:57:32,983 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 12:57:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 12:57:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 12:57:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 12:57:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 12:57:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 12:57:32,984 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 12:57:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 12:57:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 12:57:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 12:57:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:57:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:57:32,985 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:57:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:57:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:57:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:57:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:57:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:57:32,986 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:57:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:57:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:57:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:57:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:57:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:57:32,987 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:57:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:57:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 12:57:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 12:57:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 12:57:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 12:57:32,988 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 12:57:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 12:57:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 12:57:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 12:57:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 12:57:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 12:57:32,989 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 12:57:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 12:57:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 12:57:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 12:57:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 12:57:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 12:57:32,990 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:57:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:57:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:57:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:57:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:57:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 12:57:32,991 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 12:57:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 12:57:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 12:57:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 12:57:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 12:57:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 12:57:32,992 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 12:57:32,993 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 12:57:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 12:57:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 12:57:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 12:57:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 12:57:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 12:57:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 12:57:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 12:57:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 12:57:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 12:57:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 12:57:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 12:57:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 12:57:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 12:57:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 12:57:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 12:57:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 12:57:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 12:57:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 12:57:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 12:57:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 12:57:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 12:57:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 12:57:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 12:57:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 12:57:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 12:57:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:57:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:57:32,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:57:35,117 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:57:35,117 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 12:57:35,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:57:35 BoogieIcfgContainer [2019-10-02 12:57:35,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:57:35,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:57:35,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:57:35,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:57:35,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:57:31" (1/3) ... [2019-10-02 12:57:35,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2922bd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:57:35, skipping insertion in model container [2019-10-02 12:57:35,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:57:32" (2/3) ... [2019-10-02 12:57:35,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2922bd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:57:35, skipping insertion in model container [2019-10-02 12:57:35,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:57:35" (3/3) ... [2019-10-02 12:57:35,131 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec1_product31.cil.c [2019-10-02 12:57:35,142 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:57:35,157 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:57:35,175 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:57:35,224 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:57:35,224 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:57:35,225 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:57:35,225 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:57:35,225 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:57:35,226 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:57:35,230 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:57:35,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:57:35,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:57:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states. [2019-10-02 12:57:35,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:57:35,309 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:35,312 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:35,314 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1912188797, now seen corresponding path program 1 times [2019-10-02 12:57:35,322 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:35,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:35,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:35,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:36,056 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:36,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:36,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 12:57:36,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 12:57:36,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 12:57:36,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 12:57:36,082 INFO L87 Difference]: Start difference. First operand 558 states. Second operand 2 states. [2019-10-02 12:57:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:36,163 INFO L93 Difference]: Finished difference Result 858 states and 1126 transitions. [2019-10-02 12:57:36,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 12:57:36,164 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 158 [2019-10-02 12:57:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:36,193 INFO L225 Difference]: With dead ends: 858 [2019-10-02 12:57:36,194 INFO L226 Difference]: Without dead ends: 535 [2019-10-02 12:57:36,201 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:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-02 12:57:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2019-10-02 12:57:36,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-10-02 12:57:36,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 707 transitions. [2019-10-02 12:57:36,296 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 707 transitions. Word has length 158 [2019-10-02 12:57:36,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:36,299 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 707 transitions. [2019-10-02 12:57:36,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 12:57:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 707 transitions. [2019-10-02 12:57:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:57:36,303 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:36,304 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:36,304 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:36,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 692839449, now seen corresponding path program 1 times [2019-10-02 12:57:36,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:36,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:36,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:36,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:36,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:36,519 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:36,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:36,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:36,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:36,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:36,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:36,525 INFO L87 Difference]: Start difference. First operand 535 states and 707 transitions. Second operand 3 states. [2019-10-02 12:57:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:36,610 INFO L93 Difference]: Finished difference Result 841 states and 1094 transitions. [2019-10-02 12:57:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:36,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-10-02 12:57:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:36,621 INFO L225 Difference]: With dead ends: 841 [2019-10-02 12:57:36,622 INFO L226 Difference]: Without dead ends: 538 [2019-10-02 12:57:36,629 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:36,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-02 12:57:36,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 537. [2019-10-02 12:57:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2019-10-02 12:57:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 709 transitions. [2019-10-02 12:57:36,663 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 709 transitions. Word has length 159 [2019-10-02 12:57:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:36,664 INFO L475 AbstractCegarLoop]: Abstraction has 537 states and 709 transitions. [2019-10-02 12:57:36,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 709 transitions. [2019-10-02 12:57:36,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:57:36,667 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:36,667 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] [2019-10-02 12:57:36,668 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:36,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:36,668 INFO L82 PathProgramCache]: Analyzing trace with hash 62059661, now seen corresponding path program 1 times [2019-10-02 12:57:36,668 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:36,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:36,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:36,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:36,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:36,961 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:36,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:36,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:57:36,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:57:36,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:57:36,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:57:36,968 INFO L87 Difference]: Start difference. First operand 537 states and 709 transitions. Second operand 3 states. [2019-10-02 12:57:37,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:57:37,029 INFO L93 Difference]: Finished difference Result 1050 states and 1416 transitions. [2019-10-02 12:57:37,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:57:37,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-10-02 12:57:37,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:57:37,042 INFO L225 Difference]: With dead ends: 1050 [2019-10-02 12:57:37,043 INFO L226 Difference]: Without dead ends: 578 [2019-10-02 12:57:37,045 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:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-02 12:57:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 577. [2019-10-02 12:57:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-02 12:57:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 778 transitions. [2019-10-02 12:57:37,103 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 778 transitions. Word has length 165 [2019-10-02 12:57:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:57:37,104 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 778 transitions. [2019-10-02 12:57:37,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:57:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 778 transitions. [2019-10-02 12:57:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:57:37,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:57:37,116 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] [2019-10-02 12:57:37,116 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:57:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:57:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1057997395, now seen corresponding path program 1 times [2019-10-02 12:57:37,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:57:37,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:57:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:57:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:57:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:57:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:57:38,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:57:38,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2019-10-02 12:57:38,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-02 12:57:38,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-02 12:57:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1400, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 12:57:38,663 INFO L87 Difference]: Start difference. First operand 577 states and 778 transitions. Second operand 39 states. [2019-10-02 12:58:18,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:18,711 INFO L93 Difference]: Finished difference Result 6537 states and 8976 transitions. [2019-10-02 12:58:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-10-02 12:58:18,716 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 166 [2019-10-02 12:58:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:18,755 INFO L225 Difference]: With dead ends: 6537 [2019-10-02 12:58:18,755 INFO L226 Difference]: Without dead ends: 5640 [2019-10-02 12:58:18,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20966 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=3125, Invalid=56167, Unknown=0, NotChecked=0, Total=59292 [2019-10-02 12:58:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2019-10-02 12:58:19,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 5495. [2019-10-02 12:58:19,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5495 states. [2019-10-02 12:58:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 7525 transitions. [2019-10-02 12:58:19,233 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 7525 transitions. Word has length 166 [2019-10-02 12:58:19,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:19,234 INFO L475 AbstractCegarLoop]: Abstraction has 5495 states and 7525 transitions. [2019-10-02 12:58:19,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-02 12:58:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 7525 transitions. [2019-10-02 12:58:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:58:19,247 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:19,248 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] [2019-10-02 12:58:19,248 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:19,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:19,249 INFO L82 PathProgramCache]: Analyzing trace with hash 935040455, now seen corresponding path program 1 times [2019-10-02 12:58:19,249 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:19,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:19,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:19,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:19,490 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:19,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:19,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:58:19,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:58:19,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:58:19,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:19,493 INFO L87 Difference]: Start difference. First operand 5495 states and 7525 transitions. Second operand 11 states. [2019-10-02 12:58:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:20,019 INFO L93 Difference]: Finished difference Result 9458 states and 12694 transitions. [2019-10-02 12:58:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:20,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 168 [2019-10-02 12:58:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:20,061 INFO L225 Difference]: With dead ends: 9458 [2019-10-02 12:58:20,061 INFO L226 Difference]: Without dead ends: 5656 [2019-10-02 12:58:20,079 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:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2019-10-02 12:58:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 5645. [2019-10-02 12:58:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5645 states. [2019-10-02 12:58:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5645 states to 5645 states and 7768 transitions. [2019-10-02 12:58:20,425 INFO L78 Accepts]: Start accepts. Automaton has 5645 states and 7768 transitions. Word has length 168 [2019-10-02 12:58:20,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:20,426 INFO L475 AbstractCegarLoop]: Abstraction has 5645 states and 7768 transitions. [2019-10-02 12:58:20,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:58:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5645 states and 7768 transitions. [2019-10-02 12:58:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:58:20,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:20,440 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] [2019-10-02 12:58:20,440 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:20,440 INFO L82 PathProgramCache]: Analyzing trace with hash -513945168, now seen corresponding path program 1 times [2019-10-02 12:58:20,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:20,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:20,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:20,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:20,603 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:20,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:20,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:58:20,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:58:20,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:58:20,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:58:20,605 INFO L87 Difference]: Start difference. First operand 5645 states and 7768 transitions. Second operand 5 states. [2019-10-02 12:58:21,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:21,962 INFO L93 Difference]: Finished difference Result 14995 states and 20401 transitions. [2019-10-02 12:58:21,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:58:21,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 168 [2019-10-02 12:58:21,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:22,061 INFO L225 Difference]: With dead ends: 14995 [2019-10-02 12:58:22,061 INFO L226 Difference]: Without dead ends: 12741 [2019-10-02 12:58:22,076 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:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-10-02 12:58:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 12636. [2019-10-02 12:58:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12636 states. [2019-10-02 12:58:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12636 states to 12636 states and 17265 transitions. [2019-10-02 12:58:22,825 INFO L78 Accepts]: Start accepts. Automaton has 12636 states and 17265 transitions. Word has length 168 [2019-10-02 12:58:22,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:22,828 INFO L475 AbstractCegarLoop]: Abstraction has 12636 states and 17265 transitions. [2019-10-02 12:58:22,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:58:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12636 states and 17265 transitions. [2019-10-02 12:58:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:58:22,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:22,853 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] [2019-10-02 12:58:22,853 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:22,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:22,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1770918287, now seen corresponding path program 1 times [2019-10-02 12:58:22,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:22,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:22,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:22,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:23,447 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:23,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:58:23,448 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:23,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:24,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 2657 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:58:24,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:58:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 12:58:24,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:58:24,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 26 [2019-10-02 12:58:24,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:58:24,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:58:24,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:58:24,402 INFO L87 Difference]: Start difference. First operand 12636 states and 17265 transitions. Second operand 26 states. [2019-10-02 12:58:31,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:31,151 INFO L93 Difference]: Finished difference Result 21624 states and 29447 transitions. [2019-10-02 12:58:31,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:58:31,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 168 [2019-10-02 12:58:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:31,208 INFO L225 Difference]: With dead ends: 21624 [2019-10-02 12:58:31,208 INFO L226 Difference]: Without dead ends: 11162 [2019-10-02 12:58:31,244 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 847 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=366, Invalid=3666, Unknown=0, NotChecked=0, Total=4032 [2019-10-02 12:58:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11162 states. [2019-10-02 12:58:31,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11162 to 11100. [2019-10-02 12:58:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11100 states. [2019-10-02 12:58:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11100 states to 11100 states and 15263 transitions. [2019-10-02 12:58:31,887 INFO L78 Accepts]: Start accepts. Automaton has 11100 states and 15263 transitions. Word has length 168 [2019-10-02 12:58:31,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:31,887 INFO L475 AbstractCegarLoop]: Abstraction has 11100 states and 15263 transitions. [2019-10-02 12:58:31,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:58:31,888 INFO L276 IsEmpty]: Start isEmpty. Operand 11100 states and 15263 transitions. [2019-10-02 12:58:31,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:58:31,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:31,906 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] [2019-10-02 12:58:31,906 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:31,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash 979856765, now seen corresponding path program 1 times [2019-10-02 12:58:31,907 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:31,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:31,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:32,192 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:32,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:32,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:58:32,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:58:32,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:58:32,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:58:32,195 INFO L87 Difference]: Start difference. First operand 11100 states and 15263 transitions. Second operand 11 states. [2019-10-02 12:58:32,540 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-10-02 12:58:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:32,791 INFO L93 Difference]: Finished difference Result 15587 states and 21021 transitions. [2019-10-02 12:58:32,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:58:32,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 169 [2019-10-02 12:58:32,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:32,823 INFO L225 Difference]: With dead ends: 15587 [2019-10-02 12:58:32,824 INFO L226 Difference]: Without dead ends: 7174 [2019-10-02 12:58:32,849 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:58:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-10-02 12:58:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 7116. [2019-10-02 12:58:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7116 states. [2019-10-02 12:58:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 9981 transitions. [2019-10-02 12:58:33,177 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 9981 transitions. Word has length 169 [2019-10-02 12:58:33,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:33,178 INFO L475 AbstractCegarLoop]: Abstraction has 7116 states and 9981 transitions. [2019-10-02 12:58:33,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:58:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 9981 transitions. [2019-10-02 12:58:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:58:33,194 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:33,194 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] [2019-10-02 12:58:33,194 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:33,195 INFO L82 PathProgramCache]: Analyzing trace with hash -351683177, now seen corresponding path program 1 times [2019-10-02 12:58:33,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:33,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:33,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:33,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:33,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:33,342 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:33,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:58:33,343 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:33,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:33,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:58:33,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:58:33,964 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:33,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:58:33,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 12:58:33,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:58:33,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:58:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:58:33,983 INFO L87 Difference]: Start difference. First operand 7116 states and 9981 transitions. Second operand 12 states. [2019-10-02 12:58:35,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:35,667 INFO L93 Difference]: Finished difference Result 12724 states and 17570 transitions. [2019-10-02 12:58:35,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:58:35,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 170 [2019-10-02 12:58:35,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:35,689 INFO L225 Difference]: With dead ends: 12724 [2019-10-02 12:58:35,690 INFO L226 Difference]: Without dead ends: 6419 [2019-10-02 12:58:35,708 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 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:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2019-10-02 12:58:35,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 6383. [2019-10-02 12:58:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6383 states. [2019-10-02 12:58:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6383 states to 6383 states and 8813 transitions. [2019-10-02 12:58:35,988 INFO L78 Accepts]: Start accepts. Automaton has 6383 states and 8813 transitions. Word has length 170 [2019-10-02 12:58:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:35,989 INFO L475 AbstractCegarLoop]: Abstraction has 6383 states and 8813 transitions. [2019-10-02 12:58:35,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:58:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 6383 states and 8813 transitions. [2019-10-02 12:58:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:58:36,003 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:36,004 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] [2019-10-02 12:58:36,004 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:36,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:36,004 INFO L82 PathProgramCache]: Analyzing trace with hash 585438129, now seen corresponding path program 1 times [2019-10-02 12:58:36,005 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:36,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:36,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:36,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:36,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:36,589 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:36,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:36,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:58:36,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:58:36,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:58:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:58:36,597 INFO L87 Difference]: Start difference. First operand 6383 states and 8813 transitions. Second operand 26 states. [2019-10-02 12:58:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:46,187 INFO L93 Difference]: Finished difference Result 17416 states and 23764 transitions. [2019-10-02 12:58:46,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:58:46,187 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 178 [2019-10-02 12:58:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:46,236 INFO L225 Difference]: With dead ends: 17416 [2019-10-02 12:58:46,237 INFO L226 Difference]: Without dead ends: 14964 [2019-10-02 12:58:46,251 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:58:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14964 states. [2019-10-02 12:58:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14964 to 12992. [2019-10-02 12:58:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12992 states. [2019-10-02 12:58:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12992 states to 12992 states and 18045 transitions. [2019-10-02 12:58:46,878 INFO L78 Accepts]: Start accepts. Automaton has 12992 states and 18045 transitions. Word has length 178 [2019-10-02 12:58:46,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:46,879 INFO L475 AbstractCegarLoop]: Abstraction has 12992 states and 18045 transitions. [2019-10-02 12:58:46,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:58:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 12992 states and 18045 transitions. [2019-10-02 12:58:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:58:46,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:46,906 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:46,906 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash -11618886, now seen corresponding path program 1 times [2019-10-02 12:58:46,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:46,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:46,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:46,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:46,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:47,107 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:47,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:47,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:58:47,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:58:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:58:47,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:58:47,109 INFO L87 Difference]: Start difference. First operand 12992 states and 18045 transitions. Second operand 12 states. [2019-10-02 12:58:47,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:47,768 INFO L93 Difference]: Finished difference Result 21423 states and 28978 transitions. [2019-10-02 12:58:47,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:58:47,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2019-10-02 12:58:47,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:47,822 INFO L225 Difference]: With dead ends: 21423 [2019-10-02 12:58:47,822 INFO L226 Difference]: Without dead ends: 13002 [2019-10-02 12:58:47,850 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:58:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13002 states. [2019-10-02 12:58:48,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13002 to 12974. [2019-10-02 12:58:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12974 states. [2019-10-02 12:58:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 17993 transitions. [2019-10-02 12:58:48,783 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 17993 transitions. Word has length 179 [2019-10-02 12:58:48,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:48,784 INFO L475 AbstractCegarLoop]: Abstraction has 12974 states and 17993 transitions. [2019-10-02 12:58:48,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:58:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 17993 transitions. [2019-10-02 12:58:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:58:48,811 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:48,811 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] [2019-10-02 12:58:48,812 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash -986229063, now seen corresponding path program 1 times [2019-10-02 12:58:48,812 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:48,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:48,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:58:49,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:49,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:58:49,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:58:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:58:49,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:58:49,049 INFO L87 Difference]: Start difference. First operand 12974 states and 17993 transitions. Second operand 12 states. [2019-10-02 12:58:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:58:49,673 INFO L93 Difference]: Finished difference Result 14745 states and 20264 transitions. [2019-10-02 12:58:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:58:49,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2019-10-02 12:58:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:58:49,702 INFO L225 Difference]: With dead ends: 14745 [2019-10-02 12:58:49,702 INFO L226 Difference]: Without dead ends: 6445 [2019-10-02 12:58:49,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:58:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2019-10-02 12:58:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 6405. [2019-10-02 12:58:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-10-02 12:58:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 8848 transitions. [2019-10-02 12:58:50,007 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 8848 transitions. Word has length 180 [2019-10-02 12:58:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:58:50,009 INFO L475 AbstractCegarLoop]: Abstraction has 6405 states and 8848 transitions. [2019-10-02 12:58:50,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:58:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 8848 transitions. [2019-10-02 12:58:50,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:58:50,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:58:50,024 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] [2019-10-02 12:58:50,024 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:58:50,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:58:50,025 INFO L82 PathProgramCache]: Analyzing trace with hash 649997949, now seen corresponding path program 2 times [2019-10-02 12:58:50,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:58:50,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:58:50,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:50,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:58:50,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:58:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:58:50,630 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:50,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:58:50,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 12:58:50,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 12:58:50,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 12:58:50,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-10-02 12:58:50,632 INFO L87 Difference]: Start difference. First operand 6405 states and 8848 transitions. Second operand 26 states. [2019-10-02 12:59:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:00,007 INFO L93 Difference]: Finished difference Result 17372 states and 23661 transitions. [2019-10-02 12:59:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:59:00,008 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 180 [2019-10-02 12:59:00,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:00,071 INFO L225 Difference]: With dead ends: 17372 [2019-10-02 12:59:00,071 INFO L226 Difference]: Without dead ends: 14916 [2019-10-02 12:59:00,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=724, Invalid=5596, Unknown=0, NotChecked=0, Total=6320 [2019-10-02 12:59:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14916 states. [2019-10-02 12:59:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14916 to 12974. [2019-10-02 12:59:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12974 states. [2019-10-02 12:59:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 17992 transitions. [2019-10-02 12:59:01,006 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 17992 transitions. Word has length 180 [2019-10-02 12:59:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:01,007 INFO L475 AbstractCegarLoop]: Abstraction has 12974 states and 17992 transitions. [2019-10-02 12:59:01,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 12:59:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 17992 transitions. [2019-10-02 12:59:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:59:01,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:01,035 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] [2019-10-02 12:59:01,035 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1140072045, now seen corresponding path program 2 times [2019-10-02 12:59:01,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:01,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:01,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:01,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:01,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:01,226 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:01,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:01,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:59:01,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:59:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:59:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:59:01,230 INFO L87 Difference]: Start difference. First operand 12974 states and 17992 transitions. Second operand 9 states. [2019-10-02 12:59:01,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:01,759 INFO L93 Difference]: Finished difference Result 14707 states and 20223 transitions. [2019-10-02 12:59:01,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:01,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 181 [2019-10-02 12:59:01,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:01,782 INFO L225 Difference]: With dead ends: 14707 [2019-10-02 12:59:01,782 INFO L226 Difference]: Without dead ends: 6409 [2019-10-02 12:59:01,802 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,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2019-10-02 12:59:02,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 6405. [2019-10-02 12:59:02,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-10-02 12:59:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 8847 transitions. [2019-10-02 12:59:02,106 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 8847 transitions. Word has length 181 [2019-10-02 12:59:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:02,106 INFO L475 AbstractCegarLoop]: Abstraction has 6405 states and 8847 transitions. [2019-10-02 12:59:02,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:59:02,107 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 8847 transitions. [2019-10-02 12:59:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:59:02,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:02,116 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] [2019-10-02 12:59:02,116 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:02,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1671352138, now seen corresponding path program 1 times [2019-10-02 12:59:02,116 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:02,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:02,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:02,854 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:59:02,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:02,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:59:02,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:59:02,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:59:02,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:59:02,858 INFO L87 Difference]: Start difference. First operand 6405 states and 8847 transitions. Second operand 24 states. [2019-10-02 12:59:12,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:12,570 INFO L93 Difference]: Finished difference Result 15856 states and 21247 transitions. [2019-10-02 12:59:12,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-10-02 12:59:12,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 180 [2019-10-02 12:59:12,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:12,611 INFO L225 Difference]: With dead ends: 15856 [2019-10-02 12:59:12,611 INFO L226 Difference]: Without dead ends: 13400 [2019-10-02 12:59:12,620 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=769, Invalid=5711, Unknown=0, NotChecked=0, Total=6480 [2019-10-02 12:59:12,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13400 states. [2019-10-02 12:59:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13400 to 11064. [2019-10-02 12:59:13,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11064 states. [2019-10-02 12:59:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11064 states to 11064 states and 14920 transitions. [2019-10-02 12:59:13,138 INFO L78 Accepts]: Start accepts. Automaton has 11064 states and 14920 transitions. Word has length 180 [2019-10-02 12:59:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:13,139 INFO L475 AbstractCegarLoop]: Abstraction has 11064 states and 14920 transitions. [2019-10-02 12:59:13,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:59:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11064 states and 14920 transitions. [2019-10-02 12:59:13,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:59:13,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:13,149 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] [2019-10-02 12:59:13,149 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:13,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:13,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1557686464, now seen corresponding path program 1 times [2019-10-02 12:59:13,150 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:13,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:13,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:13,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:13,314 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:59:13,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:13,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:59:13,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:59:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:59:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:59:13,316 INFO L87 Difference]: Start difference. First operand 11064 states and 14920 transitions. Second operand 7 states. [2019-10-02 12:59:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:13,652 INFO L93 Difference]: Finished difference Result 11069 states and 14924 transitions. [2019-10-02 12:59:13,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:59:13,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 181 [2019-10-02 12:59:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:13,662 INFO L225 Difference]: With dead ends: 11069 [2019-10-02 12:59:13,662 INFO L226 Difference]: Without dead ends: 3553 [2019-10-02 12:59:13,674 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,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3553 states. [2019-10-02 12:59:13,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3553 to 3553. [2019-10-02 12:59:13,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3553 states. [2019-10-02 12:59:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 4787 transitions. [2019-10-02 12:59:13,824 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 4787 transitions. Word has length 181 [2019-10-02 12:59:13,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:13,825 INFO L475 AbstractCegarLoop]: Abstraction has 3553 states and 4787 transitions. [2019-10-02 12:59:13,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:59:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 4787 transitions. [2019-10-02 12:59:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:59:13,829 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:13,829 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] [2019-10-02 12:59:13,830 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:13,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:13,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1916111816, now seen corresponding path program 2 times [2019-10-02 12:59:13,830 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:13,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:13,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:14,265 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:14,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:14,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-10-02 12:59:14,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 12:59:14,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 12:59:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:59:14,269 INFO L87 Difference]: Start difference. First operand 3553 states and 4787 transitions. Second operand 24 states. [2019-10-02 12:59:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:23,672 INFO L93 Difference]: Finished difference Result 16959 states and 22961 transitions. [2019-10-02 12:59:23,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-02 12:59:23,674 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2019-10-02 12:59:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:23,719 INFO L225 Difference]: With dead ends: 16959 [2019-10-02 12:59:23,720 INFO L226 Difference]: Without dead ends: 13481 [2019-10-02 12:59:23,734 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=781, Invalid=5861, Unknown=0, NotChecked=0, Total=6642 [2019-10-02 12:59:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13481 states. [2019-10-02 12:59:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13481 to 9403. [2019-10-02 12:59:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9403 states. [2019-10-02 12:59:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9403 states to 9403 states and 12778 transitions. [2019-10-02 12:59:24,403 INFO L78 Accepts]: Start accepts. Automaton has 9403 states and 12778 transitions. Word has length 181 [2019-10-02 12:59:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:24,404 INFO L475 AbstractCegarLoop]: Abstraction has 9403 states and 12778 transitions. [2019-10-02 12:59:24,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 12:59:24,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9403 states and 12778 transitions. [2019-10-02 12:59:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:59:24,409 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:24,410 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] [2019-10-02 12:59:24,410 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1099919342, now seen corresponding path program 2 times [2019-10-02 12:59:24,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:24,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:24,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:24,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:24,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:24,541 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:24,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:24,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:59:24,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:59:24,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:59:24,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:59:24,544 INFO L87 Difference]: Start difference. First operand 9403 states and 12778 transitions. Second operand 7 states. [2019-10-02 12:59:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:24,875 INFO L93 Difference]: Finished difference Result 11128 states and 14988 transitions. [2019-10-02 12:59:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:59:24,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:59:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:24,885 INFO L225 Difference]: With dead ends: 11128 [2019-10-02 12:59:24,885 INFO L226 Difference]: Without dead ends: 3571 [2019-10-02 12:59:24,894 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:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2019-10-02 12:59:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 3555. [2019-10-02 12:59:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3555 states. [2019-10-02 12:59:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3555 states to 3555 states and 4789 transitions. [2019-10-02 12:59:25,015 INFO L78 Accepts]: Start accepts. Automaton has 3555 states and 4789 transitions. Word has length 182 [2019-10-02 12:59:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:25,015 INFO L475 AbstractCegarLoop]: Abstraction has 3555 states and 4789 transitions. [2019-10-02 12:59:25,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:59:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3555 states and 4789 transitions. [2019-10-02 12:59:25,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:59:25,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:25,018 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] [2019-10-02 12:59:25,019 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:25,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1162241009, now seen corresponding path program 1 times [2019-10-02 12:59:25,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:25,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:25,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:25,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:59:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-10-02 12:59:25,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:59:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:59:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:59:25,317 INFO L87 Difference]: Start difference. First operand 3555 states and 4789 transitions. Second operand 18 states. [2019-10-02 12:59:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:30,553 INFO L93 Difference]: Finished difference Result 10185 states and 13564 transitions. [2019-10-02 12:59:30,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 12:59:30,554 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 182 [2019-10-02 12:59:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:30,570 INFO L225 Difference]: With dead ends: 10185 [2019-10-02 12:59:30,570 INFO L226 Difference]: Without dead ends: 7741 [2019-10-02 12:59:30,574 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:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7741 states. [2019-10-02 12:59:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7741 to 7637. [2019-10-02 12:59:30,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7637 states. [2019-10-02 12:59:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7637 states to 7637 states and 10277 transitions. [2019-10-02 12:59:30,909 INFO L78 Accepts]: Start accepts. Automaton has 7637 states and 10277 transitions. Word has length 182 [2019-10-02 12:59:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:30,910 INFO L475 AbstractCegarLoop]: Abstraction has 7637 states and 10277 transitions. [2019-10-02 12:59:30,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:59:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7637 states and 10277 transitions. [2019-10-02 12:59:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:59:30,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:30,914 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] [2019-10-02 12:59:30,914 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 795239195, now seen corresponding path program 1 times [2019-10-02 12:59:30,915 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:30,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:30,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:30,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:31,201 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:31,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:31,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:59:31,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:59:31,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:59:31,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:59:31,203 INFO L87 Difference]: Start difference. First operand 7637 states and 10277 transitions. Second operand 9 states. [2019-10-02 12:59:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:31,753 INFO L93 Difference]: Finished difference Result 15205 states and 20477 transitions. [2019-10-02 12:59:31,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:59:31,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 183 [2019-10-02 12:59:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:31,778 INFO L225 Difference]: With dead ends: 15205 [2019-10-02 12:59:31,779 INFO L226 Difference]: Without dead ends: 7641 [2019-10-02 12:59:31,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:59:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2019-10-02 12:59:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 7637. [2019-10-02 12:59:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7637 states. [2019-10-02 12:59:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7637 states to 7637 states and 10276 transitions. [2019-10-02 12:59:32,107 INFO L78 Accepts]: Start accepts. Automaton has 7637 states and 10276 transitions. Word has length 183 [2019-10-02 12:59:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:32,108 INFO L475 AbstractCegarLoop]: Abstraction has 7637 states and 10276 transitions. [2019-10-02 12:59:32,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:59:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7637 states and 10276 transitions. [2019-10-02 12:59:32,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:59:32,114 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:32,114 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] [2019-10-02 12:59:32,114 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1133693031, now seen corresponding path program 1 times [2019-10-02 12:59:32,115 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:32,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:32,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:32,246 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:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:32,247 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:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:32,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:59:32,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:59:32,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:59:32,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 12:59:32,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:59:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:59:32,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:59:32,892 INFO L87 Difference]: Start difference. First operand 7637 states and 10276 transitions. Second operand 5 states. [2019-10-02 12:59:33,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:33,342 INFO L93 Difference]: Finished difference Result 12036 states and 15957 transitions. [2019-10-02 12:59:33,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:59:33,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-10-02 12:59:33,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:33,358 INFO L225 Difference]: With dead ends: 12036 [2019-10-02 12:59:33,358 INFO L226 Difference]: Without dead ends: 7712 [2019-10-02 12:59:33,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 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:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7712 states. [2019-10-02 12:59:33,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7712 to 7704. [2019-10-02 12:59:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7704 states. [2019-10-02 12:59:33,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7704 states to 7704 states and 10385 transitions. [2019-10-02 12:59:33,696 INFO L78 Accepts]: Start accepts. Automaton has 7704 states and 10385 transitions. Word has length 183 [2019-10-02 12:59:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:33,697 INFO L475 AbstractCegarLoop]: Abstraction has 7704 states and 10385 transitions. [2019-10-02 12:59:33,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:59:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 7704 states and 10385 transitions. [2019-10-02 12:59:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:59:33,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:33,703 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] [2019-10-02 12:59:33,704 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:33,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1639122876, now seen corresponding path program 1 times [2019-10-02 12:59:33,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:33,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:33,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:33,818 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:33,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:33,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:33,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:33,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:33,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:33,820 INFO L87 Difference]: Start difference. First operand 7704 states and 10385 transitions. Second operand 3 states. [2019-10-02 12:59:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:34,078 INFO L93 Difference]: Finished difference Result 15800 states and 21568 transitions. [2019-10-02 12:59:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:34,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-02 12:59:34,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:34,097 INFO L225 Difference]: With dead ends: 15800 [2019-10-02 12:59:34,097 INFO L226 Difference]: Without dead ends: 8198 [2019-10-02 12:59:34,111 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:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-10-02 12:59:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8192. [2019-10-02 12:59:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-10-02 12:59:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 11280 transitions. [2019-10-02 12:59:34,443 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 11280 transitions. Word has length 189 [2019-10-02 12:59:34,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:34,443 INFO L475 AbstractCegarLoop]: Abstraction has 8192 states and 11280 transitions. [2019-10-02 12:59:34,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:34,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 11280 transitions. [2019-10-02 12:59:34,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:59:34,451 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:34,451 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:34,452 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:34,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:34,452 INFO L82 PathProgramCache]: Analyzing trace with hash -305920797, now seen corresponding path program 2 times [2019-10-02 12:59:34,452 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:34,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:34,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:34,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:59:34,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:34,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:59:34,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:59:34,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:59:34,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:59:34,599 INFO L87 Difference]: Start difference. First operand 8192 states and 11280 transitions. Second operand 6 states. [2019-10-02 12:59:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:34,905 INFO L93 Difference]: Finished difference Result 16234 states and 22361 transitions. [2019-10-02 12:59:34,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:59:34,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 190 [2019-10-02 12:59:34,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:34,925 INFO L225 Difference]: With dead ends: 16234 [2019-10-02 12:59:34,926 INFO L226 Difference]: Without dead ends: 8198 [2019-10-02 12:59:34,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:59:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8198 states. [2019-10-02 12:59:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8198 to 8192. [2019-10-02 12:59:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8192 states. [2019-10-02 12:59:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8192 states to 8192 states and 11268 transitions. [2019-10-02 12:59:35,403 INFO L78 Accepts]: Start accepts. Automaton has 8192 states and 11268 transitions. Word has length 190 [2019-10-02 12:59:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:35,403 INFO L475 AbstractCegarLoop]: Abstraction has 8192 states and 11268 transitions. [2019-10-02 12:59:35,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:59:35,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8192 states and 11268 transitions. [2019-10-02 12:59:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:59:35,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:35,412 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] [2019-10-02 12:59:35,412 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2047330802, now seen corresponding path program 1 times [2019-10-02 12:59:35,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:35,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:35,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:35,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 12:59:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:35,526 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:35,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:35,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:35,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:35,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:35,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:35,528 INFO L87 Difference]: Start difference. First operand 8192 states and 11268 transitions. Second operand 3 states. [2019-10-02 12:59:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:35,889 INFO L93 Difference]: Finished difference Result 17196 states and 24112 transitions. [2019-10-02 12:59:35,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:35,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-02 12:59:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:35,917 INFO L225 Difference]: With dead ends: 17196 [2019-10-02 12:59:35,918 INFO L226 Difference]: Without dead ends: 9112 [2019-10-02 12:59:35,933 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,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9112 states. [2019-10-02 12:59:36,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9112 to 9106. [2019-10-02 12:59:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9106 states. [2019-10-02 12:59:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9106 states to 9106 states and 12937 transitions. [2019-10-02 12:59:36,293 INFO L78 Accepts]: Start accepts. Automaton has 9106 states and 12937 transitions. Word has length 190 [2019-10-02 12:59:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:36,294 INFO L475 AbstractCegarLoop]: Abstraction has 9106 states and 12937 transitions. [2019-10-02 12:59:36,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 9106 states and 12937 transitions. [2019-10-02 12:59:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:59:36,304 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:36,304 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] [2019-10-02 12:59:36,304 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1380107230, now seen corresponding path program 1 times [2019-10-02 12:59:36,305 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:36,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:36,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:36,422 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:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:36,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:36,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:36,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:36,424 INFO L87 Difference]: Start difference. First operand 9106 states and 12937 transitions. Second operand 3 states. [2019-10-02 12:59:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:36,830 INFO L93 Difference]: Finished difference Result 19860 states and 28942 transitions. [2019-10-02 12:59:36,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:36,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-10-02 12:59:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:36,859 INFO L225 Difference]: With dead ends: 19860 [2019-10-02 12:59:36,860 INFO L226 Difference]: Without dead ends: 10870 [2019-10-02 12:59:36,877 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:36,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10870 states. [2019-10-02 12:59:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10870 to 10864. [2019-10-02 12:59:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10864 states. [2019-10-02 12:59:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10864 states to 10864 states and 16086 transitions. [2019-10-02 12:59:37,322 INFO L78 Accepts]: Start accepts. Automaton has 10864 states and 16086 transitions. Word has length 191 [2019-10-02 12:59:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:37,322 INFO L475 AbstractCegarLoop]: Abstraction has 10864 states and 16086 transitions. [2019-10-02 12:59:37,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 10864 states and 16086 transitions. [2019-10-02 12:59:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:59:37,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:37,338 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] [2019-10-02 12:59:37,338 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:37,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 155764178, now seen corresponding path program 1 times [2019-10-02 12:59:37,339 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:37,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:37,603 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:37,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:37,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:37,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:37,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:37,605 INFO L87 Difference]: Start difference. First operand 10864 states and 16086 transitions. Second operand 3 states. [2019-10-02 12:59:38,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:38,023 INFO L93 Difference]: Finished difference Result 24972 states and 38080 transitions. [2019-10-02 12:59:38,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:38,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-02 12:59:38,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:38,057 INFO L225 Difference]: With dead ends: 24972 [2019-10-02 12:59:38,057 INFO L226 Difference]: Without dead ends: 14236 [2019-10-02 12:59:38,076 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:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14236 states. [2019-10-02 12:59:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14236 to 14230. [2019-10-02 12:59:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14230 states. [2019-10-02 12:59:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14230 states to 14230 states and 22043 transitions. [2019-10-02 12:59:38,647 INFO L78 Accepts]: Start accepts. Automaton has 14230 states and 22043 transitions. Word has length 192 [2019-10-02 12:59:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:38,647 INFO L475 AbstractCegarLoop]: Abstraction has 14230 states and 22043 transitions. [2019-10-02 12:59:38,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 14230 states and 22043 transitions. [2019-10-02 12:59:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:59:38,670 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:38,670 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:38,670 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:38,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1564477442, now seen corresponding path program 1 times [2019-10-02 12:59:38,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:38,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:38,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:38,776 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:38,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:38,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:38,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:38,778 INFO L87 Difference]: Start difference. First operand 14230 states and 22043 transitions. Second operand 3 states. [2019-10-02 12:59:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:39,617 INFO L93 Difference]: Finished difference Result 34762 states and 55546 transitions. [2019-10-02 12:59:39,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:39,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-02 12:59:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:39,666 INFO L225 Difference]: With dead ends: 34762 [2019-10-02 12:59:39,667 INFO L226 Difference]: Without dead ends: 20670 [2019-10-02 12:59:39,688 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:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20670 states. [2019-10-02 12:59:40,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20670 to 20664. [2019-10-02 12:59:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20664 states. [2019-10-02 12:59:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20664 states to 20664 states and 33468 transitions. [2019-10-02 12:59:40,564 INFO L78 Accepts]: Start accepts. Automaton has 20664 states and 33468 transitions. Word has length 193 [2019-10-02 12:59:40,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:40,565 INFO L475 AbstractCegarLoop]: Abstraction has 20664 states and 33468 transitions. [2019-10-02 12:59:40,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:40,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20664 states and 33468 transitions. [2019-10-02 12:59:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:59:40,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:40,611 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:40,611 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:40,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:40,611 INFO L82 PathProgramCache]: Analyzing trace with hash -936582734, now seen corresponding path program 1 times [2019-10-02 12:59:40,611 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:40,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:40,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:40,726 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,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:40,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:40,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:40,728 INFO L87 Difference]: Start difference. First operand 20664 states and 33468 transitions. Second operand 3 states. [2019-10-02 12:59:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:42,062 INFO L93 Difference]: Finished difference Result 53481 states and 88660 transitions. [2019-10-02 12:59:42,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:42,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-02 12:59:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:42,141 INFO L225 Difference]: With dead ends: 53481 [2019-10-02 12:59:42,141 INFO L226 Difference]: Without dead ends: 32962 [2019-10-02 12:59:42,173 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:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32962 states. [2019-10-02 12:59:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32962 to 32956. [2019-10-02 12:59:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32956 states. [2019-10-02 12:59:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32956 states to 32956 states and 54975 transitions. [2019-10-02 12:59:43,544 INFO L78 Accepts]: Start accepts. Automaton has 32956 states and 54975 transitions. Word has length 194 [2019-10-02 12:59:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:43,545 INFO L475 AbstractCegarLoop]: Abstraction has 32956 states and 54975 transitions. [2019-10-02 12:59:43,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 32956 states and 54975 transitions. [2019-10-02 12:59:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:59:43,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:43,608 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:59:43,608 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:43,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:43,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1558357986, now seen corresponding path program 1 times [2019-10-02 12:59:43,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:43,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:43,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:43,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:59:43,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:59:43,743 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 12:59:45,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:45,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 2769 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:59:45,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:59:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:59:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:59:45,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 12:59:45,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:59:45,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:59:45,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:59:45,707 INFO L87 Difference]: Start difference. First operand 32956 states and 54975 transitions. Second operand 6 states. [2019-10-02 12:59:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:46,795 INFO L93 Difference]: Finished difference Result 40314 states and 64840 transitions. [2019-10-02 12:59:46,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:59:46,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 12:59:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:46,909 INFO L225 Difference]: With dead ends: 40314 [2019-10-02 12:59:46,909 INFO L226 Difference]: Without dead ends: 34062 [2019-10-02 12:59:46,933 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:59:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34062 states. [2019-10-02 12:59:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34062 to 33952. [2019-10-02 12:59:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33952 states. [2019-10-02 12:59:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33952 states to 33952 states and 56531 transitions. [2019-10-02 12:59:48,723 INFO L78 Accepts]: Start accepts. Automaton has 33952 states and 56531 transitions. Word has length 201 [2019-10-02 12:59:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:48,723 INFO L475 AbstractCegarLoop]: Abstraction has 33952 states and 56531 transitions. [2019-10-02 12:59:48,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:59:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33952 states and 56531 transitions. [2019-10-02 12:59:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:59:48,794 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:48,794 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:48,795 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:48,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1206186978, now seen corresponding path program 1 times [2019-10-02 12:59:48,795 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:48,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:48,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:48,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:48,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:48,893 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:48,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:48,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:48,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:48,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:48,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:48,895 INFO L87 Difference]: Start difference. First operand 33952 states and 56531 transitions. Second operand 3 states. [2019-10-02 12:59:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:59:51,117 INFO L93 Difference]: Finished difference Result 92275 states and 156190 transitions. [2019-10-02 12:59:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 12:59:51,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-02 12:59:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:59:51,325 INFO L225 Difference]: With dead ends: 92275 [2019-10-02 12:59:51,325 INFO L226 Difference]: Without dead ends: 59008 [2019-10-02 12:59:51,393 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:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59008 states. [2019-10-02 12:59:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59008 to 59002. [2019-10-02 12:59:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59002 states. [2019-10-02 12:59:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59002 states to 59002 states and 99837 transitions. [2019-10-02 12:59:56,216 INFO L78 Accepts]: Start accepts. Automaton has 59002 states and 99837 transitions. Word has length 195 [2019-10-02 12:59:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:59:56,216 INFO L475 AbstractCegarLoop]: Abstraction has 59002 states and 99837 transitions. [2019-10-02 12:59:56,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 12:59:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 59002 states and 99837 transitions. [2019-10-02 12:59:56,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:59:56,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:59:56,336 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:56,336 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:59:56,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:59:56,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1714560402, now seen corresponding path program 1 times [2019-10-02 12:59:56,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:59:56,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:59:56,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:56,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:59:56,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:59:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:59:56,439 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:56,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:59:56,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 12:59:56,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 12:59:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 12:59:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 12:59:56,440 INFO L87 Difference]: Start difference. First operand 59002 states and 99837 transitions. Second operand 3 states. [2019-10-02 13:00:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:00,854 INFO L93 Difference]: Finished difference Result 163454 states and 278250 transitions. [2019-10-02 13:00:00,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:00,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-10-02 13:00:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:01,144 INFO L225 Difference]: With dead ends: 163454 [2019-10-02 13:00:01,145 INFO L226 Difference]: Without dead ends: 105280 [2019-10-02 13:00:01,242 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:01,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105280 states. [2019-10-02 13:00:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105280 to 105274. [2019-10-02 13:00:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105274 states. [2019-10-02 13:00:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105274 states to 105274 states and 178042 transitions. [2019-10-02 13:00:09,708 INFO L78 Accepts]: Start accepts. Automaton has 105274 states and 178042 transitions. Word has length 196 [2019-10-02 13:00:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:09,708 INFO L475 AbstractCegarLoop]: Abstraction has 105274 states and 178042 transitions. [2019-10-02 13:00:09,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 105274 states and 178042 transitions. [2019-10-02 13:00:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 13:00:09,890 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:09,890 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 13:00:09,890 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:09,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 931717504, now seen corresponding path program 1 times [2019-10-02 13:00:09,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:09,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:09,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:09,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:09,991 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:09,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:09,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:09,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:09,994 INFO L87 Difference]: Start difference. First operand 105274 states and 178042 transitions. Second operand 3 states. [2019-10-02 13:00:20,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:20,611 INFO L93 Difference]: Finished difference Result 297079 states and 504361 transitions. [2019-10-02 13:00:20,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:20,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-02 13:00:20,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:21,225 INFO L225 Difference]: With dead ends: 297079 [2019-10-02 13:00:21,226 INFO L226 Difference]: Without dead ends: 192956 [2019-10-02 13:00:21,415 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:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192956 states. [2019-10-02 13:00:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192956 to 192950. [2019-10-02 13:00:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192950 states. [2019-10-02 13:00:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192950 states to 192950 states and 324875 transitions. [2019-10-02 13:00:35,379 INFO L78 Accepts]: Start accepts. Automaton has 192950 states and 324875 transitions. Word has length 197 [2019-10-02 13:00:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:00:35,379 INFO L475 AbstractCegarLoop]: Abstraction has 192950 states and 324875 transitions. [2019-10-02 13:00:35,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:00:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 192950 states and 324875 transitions. [2019-10-02 13:00:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-02 13:00:35,642 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:00:35,642 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:35,642 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:00:35,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:00:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 456303026, now seen corresponding path program 1 times [2019-10-02 13:00:35,643 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:00:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:00:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:35,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:00:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:00:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:00:35,747 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:35,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:00:35,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:00:35,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:00:35,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:00:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:00:35,749 INFO L87 Difference]: Start difference. First operand 192950 states and 324875 transitions. Second operand 3 states. [2019-10-02 13:00:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:00:54,382 INFO L93 Difference]: Finished difference Result 361814 states and 604229 transitions. [2019-10-02 13:00:54,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:00:54,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-02 13:00:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:00:55,560 INFO L225 Difference]: With dead ends: 361814 [2019-10-02 13:00:55,560 INFO L226 Difference]: Without dead ends: 355562 [2019-10-02 13:00:55,672 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:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355562 states. [2019-10-02 13:01:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355562 to 355556. [2019-10-02 13:01:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355556 states. [2019-10-02 13:01:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355556 states to 355556 states and 589960 transitions. [2019-10-02 13:01:27,608 INFO L78 Accepts]: Start accepts. Automaton has 355556 states and 589960 transitions. Word has length 198 [2019-10-02 13:01:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:01:27,609 INFO L475 AbstractCegarLoop]: Abstraction has 355556 states and 589960 transitions. [2019-10-02 13:01:27,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:01:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 355556 states and 589960 transitions. [2019-10-02 13:01:28,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 13:01:28,026 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:01:28,027 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:01:28,027 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:01:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:01:28,027 INFO L82 PathProgramCache]: Analyzing trace with hash 340694368, now seen corresponding path program 1 times [2019-10-02 13:01:28,027 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:01:28,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:01:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:28,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:01:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:01:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:01:28,174 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:01:28,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:01:28,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:01:28,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:01:28,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:01:28,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:01:28,177 INFO L87 Difference]: Start difference. First operand 355556 states and 589960 transitions. Second operand 3 states. [2019-10-02 13:01:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:01:49,458 INFO L93 Difference]: Finished difference Result 362302 states and 598746 transitions. [2019-10-02 13:01:49,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:01:49,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-10-02 13:01:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:01:50,726 INFO L225 Difference]: With dead ends: 362302 [2019-10-02 13:01:50,726 INFO L226 Difference]: Without dead ends: 356318 [2019-10-02 13:01:50,848 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:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356318 states. [2019-10-02 13:02:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356318 to 354683. [2019-10-02 13:02:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354683 states. [2019-10-02 13:02:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354683 states to 354683 states and 588704 transitions. [2019-10-02 13:02:31,210 INFO L78 Accepts]: Start accepts. Automaton has 354683 states and 588704 transitions. Word has length 199 [2019-10-02 13:02:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:02:31,211 INFO L475 AbstractCegarLoop]: Abstraction has 354683 states and 588704 transitions. [2019-10-02 13:02:31,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:02:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 354683 states and 588704 transitions. [2019-10-02 13:02:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-10-02 13:02:32,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:02:32,782 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:02:32,782 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:02:32,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:02:32,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1521347514, now seen corresponding path program 1 times [2019-10-02 13:02:32,783 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:02:32,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:02:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:32,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:02:32,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:02:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:02:32,941 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:02:32,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:02:32,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:02:32,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:02:32,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:02:32,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:02:32,943 INFO L87 Difference]: Start difference. First operand 354683 states and 588704 transitions. Second operand 5 states. [2019-10-02 13:02:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:02:55,956 INFO L93 Difference]: Finished difference Result 356980 states and 591544 transitions. [2019-10-02 13:02:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:02:55,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 339 [2019-10-02 13:02:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:02:57,151 INFO L225 Difference]: With dead ends: 356980 [2019-10-02 13:02:57,151 INFO L226 Difference]: Without dead ends: 353505 [2019-10-02 13:02:57,294 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:02:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353505 states. [2019-10-02 13:03:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353505 to 352819. [2019-10-02 13:03:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352819 states. [2019-10-02 13:03:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352819 states to 352819 states and 586265 transitions. [2019-10-02 13:03:32,938 INFO L78 Accepts]: Start accepts. Automaton has 352819 states and 586265 transitions. Word has length 339 [2019-10-02 13:03:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:03:32,938 INFO L475 AbstractCegarLoop]: Abstraction has 352819 states and 586265 transitions. [2019-10-02 13:03:32,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:03:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 352819 states and 586265 transitions. [2019-10-02 13:03:35,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-02 13:03:35,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:03:35,629 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:03:35,630 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:03:35,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:03:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash 619138349, now seen corresponding path program 1 times [2019-10-02 13:03:35,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:03:35,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:03:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:03:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 19 proven. 8 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-02 13:03:35,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:03:35,856 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:36,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:03:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:03:36,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 3652 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 13:03:36,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:03:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-02 13:03:36,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:03:36,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 13:03:36,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 13:03:36,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 13:03:36,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:03:36,705 INFO L87 Difference]: Start difference. First operand 352819 states and 586265 transitions. Second operand 13 states. [2019-10-02 13:04:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:04:00,938 INFO L93 Difference]: Finished difference Result 367206 states and 608246 transitions. [2019-10-02 13:04:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 13:04:00,939 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 370 [2019-10-02 13:04:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:04:02,079 INFO L225 Difference]: With dead ends: 367206 [2019-10-02 13:04:02,080 INFO L226 Difference]: Without dead ends: 363691 [2019-10-02 13:04:02,180 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-10-02 13:04:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363691 states. [2019-10-02 13:04:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363691 to 363599. [2019-10-02 13:04:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363599 states. [2019-10-02 13:04:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363599 states to 363599 states and 602643 transitions. [2019-10-02 13:04:42,945 INFO L78 Accepts]: Start accepts. Automaton has 363599 states and 602643 transitions. Word has length 370 [2019-10-02 13:04:42,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:04:42,945 INFO L475 AbstractCegarLoop]: Abstraction has 363599 states and 602643 transitions. [2019-10-02 13:04:42,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 13:04:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 363599 states and 602643 transitions. [2019-10-02 13:04:45,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-10-02 13:04:45,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:04:45,661 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:45,661 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:04:45,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:04:45,661 INFO L82 PathProgramCache]: Analyzing trace with hash -637420739, now seen corresponding path program 1 times [2019-10-02 13:04:45,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:04:45,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:04:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:45,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:45,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:04:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:45,905 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:45,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:04:45,905 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:46,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:04:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:04:46,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 3548 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-02 13:04:46,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:04:46,798 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:46,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 13:04:46,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-10-02 13:04:46,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:04:46,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:04:46,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:04:46,810 INFO L87 Difference]: Start difference. First operand 363599 states and 602643 transitions. Second operand 16 states. [2019-10-02 13:06:17,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:06:17,305 INFO L93 Difference]: Finished difference Result 1095646 states and 1869675 transitions. [2019-10-02 13:06:17,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-02 13:06:17,305 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 341 [2019-10-02 13:06:17,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:06:21,993 INFO L225 Difference]: With dead ends: 1095646 [2019-10-02 13:06:21,993 INFO L226 Difference]: Without dead ends: 1092641 [2019-10-02 13:06:22,300 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=586, Invalid=3574, Unknown=0, NotChecked=0, Total=4160 [2019-10-02 13:06:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092641 states. [2019-10-02 13:08:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092641 to 739445. [2019-10-02 13:08:03,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739445 states.