java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/email_spec3_product25.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 05:04:22,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:04:22,244 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:04:22,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:04:22,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:04:22,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:04:22,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:04:22,278 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:04:22,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:04:22,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:04:22,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:04:22,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:04:22,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:04:22,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:04:22,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:04:22,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:04:22,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:04:22,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:04:22,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:04:22,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:04:22,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:04:22,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:04:22,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:04:22,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:04:22,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:04:22,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:04:22,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:04:22,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:04:22,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:04:22,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:04:22,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:04:22,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:04:22,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:04:22,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:04:22,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:04:22,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:04:22,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:04:22,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:04:22,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:04:22,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:04:22,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:04:22,318 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-09-08 05:04:22,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:04:22,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:04:22,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:04:22,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:04:22,340 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:04:22,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:04:22,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:04:22,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:04:22,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:04:22,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:04:22,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:04:22,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:04:22,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:04:22,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:04:22,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:04:22,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:04:22,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:04:22,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:04:22,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:04:22,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:04:22,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:04:22,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:04:22,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:04:22,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:04:22,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:04:22,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:04:22,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:04:22,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:04:22,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:04:22,388 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:04:22,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:04:22,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:04:22,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:04:22,409 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:04:22,410 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec3_product25.cil.c [2019-09-08 05:04:22,485 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e545a38f7/20dd58ed7b08473782653ec6c21b5545/FLAG966df1520 [2019-09-08 05:04:22,994 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:04:22,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec3_product25.cil.c [2019-09-08 05:04:23,031 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e545a38f7/20dd58ed7b08473782653ec6c21b5545/FLAG966df1520 [2019-09-08 05:04:23,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e545a38f7/20dd58ed7b08473782653ec6c21b5545 [2019-09-08 05:04:23,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:04:23,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:04:23,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:04:23,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:04:23,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:04:23,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:04:23" (1/1) ... [2019-09-08 05:04:23,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749328bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:23, skipping insertion in model container [2019-09-08 05:04:23,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:04:23" (1/1) ... [2019-09-08 05:04:23,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:04:23,408 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:04:24,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:04:24,188 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:04:24,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:04:24,375 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:04:24,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24 WrapperNode [2019-09-08 05:04:24,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:04:24,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:04:24,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:04:24,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:04:24,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (1/1) ... [2019-09-08 05:04:24,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:04:24,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:04:24,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:04:24,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:04:24,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (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-09-08 05:04:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:04:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:04:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:04:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:04:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:04:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:04:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:04:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:04:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:04:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:04:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:04:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:04:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:04:24,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:04:24,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:04:24,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:04:24,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:04:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:04:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:04:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:04:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:04:24,642 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:04:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:04:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:04:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:04:24,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:04:24,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:04:24,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:04:24,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:04:24,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:04:24,644 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:04:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:04:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:04:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:04:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:04:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:04:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:04:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:04:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:04:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:04:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:04:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:04:24,647 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:04:24,648 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:04:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:04:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:04:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:04:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:04:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:04:24,649 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:04:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:04:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:04:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:04:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:04:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:04:24,650 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AddressBook [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:04:24,651 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:04:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:04:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:04:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:04:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:04:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:04:24,652 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:04:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure sendToAddressBook [2019-09-08 05:04:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:04:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:04:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:04:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 05:04:24,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AddressBook [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:04:24,654 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:04:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:04:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:04:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:04:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:04:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:04:24,655 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:04:24,656 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure bobSetAddressBook [2019-09-08 05:04:24,657 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:04:24,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:04:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:04:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:04:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:04:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:04:24,658 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:04:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:04:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:04:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:04:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:04:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:04:24,659 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:04:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:04:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:04:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:04:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:04:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:04:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:04:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:04:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:04:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:04:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:04:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:04:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:04:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:04:24,663 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:04:24,664 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure bobSetAddressBook [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:04:24,665 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:04:24,666 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:04:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:04:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:04:24,669 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:04:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:04:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:04:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:04:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure sendToAddressBook [2019-09-08 05:04:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:04:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:04:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:04:24,673 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__1 [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AddressBook [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__SignVerify_spec__2 [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:04:24,674 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:04:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AddressBook [2019-09-08 05:04:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:04:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:04:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:04:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:04:24,675 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:04:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:04:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:04:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:04:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:04:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:04:24,676 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:04:24,677 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:04:24,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:04:24,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:04:24,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:04:26,938 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:04:26,938 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:04:26,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:04:26 BoogieIcfgContainer [2019-09-08 05:04:26,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:04:26,941 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:04:26,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:04:26,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:04:26,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:04:23" (1/3) ... [2019-09-08 05:04:26,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f113c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:04:26, skipping insertion in model container [2019-09-08 05:04:26,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:04:24" (2/3) ... [2019-09-08 05:04:26,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f113c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:04:26, skipping insertion in model container [2019-09-08 05:04:26,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:04:26" (3/3) ... [2019-09-08 05:04:26,949 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec3_product25.cil.c [2019-09-08 05:04:26,959 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:04:26,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:04:26,988 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:04:27,030 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:04:27,031 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:04:27,031 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:04:27,032 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:04:27,032 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:04:27,032 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:04:27,032 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:04:27,034 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:04:27,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:04:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states. [2019-09-08 05:04:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 05:04:27,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:27,109 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:27,112 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:27,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1647259373, now seen corresponding path program 1 times [2019-09-08 05:04:27,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:27,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:27,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:27,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:04:27,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:27,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:04:27,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:04:27,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:04:27,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:04:27,783 INFO L87 Difference]: Start difference. First operand 599 states. Second operand 2 states. [2019-09-08 05:04:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:27,865 INFO L93 Difference]: Finished difference Result 884 states and 1194 transitions. [2019-09-08 05:04:27,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:04:27,866 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 179 [2019-09-08 05:04:27,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:27,907 INFO L225 Difference]: With dead ends: 884 [2019-09-08 05:04:27,910 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 05:04:27,922 INFO L628 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-09-08 05:04:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 05:04:28,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-09-08 05:04:28,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-09-08 05:04:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 774 transitions. [2019-09-08 05:04:28,027 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 774 transitions. Word has length 179 [2019-09-08 05:04:28,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:28,032 INFO L475 AbstractCegarLoop]: Abstraction has 570 states and 774 transitions. [2019-09-08 05:04:28,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:04:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 774 transitions. [2019-09-08 05:04:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 05:04:28,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:28,039 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:28,040 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:28,041 INFO L82 PathProgramCache]: Analyzing trace with hash 833139246, now seen corresponding path program 1 times [2019-09-08 05:04:28,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:28,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:28,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:28,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:28,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:04:28,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:28,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:04:28,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:04:28,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:04:28,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:04:28,285 INFO L87 Difference]: Start difference. First operand 570 states and 774 transitions. Second operand 3 states. [2019-09-08 05:04:28,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:28,364 INFO L93 Difference]: Finished difference Result 867 states and 1156 transitions. [2019-09-08 05:04:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:04:28,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 05:04:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:28,374 INFO L225 Difference]: With dead ends: 867 [2019-09-08 05:04:28,374 INFO L226 Difference]: Without dead ends: 573 [2019-09-08 05:04:28,379 INFO L628 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-09-08 05:04:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-09-08 05:04:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 572. [2019-09-08 05:04:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-09-08 05:04:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 776 transitions. [2019-09-08 05:04:28,443 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 776 transitions. Word has length 180 [2019-09-08 05:04:28,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:28,445 INFO L475 AbstractCegarLoop]: Abstraction has 572 states and 776 transitions. [2019-09-08 05:04:28,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:04:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 776 transitions. [2019-09-08 05:04:28,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 05:04:28,451 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:28,451 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:28,452 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:28,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2116903770, now seen corresponding path program 1 times [2019-09-08 05:04:28,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:28,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:28,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:28,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 05:04:28,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:28,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:04:28,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:04:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:04:28,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:04:28,642 INFO L87 Difference]: Start difference. First operand 572 states and 776 transitions. Second operand 3 states. [2019-09-08 05:04:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:28,678 INFO L93 Difference]: Finished difference Result 1122 states and 1553 transitions. [2019-09-08 05:04:28,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:04:28,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 186 [2019-09-08 05:04:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:28,683 INFO L225 Difference]: With dead ends: 1122 [2019-09-08 05:04:28,683 INFO L226 Difference]: Without dead ends: 615 [2019-09-08 05:04:28,686 INFO L628 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-09-08 05:04:28,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-08 05:04:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 614. [2019-09-08 05:04:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 05:04:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 848 transitions. [2019-09-08 05:04:28,713 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 848 transitions. Word has length 186 [2019-09-08 05:04:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:28,714 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 848 transitions. [2019-09-08 05:04:28,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:04:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 848 transitions. [2019-09-08 05:04:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 05:04:28,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:28,719 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:28,719 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:28,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1487987625, now seen corresponding path program 1 times [2019-09-08 05:04:28,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:28,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:28,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:28,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:04:28,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:28,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 05:04:28,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 05:04:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 05:04:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 05:04:28,984 INFO L87 Difference]: Start difference. First operand 614 states and 848 transitions. Second operand 12 states. [2019-09-08 05:04:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:41,243 INFO L93 Difference]: Finished difference Result 3088 states and 4236 transitions. [2019-09-08 05:04:41,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-08 05:04:41,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 187 [2019-09-08 05:04:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:41,269 INFO L225 Difference]: With dead ends: 3088 [2019-09-08 05:04:41,269 INFO L226 Difference]: Without dead ends: 2795 [2019-09-08 05:04:41,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 05:04:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2019-09-08 05:04:41,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2770. [2019-09-08 05:04:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2770 states. [2019-09-08 05:04:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 3734 transitions. [2019-09-08 05:04:41,417 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 3734 transitions. Word has length 187 [2019-09-08 05:04:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:41,418 INFO L475 AbstractCegarLoop]: Abstraction has 2770 states and 3734 transitions. [2019-09-08 05:04:41,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 05:04:41,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 3734 transitions. [2019-09-08 05:04:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 05:04:41,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:41,423 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:41,424 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:41,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:41,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2084170501, now seen corresponding path program 1 times [2019-09-08 05:04:41,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:41,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:41,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:04:41,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:41,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 05:04:41,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:04:41,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:04:41,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:04:41,833 INFO L87 Difference]: Start difference. First operand 2770 states and 3734 transitions. Second operand 18 states. [2019-09-08 05:04:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:42,605 INFO L93 Difference]: Finished difference Result 5003 states and 6784 transitions. [2019-09-08 05:04:42,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:04:42,605 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 188 [2019-09-08 05:04:42,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:42,621 INFO L225 Difference]: With dead ends: 5003 [2019-09-08 05:04:42,622 INFO L226 Difference]: Without dead ends: 2536 [2019-09-08 05:04:42,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=539, Unknown=0, NotChecked=0, Total=600 [2019-09-08 05:04:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2019-09-08 05:04:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2534. [2019-09-08 05:04:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-09-08 05:04:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 3415 transitions. [2019-09-08 05:04:42,748 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 3415 transitions. Word has length 188 [2019-09-08 05:04:42,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:42,749 INFO L475 AbstractCegarLoop]: Abstraction has 2534 states and 3415 transitions. [2019-09-08 05:04:42,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:04:42,749 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 3415 transitions. [2019-09-08 05:04:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 05:04:42,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:42,755 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:42,755 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:42,755 INFO L82 PathProgramCache]: Analyzing trace with hash -87101593, now seen corresponding path program 1 times [2019-09-08 05:04:42,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:42,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:42,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:42,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:42,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:04:42,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:04:42,944 INFO L223 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-09-08 05:04:42,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:43,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 2895 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:04:43,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:04:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 05:04:43,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:04:43,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 13 [2019-09-08 05:04:43,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 05:04:43,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 05:04:43,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:04:43,675 INFO L87 Difference]: Start difference. First operand 2534 states and 3415 transitions. Second operand 13 states. [2019-09-08 05:04:45,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:45,975 INFO L93 Difference]: Finished difference Result 5050 states and 6820 transitions. [2019-09-08 05:04:45,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:04:45,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 197 [2019-09-08 05:04:45,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:45,992 INFO L225 Difference]: With dead ends: 5050 [2019-09-08 05:04:45,993 INFO L226 Difference]: Without dead ends: 2552 [2019-09-08 05:04:46,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:04:46,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-09-08 05:04:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2550. [2019-09-08 05:04:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2550 states. [2019-09-08 05:04:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3436 transitions. [2019-09-08 05:04:46,139 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3436 transitions. Word has length 197 [2019-09-08 05:04:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:46,140 INFO L475 AbstractCegarLoop]: Abstraction has 2550 states and 3436 transitions. [2019-09-08 05:04:46,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 05:04:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3436 transitions. [2019-09-08 05:04:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 05:04:46,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:46,145 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:46,145 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:46,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:46,146 INFO L82 PathProgramCache]: Analyzing trace with hash 401011369, now seen corresponding path program 1 times [2019-09-08 05:04:46,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:46,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:46,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:46,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:46,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:04:46,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:46,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:04:46,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:04:46,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:04:46,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:04:46,360 INFO L87 Difference]: Start difference. First operand 2550 states and 3436 transitions. Second operand 7 states. [2019-09-08 05:04:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:46,690 INFO L93 Difference]: Finished difference Result 5048 states and 6809 transitions. [2019-09-08 05:04:46,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:04:46,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2019-09-08 05:04:46,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:46,706 INFO L225 Difference]: With dead ends: 5048 [2019-09-08 05:04:46,706 INFO L226 Difference]: Without dead ends: 2564 [2019-09-08 05:04:46,715 INFO L628 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-09-08 05:04:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-09-08 05:04:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2560. [2019-09-08 05:04:46,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2560 states. [2019-09-08 05:04:46,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3447 transitions. [2019-09-08 05:04:46,856 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3447 transitions. Word has length 199 [2019-09-08 05:04:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:46,859 INFO L475 AbstractCegarLoop]: Abstraction has 2560 states and 3447 transitions. [2019-09-08 05:04:46,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:04:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3447 transitions. [2019-09-08 05:04:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 05:04:46,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:46,870 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:46,870 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash 792566895, now seen corresponding path program 2 times [2019-09-08 05:04:46,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:46,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:46,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:46,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 05:04:47,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:47,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:04:47,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:04:47,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:04:47,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:04:47,202 INFO L87 Difference]: Start difference. First operand 2560 states and 3447 transitions. Second operand 7 states. [2019-09-08 05:04:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:47,738 INFO L93 Difference]: Finished difference Result 5046 states and 6808 transitions. [2019-09-08 05:04:47,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 05:04:47,739 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-09-08 05:04:47,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:47,757 INFO L225 Difference]: With dead ends: 5046 [2019-09-08 05:04:47,757 INFO L226 Difference]: Without dead ends: 2566 [2019-09-08 05:04:47,769 INFO L628 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-09-08 05:04:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-09-08 05:04:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2562. [2019-09-08 05:04:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2019-09-08 05:04:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3450 transitions. [2019-09-08 05:04:47,942 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3450 transitions. Word has length 200 [2019-09-08 05:04:47,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:47,943 INFO L475 AbstractCegarLoop]: Abstraction has 2562 states and 3450 transitions. [2019-09-08 05:04:47,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:04:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3450 transitions. [2019-09-08 05:04:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:04:47,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:47,952 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:47,952 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:47,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1028259452, now seen corresponding path program 1 times [2019-09-08 05:04:47,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:47,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:47,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:47,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:04:47,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 05:04:48,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:04:48,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 05:04:48,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 05:04:48,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 05:04:48,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:04:48,243 INFO L87 Difference]: Start difference. First operand 2562 states and 3450 transitions. Second operand 9 states. [2019-09-08 05:04:48,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:04:48,613 INFO L93 Difference]: Finished difference Result 5051 states and 6814 transitions. [2019-09-08 05:04:48,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:04:48,614 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2019-09-08 05:04:48,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:04:48,628 INFO L225 Difference]: With dead ends: 5051 [2019-09-08 05:04:48,628 INFO L226 Difference]: Without dead ends: 2564 [2019-09-08 05:04:48,636 INFO L628 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-09-08 05:04:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2019-09-08 05:04:48,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2562. [2019-09-08 05:04:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2562 states. [2019-09-08 05:04:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2562 states to 2562 states and 3449 transitions. [2019-09-08 05:04:48,753 INFO L78 Accepts]: Start accepts. Automaton has 2562 states and 3449 transitions. Word has length 201 [2019-09-08 05:04:48,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:04:48,755 INFO L475 AbstractCegarLoop]: Abstraction has 2562 states and 3449 transitions. [2019-09-08 05:04:48,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 05:04:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 2562 states and 3449 transitions. [2019-09-08 05:04:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:04:48,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:04:48,763 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:04:48,763 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:04:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:04:48,764 INFO L82 PathProgramCache]: Analyzing trace with hash 493707618, now seen corresponding path program 2 times [2019-09-08 05:04:48,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:04:48,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:04:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:48,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:04:48,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:04:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:04:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 05:04:49,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:04:49,445 INFO L223 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) [2019-09-08 05:04:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:04:50,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:04:50,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:04:50,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 2900 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:04:50,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:04:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:04:50,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:04:50,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [28] total 35 [2019-09-08 05:04:50,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 05:04:50,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 05:04:50,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1118, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:04:50,369 INFO L87 Difference]: Start difference. First operand 2562 states and 3449 transitions. Second operand 35 states. [2019-09-08 05:05:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:05:23,930 INFO L93 Difference]: Finished difference Result 15197 states and 20723 transitions. [2019-09-08 05:05:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-08 05:05:23,931 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2019-09-08 05:05:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:05:24,006 INFO L225 Difference]: With dead ends: 15197 [2019-09-08 05:05:24,006 INFO L226 Difference]: Without dead ends: 12715 [2019-09-08 05:05:24,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=969, Invalid=10161, Unknown=0, NotChecked=0, Total=11130 [2019-09-08 05:05:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12715 states. [2019-09-08 05:05:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12715 to 7935. [2019-09-08 05:05:24,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-09-08 05:05:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 10935 transitions. [2019-09-08 05:05:24,540 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 10935 transitions. Word has length 202 [2019-09-08 05:05:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:05:24,541 INFO L475 AbstractCegarLoop]: Abstraction has 7935 states and 10935 transitions. [2019-09-08 05:05:24,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 05:05:24,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 10935 transitions. [2019-09-08 05:05:24,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:05:24,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:05:24,553 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:05:24,553 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:05:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:05:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1667492292, now seen corresponding path program 1 times [2019-09-08 05:05:24,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:05:24,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:05:24,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:05:24,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:05:24,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:05:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 05:05:25,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:05:25,459 INFO L223 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-09-08 05:05:25,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:05:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:05:25,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 2898 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:05:25,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:05:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 05:05:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:05:26,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [28] total 35 [2019-09-08 05:05:26,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-08 05:05:26,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-08 05:05:26,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 05:05:26,278 INFO L87 Difference]: Start difference. First operand 7935 states and 10935 transitions. Second operand 35 states. [2019-09-08 05:05:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:05:59,794 INFO L93 Difference]: Finished difference Result 30761 states and 42471 transitions. [2019-09-08 05:05:59,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 05:05:59,796 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 203 [2019-09-08 05:05:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:05:59,898 INFO L225 Difference]: With dead ends: 30761 [2019-09-08 05:05:59,898 INFO L226 Difference]: Without dead ends: 22951 [2019-09-08 05:05:59,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1092, Invalid=9620, Unknown=0, NotChecked=0, Total=10712 [2019-09-08 05:05:59,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22951 states. [2019-09-08 05:06:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22951 to 18013. [2019-09-08 05:06:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18013 states. [2019-09-08 05:06:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18013 states to 18013 states and 24943 transitions. [2019-09-08 05:06:01,065 INFO L78 Accepts]: Start accepts. Automaton has 18013 states and 24943 transitions. Word has length 203 [2019-09-08 05:06:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:01,066 INFO L475 AbstractCegarLoop]: Abstraction has 18013 states and 24943 transitions. [2019-09-08 05:06:01,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-08 05:06:01,066 INFO L276 IsEmpty]: Start isEmpty. Operand 18013 states and 24943 transitions. [2019-09-08 05:06:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:06:01,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:01,083 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:01,084 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:01,084 INFO L82 PathProgramCache]: Analyzing trace with hash 873228724, now seen corresponding path program 1 times [2019-09-08 05:06:01,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:01,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:01,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:01,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 05:06:02,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:02,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:06:02,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:06:02,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:06:02,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:06:02,321 INFO L87 Difference]: Start difference. First operand 18013 states and 24943 transitions. Second operand 21 states. [2019-09-08 05:06:05,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:05,406 INFO L93 Difference]: Finished difference Result 49660 states and 70315 transitions. [2019-09-08 05:06:05,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 05:06:05,407 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 204 [2019-09-08 05:06:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:05,572 INFO L225 Difference]: With dead ends: 49660 [2019-09-08 05:06:05,572 INFO L226 Difference]: Without dead ends: 36827 [2019-09-08 05:06:05,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=1840, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 05:06:05,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36827 states. [2019-09-08 05:06:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36827 to 36253. [2019-09-08 05:06:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36253 states. [2019-09-08 05:06:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36253 states to 36253 states and 51591 transitions. [2019-09-08 05:06:07,799 INFO L78 Accepts]: Start accepts. Automaton has 36253 states and 51591 transitions. Word has length 204 [2019-09-08 05:06:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:07,800 INFO L475 AbstractCegarLoop]: Abstraction has 36253 states and 51591 transitions. [2019-09-08 05:06:07,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:06:07,800 INFO L276 IsEmpty]: Start isEmpty. Operand 36253 states and 51591 transitions. [2019-09-08 05:06:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-09-08 05:06:07,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:07,820 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:07,820 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:07,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2061767909, now seen corresponding path program 1 times [2019-09-08 05:06:07,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:07,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:07,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:07,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:07,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:06:07,957 INFO L223 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-09-08 05:06:07,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:08,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 2900 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 05:06:08,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:06:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:06:08,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 05:06:08,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:06:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:06:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:06:08,407 INFO L87 Difference]: Start difference. First operand 36253 states and 51591 transitions. Second operand 5 states. [2019-09-08 05:06:10,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:10,627 INFO L93 Difference]: Finished difference Result 70447 states and 99956 transitions. [2019-09-08 05:06:10,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 05:06:10,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-09-08 05:06:10,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:10,766 INFO L225 Difference]: With dead ends: 70447 [2019-09-08 05:06:10,767 INFO L226 Difference]: Without dead ends: 36397 [2019-09-08 05:06:10,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 204 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-09-08 05:06:10,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36397 states. [2019-09-08 05:06:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36397 to 36383. [2019-09-08 05:06:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36383 states. [2019-09-08 05:06:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36383 states to 36383 states and 51803 transitions. [2019-09-08 05:06:12,645 INFO L78 Accepts]: Start accepts. Automaton has 36383 states and 51803 transitions. Word has length 204 [2019-09-08 05:06:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:12,645 INFO L475 AbstractCegarLoop]: Abstraction has 36383 states and 51803 transitions. [2019-09-08 05:06:12,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:06:12,646 INFO L276 IsEmpty]: Start isEmpty. Operand 36383 states and 51803 transitions. [2019-09-08 05:06:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 05:06:12,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:12,663 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:12,663 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash 80423362, now seen corresponding path program 1 times [2019-09-08 05:06:12,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:12,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:12,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:12,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:12,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:12,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:12,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:12,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:12,786 INFO L87 Difference]: Start difference. First operand 36383 states and 51803 transitions. Second operand 3 states. [2019-09-08 05:06:13,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:13,651 INFO L93 Difference]: Finished difference Result 73281 states and 104650 transitions. [2019-09-08 05:06:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:13,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-08 05:06:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:13,792 INFO L225 Difference]: With dead ends: 73281 [2019-09-08 05:06:13,793 INFO L226 Difference]: Without dead ends: 37071 [2019-09-08 05:06:13,872 INFO L628 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-09-08 05:06:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2019-09-08 05:06:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 37067. [2019-09-08 05:06:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37067 states. [2019-09-08 05:06:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37067 states to 37067 states and 53029 transitions. [2019-09-08 05:06:15,664 INFO L78 Accepts]: Start accepts. Automaton has 37067 states and 53029 transitions. Word has length 210 [2019-09-08 05:06:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:15,665 INFO L475 AbstractCegarLoop]: Abstraction has 37067 states and 53029 transitions. [2019-09-08 05:06:15,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:15,665 INFO L276 IsEmpty]: Start isEmpty. Operand 37067 states and 53029 transitions. [2019-09-08 05:06:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:06:15,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:15,689 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:15,689 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:15,689 INFO L82 PathProgramCache]: Analyzing trace with hash -367825710, now seen corresponding path program 2 times [2019-09-08 05:06:15,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:15,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:15,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:15,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:15,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:06:15,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:06:15,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:06:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:06:15,836 INFO L87 Difference]: Start difference. First operand 37067 states and 53029 transitions. Second operand 6 states. [2019-09-08 05:06:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:17,233 INFO L93 Difference]: Finished difference Result 73861 states and 105686 transitions. [2019-09-08 05:06:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:06:17,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2019-09-08 05:06:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:17,329 INFO L225 Difference]: With dead ends: 73861 [2019-09-08 05:06:17,329 INFO L226 Difference]: Without dead ends: 37071 [2019-09-08 05:06:17,383 INFO L628 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-09-08 05:06:17,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37071 states. [2019-09-08 05:06:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37071 to 37067. [2019-09-08 05:06:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37067 states. [2019-09-08 05:06:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37067 states to 37067 states and 53013 transitions. [2019-09-08 05:06:20,414 INFO L78 Accepts]: Start accepts. Automaton has 37067 states and 53013 transitions. Word has length 211 [2019-09-08 05:06:20,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:20,415 INFO L475 AbstractCegarLoop]: Abstraction has 37067 states and 53013 transitions. [2019-09-08 05:06:20,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:06:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37067 states and 53013 transitions. [2019-09-08 05:06:20,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-08 05:06:20,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:20,434 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:20,435 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:20,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:20,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2098784163, now seen corresponding path program 1 times [2019-09-08 05:06:20,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:20,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:20,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:06:20,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:20,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:20,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:20,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:20,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:20,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:20,574 INFO L87 Difference]: Start difference. First operand 37067 states and 53013 transitions. Second operand 3 states. [2019-09-08 05:06:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:21,601 INFO L93 Difference]: Finished difference Result 75237 states and 108134 transitions. [2019-09-08 05:06:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:21,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-08 05:06:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:21,727 INFO L225 Difference]: With dead ends: 75237 [2019-09-08 05:06:21,727 INFO L226 Difference]: Without dead ends: 38355 [2019-09-08 05:06:21,783 INFO L628 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-09-08 05:06:21,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38355 states. [2019-09-08 05:06:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38355 to 38351. [2019-09-08 05:06:23,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38351 states. [2019-09-08 05:06:23,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38351 states to 38351 states and 55303 transitions. [2019-09-08 05:06:23,414 INFO L78 Accepts]: Start accepts. Automaton has 38351 states and 55303 transitions. Word has length 211 [2019-09-08 05:06:23,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:23,415 INFO L475 AbstractCegarLoop]: Abstraction has 38351 states and 55303 transitions. [2019-09-08 05:06:23,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 38351 states and 55303 transitions. [2019-09-08 05:06:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-08 05:06:23,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:23,439 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:23,439 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:23,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:23,439 INFO L82 PathProgramCache]: Analyzing trace with hash -160955968, now seen corresponding path program 1 times [2019-09-08 05:06:23,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:23,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:23,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:23,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:23,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:23,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:23,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:23,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:23,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:23,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:23,570 INFO L87 Difference]: Start difference. First operand 38351 states and 55303 transitions. Second operand 3 states. [2019-09-08 05:06:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:24,985 INFO L93 Difference]: Finished difference Result 78981 states and 114762 transitions. [2019-09-08 05:06:24,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:24,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-08 05:06:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:25,090 INFO L225 Difference]: With dead ends: 78981 [2019-09-08 05:06:25,091 INFO L226 Difference]: Without dead ends: 40831 [2019-09-08 05:06:25,147 INFO L628 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-09-08 05:06:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40831 states. [2019-09-08 05:06:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40831 to 40827. [2019-09-08 05:06:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40827 states. [2019-09-08 05:06:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40827 states to 40827 states and 59633 transitions. [2019-09-08 05:06:27,152 INFO L78 Accepts]: Start accepts. Automaton has 40827 states and 59633 transitions. Word has length 212 [2019-09-08 05:06:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:27,153 INFO L475 AbstractCegarLoop]: Abstraction has 40827 states and 59633 transitions. [2019-09-08 05:06:27,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40827 states and 59633 transitions. [2019-09-08 05:06:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-08 05:06:27,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:27,174 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:27,175 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash 946022627, now seen corresponding path program 1 times [2019-09-08 05:06:27,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:27,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:27,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:27,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:27,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:27,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:27,299 INFO L87 Difference]: Start difference. First operand 40827 states and 59633 transitions. Second operand 3 states. [2019-09-08 05:06:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:28,468 INFO L93 Difference]: Finished difference Result 86181 states and 127326 transitions. [2019-09-08 05:06:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:28,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-08 05:06:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:28,611 INFO L225 Difference]: With dead ends: 86181 [2019-09-08 05:06:28,611 INFO L226 Difference]: Without dead ends: 45579 [2019-09-08 05:06:28,683 INFO L628 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-09-08 05:06:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45579 states. [2019-09-08 05:06:30,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45579 to 45575. [2019-09-08 05:06:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45575 states. [2019-09-08 05:06:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45575 states to 45575 states and 67835 transitions. [2019-09-08 05:06:30,864 INFO L78 Accepts]: Start accepts. Automaton has 45575 states and 67835 transitions. Word has length 213 [2019-09-08 05:06:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:30,864 INFO L475 AbstractCegarLoop]: Abstraction has 45575 states and 67835 transitions. [2019-09-08 05:06:30,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 45575 states and 67835 transitions. [2019-09-08 05:06:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 05:06:30,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:30,898 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:30,898 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1119859840, now seen corresponding path program 1 times [2019-09-08 05:06:30,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:30,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:30,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:30,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:31,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:31,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:31,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:31,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:31,041 INFO L87 Difference]: Start difference. First operand 45575 states and 67835 transitions. Second operand 3 states. [2019-09-08 05:06:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:34,262 INFO L93 Difference]: Finished difference Result 100001 states and 151378 transitions. [2019-09-08 05:06:34,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:34,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-09-08 05:06:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:34,410 INFO L225 Difference]: With dead ends: 100001 [2019-09-08 05:06:34,410 INFO L226 Difference]: Without dead ends: 54671 [2019-09-08 05:06:34,476 INFO L628 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-09-08 05:06:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54671 states. [2019-09-08 05:06:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54671 to 54667. [2019-09-08 05:06:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54667 states. [2019-09-08 05:06:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54667 states to 54667 states and 83581 transitions. [2019-09-08 05:06:36,679 INFO L78 Accepts]: Start accepts. Automaton has 54667 states and 83581 transitions. Word has length 214 [2019-09-08 05:06:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:36,680 INFO L475 AbstractCegarLoop]: Abstraction has 54667 states and 83581 transitions. [2019-09-08 05:06:36,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 54667 states and 83581 transitions. [2019-09-08 05:06:36,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 05:06:36,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:36,763 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:36,763 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:36,763 INFO L82 PathProgramCache]: Analyzing trace with hash 4096547, now seen corresponding path program 1 times [2019-09-08 05:06:36,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:36,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:36,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:36,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:36,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:36,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:36,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:36,904 INFO L87 Difference]: Start difference. First operand 54667 states and 83581 transitions. Second operand 3 states. [2019-09-08 05:06:39,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:39,209 INFO L93 Difference]: Finished difference Result 126493 states and 197318 transitions. [2019-09-08 05:06:39,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:39,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-09-08 05:06:39,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:39,407 INFO L225 Difference]: With dead ends: 126493 [2019-09-08 05:06:39,407 INFO L226 Difference]: Without dead ends: 72083 [2019-09-08 05:06:39,493 INFO L628 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-09-08 05:06:39,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72083 states. [2019-09-08 05:06:44,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72083 to 72079. [2019-09-08 05:06:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72079 states. [2019-09-08 05:06:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72079 states to 72079 states and 113535 transitions. [2019-09-08 05:06:44,659 INFO L78 Accepts]: Start accepts. Automaton has 72079 states and 113535 transitions. Word has length 215 [2019-09-08 05:06:44,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:44,659 INFO L475 AbstractCegarLoop]: Abstraction has 72079 states and 113535 transitions. [2019-09-08 05:06:44,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:06:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 72079 states and 113535 transitions. [2019-09-08 05:06:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 05:06:44,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:44,821 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:44,821 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:44,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:44,822 INFO L82 PathProgramCache]: Analyzing trace with hash 183917552, now seen corresponding path program 1 times [2019-09-08 05:06:44,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:44,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:44,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:44,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:06:44,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:06:44,994 INFO L223 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) [2019-09-08 05:06:45,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:06:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:45,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 2964 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 05:06:45,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:06:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 05:06:45,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:06:45,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 05:06:45,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:06:45,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:06:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:06:45,816 INFO L87 Difference]: Start difference. First operand 72079 states and 113535 transitions. Second operand 6 states. [2019-09-08 05:06:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:50,164 INFO L93 Difference]: Finished difference Result 108043 states and 164730 transitions. [2019-09-08 05:06:50,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:06:50,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 222 [2019-09-08 05:06:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:50,338 INFO L225 Difference]: With dead ends: 108043 [2019-09-08 05:06:50,338 INFO L226 Difference]: Without dead ends: 73993 [2019-09-08 05:06:50,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 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-09-08 05:06:50,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73993 states. [2019-09-08 05:06:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73993 to 73823. [2019-09-08 05:06:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73823 states. [2019-09-08 05:06:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73823 states to 73823 states and 116269 transitions. [2019-09-08 05:06:53,298 INFO L78 Accepts]: Start accepts. Automaton has 73823 states and 116269 transitions. Word has length 222 [2019-09-08 05:06:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:06:53,298 INFO L475 AbstractCegarLoop]: Abstraction has 73823 states and 116269 transitions. [2019-09-08 05:06:53,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:06:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 73823 states and 116269 transitions. [2019-09-08 05:06:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 05:06:53,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:06:53,468 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:06:53,468 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:06:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:06:53,468 INFO L82 PathProgramCache]: Analyzing trace with hash 950816576, now seen corresponding path program 1 times [2019-09-08 05:06:53,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:06:53,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:06:53,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:53,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:06:53,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:06:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:06:53,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:06:53,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:06:53,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:06:53,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:06:53,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:06:53,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:06:53,600 INFO L87 Difference]: Start difference. First operand 73823 states and 116269 transitions. Second operand 3 states. [2019-09-08 05:06:57,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:06:57,502 INFO L93 Difference]: Finished difference Result 179821 states and 288806 transitions. [2019-09-08 05:06:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:06:57,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-09-08 05:06:57,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:06:57,766 INFO L225 Difference]: With dead ends: 179821 [2019-09-08 05:06:57,766 INFO L226 Difference]: Without dead ends: 107275 [2019-09-08 05:06:57,862 INFO L628 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-09-08 05:06:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107275 states. [2019-09-08 05:07:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107275 to 107271. [2019-09-08 05:07:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107271 states. [2019-09-08 05:07:05,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107271 states to 107271 states and 173301 transitions. [2019-09-08 05:07:05,359 INFO L78 Accepts]: Start accepts. Automaton has 107271 states and 173301 transitions. Word has length 216 [2019-09-08 05:07:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:05,359 INFO L475 AbstractCegarLoop]: Abstraction has 107271 states and 173301 transitions. [2019-09-08 05:07:05,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:07:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 107271 states and 173301 transitions. [2019-09-08 05:07:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-08 05:07:05,573 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:05,573 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:05,574 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:05,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash 549385059, now seen corresponding path program 1 times [2019-09-08 05:07:05,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:05,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:05,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:07:05,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:05,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:07:05,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:07:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:07:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:07:05,703 INFO L87 Difference]: Start difference. First operand 107271 states and 173301 transitions. Second operand 3 states. [2019-09-08 05:07:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:15,433 INFO L93 Difference]: Finished difference Result 276867 states and 452424 transitions. [2019-09-08 05:07:15,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:07:15,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-09-08 05:07:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:15,864 INFO L225 Difference]: With dead ends: 276867 [2019-09-08 05:07:15,864 INFO L226 Difference]: Without dead ends: 171147 [2019-09-08 05:07:16,007 INFO L628 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-09-08 05:07:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171147 states. [2019-09-08 05:07:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171147 to 171143. [2019-09-08 05:07:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171143 states. [2019-09-08 05:07:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171143 states to 171143 states and 279285 transitions. [2019-09-08 05:07:24,212 INFO L78 Accepts]: Start accepts. Automaton has 171143 states and 279285 transitions. Word has length 217 [2019-09-08 05:07:24,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:07:24,213 INFO L475 AbstractCegarLoop]: Abstraction has 171143 states and 279285 transitions. [2019-09-08 05:07:24,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:07:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 171143 states and 279285 transitions. [2019-09-08 05:07:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 05:07:24,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:07:24,585 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:07:24,585 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:07:24,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:07:24,585 INFO L82 PathProgramCache]: Analyzing trace with hash 861524480, now seen corresponding path program 1 times [2019-09-08 05:07:24,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:07:24,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:07:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:24,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:07:24,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:07:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:07:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:07:24,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:07:24,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:07:24,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:07:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:07:24,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:07:24,710 INFO L87 Difference]: Start difference. First operand 171143 states and 279285 transitions. Second operand 3 states. [2019-09-08 05:07:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:07:39,553 INFO L93 Difference]: Finished difference Result 461293 states and 760710 transitions. [2019-09-08 05:07:39,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:07:39,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-09-08 05:07:39,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:07:40,455 INFO L225 Difference]: With dead ends: 461293 [2019-09-08 05:07:40,455 INFO L226 Difference]: Without dead ends: 292163 [2019-09-08 05:07:40,709 INFO L628 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-09-08 05:07:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292163 states. [2019-09-08 05:08:00,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292163 to 292159. [2019-09-08 05:08:00,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292159 states. [2019-09-08 05:08:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292159 states to 292159 states and 480193 transitions. [2019-09-08 05:08:01,193 INFO L78 Accepts]: Start accepts. Automaton has 292159 states and 480193 transitions. Word has length 218 [2019-09-08 05:08:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:08:01,193 INFO L475 AbstractCegarLoop]: Abstraction has 292159 states and 480193 transitions. [2019-09-08 05:08:01,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:08:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 292159 states and 480193 transitions. [2019-09-08 05:08:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-08 05:08:01,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:08:01,741 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:08:01,742 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:08:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:08:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -411534173, now seen corresponding path program 1 times [2019-09-08 05:08:01,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:08:01,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:08:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:01,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:08:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:08:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:08:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:08:01,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:08:01,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:08:01,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:08:01,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:08:01,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:08:01,859 INFO L87 Difference]: Start difference. First operand 292159 states and 480193 transitions. Second operand 3 states. [2019-09-08 05:08:33,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:08:33,983 INFO L93 Difference]: Finished difference Result 555929 states and 905640 transitions. [2019-09-08 05:08:33,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:08:33,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2019-09-08 05:08:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:08:35,438 INFO L225 Difference]: With dead ends: 555929 [2019-09-08 05:08:35,438 INFO L226 Difference]: Without dead ends: 521879 [2019-09-08 05:08:35,593 INFO L628 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-09-08 05:08:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521879 states. [2019-09-08 05:09:19,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521879 to 521875. [2019-09-08 05:09:19,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521875 states. [2019-09-08 05:09:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521875 states to 521875 states and 849273 transitions. [2019-09-08 05:09:21,278 INFO L78 Accepts]: Start accepts. Automaton has 521875 states and 849273 transitions. Word has length 219 [2019-09-08 05:09:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:09:21,279 INFO L475 AbstractCegarLoop]: Abstraction has 521875 states and 849273 transitions. [2019-09-08 05:09:21,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:09:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 521875 states and 849273 transitions. [2019-09-08 05:09:22,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 05:09:22,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:09:22,049 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:09:22,050 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:09:22,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:09:22,050 INFO L82 PathProgramCache]: Analyzing trace with hash -327926592, now seen corresponding path program 1 times [2019-09-08 05:09:22,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:09:22,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:09:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:09:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:09:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:09:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 05:09:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:09:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 05:09:22,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 05:09:22,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 05:09:22,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-09-08 05:09:22,600 INFO L87 Difference]: Start difference. First operand 521875 states and 849273 transitions. Second operand 21 states. [2019-09-08 05:09:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:09:54,488 INFO L93 Difference]: Finished difference Result 569085 states and 917468 transitions. [2019-09-08 05:09:54,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 05:09:54,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 220 [2019-09-08 05:09:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:09:56,070 INFO L225 Difference]: With dead ends: 569085 [2019-09-08 05:09:56,071 INFO L226 Difference]: Without dead ends: 541015 [2019-09-08 05:09:56,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=192, Invalid=1878, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 05:09:57,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541015 states. [2019-09-08 05:10:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541015 to 540253. [2019-09-08 05:10:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540253 states. [2019-09-08 05:10:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540253 states to 540253 states and 876100 transitions. [2019-09-08 05:10:48,267 INFO L78 Accepts]: Start accepts. Automaton has 540253 states and 876100 transitions. Word has length 220 [2019-09-08 05:10:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:10:48,268 INFO L475 AbstractCegarLoop]: Abstraction has 540253 states and 876100 transitions. [2019-09-08 05:10:48,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 05:10:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 540253 states and 876100 transitions. [2019-09-08 05:10:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-08 05:10:49,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:10:49,043 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:10:49,044 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:10:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:10:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1923514793, now seen corresponding path program 1 times [2019-09-08 05:10:49,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:10:49,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:10:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:49,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:10:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 05:10:50,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:10:50,926 INFO L223 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-09-08 05:10:50,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:10:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:10:51,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 2971 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-08 05:10:51,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:10:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 05:10:52,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 05:10:52,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 49 [2019-09-08 05:10:52,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-08 05:10:52,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-08 05:10:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 05:10:52,153 INFO L87 Difference]: Start difference. First operand 540253 states and 876100 transitions. Second operand 49 states. [2019-09-08 05:12:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:12:36,408 INFO L93 Difference]: Finished difference Result 1146229 states and 1888269 transitions. [2019-09-08 05:12:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-08 05:12:36,409 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 220 [2019-09-08 05:12:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:12:40,078 INFO L225 Difference]: With dead ends: 1146229 [2019-09-08 05:12:40,078 INFO L226 Difference]: Without dead ends: 1103547 [2019-09-08 05:12:40,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1005, Invalid=9501, Unknown=0, NotChecked=0, Total=10506 [2019-09-08 05:12:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103547 states.