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_spec0_product33.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:29:21,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:29:21,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:29:21,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:29:21,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:29:21,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:29:21,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:29:21,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:29:21,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:29:21,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:29:21,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:29:21,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:29:21,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:29:21,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:29:21,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:29:21,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:29:21,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:29:21,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:29:21,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:29:21,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:29:21,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:29:21,469 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:29:21,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:29:21,471 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:29:21,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:29:21,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:29:21,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:29:21,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:29:21,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:29:21,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:29:21,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:29:21,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:29:21,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:29:21,480 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:29:21,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:29:21,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:29:21,482 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:29:21,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:29:21,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:29:21,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:29:21,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:29:21,485 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 04:29:21,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:29:21,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:29:21,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:29:21,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:29:21,503 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:29:21,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:29:21,503 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:29:21,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:29:21,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:29:21,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:29:21,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:29:21,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:29:21,504 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:29:21,505 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:29:21,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:29:21,505 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:29:21,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:29:21,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:29:21,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:29:21,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:29:21,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:29:21,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:29:21,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:29:21,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:29:21,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:29:21,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:29:21,507 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:29:21,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:29:21,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:29:21,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:29:21,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:29:21,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:29:21,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:29:21,568 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:29:21,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec0_product33.cil.c [2019-09-08 04:29:21,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf55c9ed/e1b9b04b1e8a45819de2a2220eabbd0c/FLAGc9068a375 [2019-09-08 04:29:22,310 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:29:22,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec0_product33.cil.c [2019-09-08 04:29:22,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf55c9ed/e1b9b04b1e8a45819de2a2220eabbd0c/FLAGc9068a375 [2019-09-08 04:29:22,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf55c9ed/e1b9b04b1e8a45819de2a2220eabbd0c [2019-09-08 04:29:22,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:29:22,493 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:29:22,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:29:22,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:29:22,501 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:29:22,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:29:22" (1/1) ... [2019-09-08 04:29:22,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328a7f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:22, skipping insertion in model container [2019-09-08 04:29:22,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:29:22" (1/1) ... [2019-09-08 04:29:22,515 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:29:22,614 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:29:23,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:29:23,450 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:29:23,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:29:23,759 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:29:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23 WrapperNode [2019-09-08 04:29:23,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:29:23,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:29:23,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:29:23,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:29:23,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:23,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:23,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:23,852 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:23,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:23,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:23,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (1/1) ... [2019-09-08 04:29:24,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:29:24,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:29:24,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:29:24,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:29:24,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (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 04:29:24,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:29:24,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:29:24,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:29:24,088 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 04:29:24,089 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 04:29:24,089 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 04:29:24,089 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 04:29:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 04:29:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 04:29:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 04:29:24,090 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 04:29:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 04:29:24,091 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 04:29:24,092 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 04:29:24,093 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 04:29:24,093 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 04:29:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 04:29:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 04:29:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 04:29:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 04:29:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 04:29:24,097 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 04:29:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 04:29:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 04:29:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 04:29:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 04:29:24,098 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 04:29:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 04:29:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 04:29:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 04:29:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 04:29:24,099 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 04:29:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 04:29:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__AutoResponder [2019-09-08 04:29:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 04:29:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 04:29:24,100 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 04:29:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 04:29:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 04:29:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 04:29:24,101 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:29:24,102 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:29:24,102 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:29:24,102 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:29:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:29:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:29:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 04:29:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 04:29:24,103 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:29:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 04:29:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 04:29:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Encrypt [2019-09-08 04:29:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 04:29:24,104 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 04:29:24,105 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 04:29:24,105 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 04:29:24,105 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 04:29:24,105 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 04:29:24,105 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 04:29:24,106 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 04:29:24,106 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 04:29:24,106 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 04:29:24,107 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 04:29:24,107 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 04:29:24,107 INFO L138 BoogieDeclarations]: Found implementation of procedure autoRespond [2019-09-08 04:29:24,108 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 04:29:24,108 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 04:29:24,108 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 04:29:24,108 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 04:29:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 04:29:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 04:29:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 04:29:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 04:29:24,110 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 04:29:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 04:29:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 04:29:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 04:29:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 04:29:24,111 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 04:29:24,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 04:29:24,112 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 04:29:24,112 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 04:29:24,113 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 04:29:24,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 04:29:24,113 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 04:29:24,113 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 04:29:24,114 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 04:29:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 04:29:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 04:29:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 04:29:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:29:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:29:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:29:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:29:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:29:24,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 04:29:24,117 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 04:29:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 04:29:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:29:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:29:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 04:29:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 04:29:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhSetAutoRespond [2019-09-08 04:29:24,119 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 04:29:24,120 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:29:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:29:24,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:29:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 04:29:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 04:29:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 04:29:24,121 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 04:29:24,122 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 04:29:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 04:29:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 04:29:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 04:29:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 04:29:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 04:29:24,123 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 04:29:24,124 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 04:29:24,124 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 04:29:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 04:29:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 04:29:24,125 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 04:29:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 04:29:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 04:29:24,126 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 04:29:24,127 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 04:29:24,135 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 04:29:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 04:29:24,137 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 04:29:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 04:29:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 04:29:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 04:29:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 04:29:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 04:29:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 04:29:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:29:24,146 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 04:29:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 04:29:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 04:29:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 04:29:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 04:29:24,147 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 04:29:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 04:29:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 04:29:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 04:29:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 04:29:24,148 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 04:29:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 04:29:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 04:29:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 04:29:24,149 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 04:29:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:29:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__AutoResponder [2019-09-08 04:29:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 04:29:24,150 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 04:29:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:29:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:29:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:29:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:29:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:29:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 04:29:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__DecryptForward_spec__1 [2019-09-08 04:29:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 04:29:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 04:29:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 04:29:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 04:29:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 04:29:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 04:29:24,153 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 04:29:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 04:29:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 04:29:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 04:29:24,154 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 04:29:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 04:29:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 04:29:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 04:29:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 04:29:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 04:29:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 04:29:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure autoRespond [2019-09-08 04:29:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 04:29:24,156 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 04:29:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 04:29:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 04:29:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2019-09-08 04:29:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Encrypt [2019-09-08 04:29:24,157 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 04:29:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 04:29:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 04:29:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 04:29:24,158 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 04:29:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 04:29:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 04:29:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 04:29:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 04:29:24,159 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 04:29:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:29:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:29:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:29:24,160 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:29:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:29:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:29:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:29:24,161 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:29:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:29:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:29:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:29:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:29:24,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:29:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:29:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:29:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:29:24,163 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 04:29:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 04:29:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 04:29:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 04:29:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 04:29:24,164 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:29:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:29:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:29:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 04:29:24,165 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 04:29:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 04:29:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 04:29:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 04:29:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 04:29:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 04:29:24,166 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 04:29:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 04:29:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure rjhSetAutoRespond [2019-09-08 04:29:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 04:29:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 04:29:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 04:29:24,167 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 04:29:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:29:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:29:24,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:29:26,636 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:29:26,636 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 04:29:26,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:29:26 BoogieIcfgContainer [2019-09-08 04:29:26,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:29:26,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:29:26,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:29:26,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:29:26,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:29:22" (1/3) ... [2019-09-08 04:29:26,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c14fad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:29:26, skipping insertion in model container [2019-09-08 04:29:26,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:29:23" (2/3) ... [2019-09-08 04:29:26,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c14fad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:29:26, skipping insertion in model container [2019-09-08 04:29:26,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:29:26" (3/3) ... [2019-09-08 04:29:26,647 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec0_product33.cil.c [2019-09-08 04:29:26,658 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:29:26,672 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:29:26,691 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:29:26,752 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:29:26,753 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:29:26,753 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:29:26,753 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:29:26,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:29:26,757 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:29:26,757 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:29:26,758 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:29:26,759 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:29:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states. [2019-09-08 04:29:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-09-08 04:29:26,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:26,846 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:26,851 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:26,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash -225515264, now seen corresponding path program 1 times [2019-09-08 04:29:26,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:26,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:26,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:26,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:27,630 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:27,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:27,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 04:29:27,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 04:29:27,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 04:29:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 04:29:27,664 INFO L87 Difference]: Start difference. First operand 587 states. Second operand 2 states. [2019-09-08 04:29:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:27,789 INFO L93 Difference]: Finished difference Result 905 states and 1190 transitions. [2019-09-08 04:29:27,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 04:29:27,791 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 232 [2019-09-08 04:29:27,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:27,825 INFO L225 Difference]: With dead ends: 905 [2019-09-08 04:29:27,826 INFO L226 Difference]: Without dead ends: 564 [2019-09-08 04:29:27,838 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 04:29:27,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-08 04:29:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-09-08 04:29:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-09-08 04:29:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 744 transitions. [2019-09-08 04:29:27,985 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 744 transitions. Word has length 232 [2019-09-08 04:29:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:27,989 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 744 transitions. [2019-09-08 04:29:27,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 04:29:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 744 transitions. [2019-09-08 04:29:27,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-09-08 04:29:27,998 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:27,999 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:27,999 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:28,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1451432834, now seen corresponding path program 1 times [2019-09-08 04:29:28,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:28,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:28,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:28,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:28,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:28,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:28,264 INFO L87 Difference]: Start difference. First operand 564 states and 744 transitions. Second operand 3 states. [2019-09-08 04:29:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:28,309 INFO L93 Difference]: Finished difference Result 888 states and 1154 transitions. [2019-09-08 04:29:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:28,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-09-08 04:29:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:28,314 INFO L225 Difference]: With dead ends: 888 [2019-09-08 04:29:28,315 INFO L226 Difference]: Without dead ends: 567 [2019-09-08 04:29:28,317 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 04:29:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-09-08 04:29:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 566. [2019-09-08 04:29:28,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-09-08 04:29:28,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 746 transitions. [2019-09-08 04:29:28,341 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 746 transitions. Word has length 233 [2019-09-08 04:29:28,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:28,342 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 746 transitions. [2019-09-08 04:29:28,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 746 transitions. [2019-09-08 04:29:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 04:29:28,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:28,351 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:28,351 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:28,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1811771772, now seen corresponding path program 1 times [2019-09-08 04:29:28,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:28,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:28,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:28,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:28,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:28,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:28,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:28,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:28,757 INFO L87 Difference]: Start difference. First operand 566 states and 746 transitions. Second operand 3 states. [2019-09-08 04:29:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:28,803 INFO L93 Difference]: Finished difference Result 1110 states and 1493 transitions. [2019-09-08 04:29:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 04:29:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:28,810 INFO L225 Difference]: With dead ends: 1110 [2019-09-08 04:29:28,810 INFO L226 Difference]: Without dead ends: 609 [2019-09-08 04:29:28,812 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 04:29:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-08 04:29:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 608. [2019-09-08 04:29:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-09-08 04:29:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 818 transitions. [2019-09-08 04:29:28,847 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 818 transitions. Word has length 245 [2019-09-08 04:29:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:28,848 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 818 transitions. [2019-09-08 04:29:28,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 818 transitions. [2019-09-08 04:29:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 04:29:28,853 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:28,853 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:28,854 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:28,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 2089199776, now seen corresponding path program 1 times [2019-09-08 04:29:28,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:28,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:28,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:29,132 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:29:29,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:29:29,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:29:29,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:29:29,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:29:29,136 INFO L87 Difference]: Start difference. First operand 608 states and 818 transitions. Second operand 3 states. [2019-09-08 04:29:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:29,194 INFO L93 Difference]: Finished difference Result 1233 states and 1704 transitions. [2019-09-08 04:29:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:29:29,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 04:29:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:29,203 INFO L225 Difference]: With dead ends: 1233 [2019-09-08 04:29:29,203 INFO L226 Difference]: Without dead ends: 690 [2019-09-08 04:29:29,206 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 04:29:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-09-08 04:29:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 689. [2019-09-08 04:29:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-08 04:29:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 956 transitions. [2019-09-08 04:29:29,258 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 956 transitions. Word has length 246 [2019-09-08 04:29:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:29,259 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 956 transitions. [2019-09-08 04:29:29,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:29:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 956 transitions. [2019-09-08 04:29:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-08 04:29:29,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:29,269 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:29,270 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1330390200, now seen corresponding path program 1 times [2019-09-08 04:29:29,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:29,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:29,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:29,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:29,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 04:29:29,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 04:29:29,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 04:29:29,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:29:29,842 INFO L87 Difference]: Start difference. First operand 689 states and 956 transitions. Second operand 19 states. [2019-09-08 04:29:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:35,269 INFO L93 Difference]: Finished difference Result 2335 states and 3224 transitions. [2019-09-08 04:29:35,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 04:29:35,270 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 249 [2019-09-08 04:29:35,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:35,289 INFO L225 Difference]: With dead ends: 2335 [2019-09-08 04:29:35,290 INFO L226 Difference]: Without dead ends: 2027 [2019-09-08 04:29:35,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 04:29:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2019-09-08 04:29:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1990. [2019-09-08 04:29:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2019-09-08 04:29:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2766 transitions. [2019-09-08 04:29:35,458 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2766 transitions. Word has length 249 [2019-09-08 04:29:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:35,460 INFO L475 AbstractCegarLoop]: Abstraction has 1990 states and 2766 transitions. [2019-09-08 04:29:35,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 04:29:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2766 transitions. [2019-09-08 04:29:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:29:35,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:35,471 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:35,472 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1816922894, now seen corresponding path program 1 times [2019-09-08 04:29:35,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:35,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:29:35,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:35,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:29:35,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:29:35,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:29:35,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:29:35,750 INFO L87 Difference]: Start difference. First operand 1990 states and 2766 transitions. Second operand 11 states. [2019-09-08 04:29:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:36,211 INFO L93 Difference]: Finished difference Result 3347 states and 4565 transitions. [2019-09-08 04:29:36,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:29:36,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 250 [2019-09-08 04:29:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:36,225 INFO L225 Difference]: With dead ends: 3347 [2019-09-08 04:29:36,225 INFO L226 Difference]: Without dead ends: 2048 [2019-09-08 04:29:36,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:29:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2019-09-08 04:29:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2019-09-08 04:29:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2048 states. [2019-09-08 04:29:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2859 transitions. [2019-09-08 04:29:36,340 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2859 transitions. Word has length 250 [2019-09-08 04:29:36,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:36,341 INFO L475 AbstractCegarLoop]: Abstraction has 2048 states and 2859 transitions. [2019-09-08 04:29:36,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:29:36,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2859 transitions. [2019-09-08 04:29:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:29:36,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:36,351 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:36,351 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:36,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:36,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1990629027, now seen corresponding path program 1 times [2019-09-08 04:29:36,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:36,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:36,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:36,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:36,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:36,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:36,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 04:29:36,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:29:36,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:29:36,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:29:36,693 INFO L87 Difference]: Start difference. First operand 2048 states and 2859 transitions. Second operand 16 states. [2019-09-08 04:29:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:37,107 INFO L93 Difference]: Finished difference Result 3423 states and 4679 transitions. [2019-09-08 04:29:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:29:37,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 250 [2019-09-08 04:29:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:37,122 INFO L225 Difference]: With dead ends: 3423 [2019-09-08 04:29:37,123 INFO L226 Difference]: Without dead ends: 2080 [2019-09-08 04:29:37,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 04:29:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2019-09-08 04:29:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2080. [2019-09-08 04:29:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2080 states. [2019-09-08 04:29:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2892 transitions. [2019-09-08 04:29:37,251 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2892 transitions. Word has length 250 [2019-09-08 04:29:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:37,252 INFO L475 AbstractCegarLoop]: Abstraction has 2080 states and 2892 transitions. [2019-09-08 04:29:37,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 04:29:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2892 transitions. [2019-09-08 04:29:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:29:37,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:37,260 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:37,261 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:37,261 INFO L82 PathProgramCache]: Analyzing trace with hash 254235924, now seen corresponding path program 1 times [2019-09-08 04:29:37,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:37,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:37,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:37,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:37,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 04:29:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 04:29:37,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 04:29:37,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 04:29:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:29:37,686 INFO L87 Difference]: Start difference. First operand 2080 states and 2892 transitions. Second operand 15 states. [2019-09-08 04:29:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:41,947 INFO L93 Difference]: Finished difference Result 3463 states and 4723 transitions. [2019-09-08 04:29:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 04:29:41,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 250 [2019-09-08 04:29:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:41,964 INFO L225 Difference]: With dead ends: 3463 [2019-09-08 04:29:41,964 INFO L226 Difference]: Without dead ends: 2164 [2019-09-08 04:29:41,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 04:29:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2019-09-08 04:29:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 2109. [2019-09-08 04:29:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2109 states. [2019-09-08 04:29:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2109 states to 2109 states and 2939 transitions. [2019-09-08 04:29:42,100 INFO L78 Accepts]: Start accepts. Automaton has 2109 states and 2939 transitions. Word has length 250 [2019-09-08 04:29:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:42,101 INFO L475 AbstractCegarLoop]: Abstraction has 2109 states and 2939 transitions. [2019-09-08 04:29:42,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 04:29:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2109 states and 2939 transitions. [2019-09-08 04:29:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:29:42,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:42,114 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:42,114 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 281898935, now seen corresponding path program 1 times [2019-09-08 04:29:42,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:42,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:42,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 04:29:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:29:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:29:42,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:29:42,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:29:42,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:29:42,439 INFO L87 Difference]: Start difference. First operand 2109 states and 2939 transitions. Second operand 5 states. [2019-09-08 04:29:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:43,690 INFO L93 Difference]: Finished difference Result 5198 states and 7180 transitions. [2019-09-08 04:29:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:29:43,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 250 [2019-09-08 04:29:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:43,722 INFO L225 Difference]: With dead ends: 5198 [2019-09-08 04:29:43,723 INFO L226 Difference]: Without dead ends: 4515 [2019-09-08 04:29:43,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:29:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2019-09-08 04:29:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4484. [2019-09-08 04:29:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-09-08 04:29:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6217 transitions. [2019-09-08 04:29:44,098 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6217 transitions. Word has length 250 [2019-09-08 04:29:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:44,099 INFO L475 AbstractCegarLoop]: Abstraction has 4484 states and 6217 transitions. [2019-09-08 04:29:44,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:29:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6217 transitions. [2019-09-08 04:29:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 04:29:44,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:44,115 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:44,115 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:44,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:44,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2117741782, now seen corresponding path program 1 times [2019-09-08 04:29:44,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:44,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:44,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:44,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:44,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-08 04:29:44,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:44,365 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 04:29:44,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:44,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:29:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 04:29:45,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:45,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 04:29:45,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 04:29:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 04:29:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:29:45,175 INFO L87 Difference]: Start difference. First operand 4484 states and 6217 transitions. Second operand 14 states. [2019-09-08 04:29:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:52,329 INFO L93 Difference]: Finished difference Result 15772 states and 22495 transitions. [2019-09-08 04:29:52,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 04:29:52,329 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 250 [2019-09-08 04:29:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:52,411 INFO L225 Difference]: With dead ends: 15772 [2019-09-08 04:29:52,411 INFO L226 Difference]: Without dead ends: 11324 [2019-09-08 04:29:52,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-09-08 04:29:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11324 states. [2019-09-08 04:29:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11324 to 11290. [2019-09-08 04:29:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11290 states. [2019-09-08 04:29:53,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11290 states to 11290 states and 15745 transitions. [2019-09-08 04:29:53,197 INFO L78 Accepts]: Start accepts. Automaton has 11290 states and 15745 transitions. Word has length 250 [2019-09-08 04:29:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:53,199 INFO L475 AbstractCegarLoop]: Abstraction has 11290 states and 15745 transitions. [2019-09-08 04:29:53,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 04:29:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11290 states and 15745 transitions. [2019-09-08 04:29:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 04:29:53,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:53,225 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:53,225 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1647862982, now seen corresponding path program 1 times [2019-09-08 04:29:53,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:53,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:53,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:53,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:53,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:29:53,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:29:53,824 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 04:29:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:29:55,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:29:55,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:29:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 04:29:55,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:29:55,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [24] total 29 [2019-09-08 04:29:55,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 04:29:55,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 04:29:55,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2019-09-08 04:29:55,269 INFO L87 Difference]: Start difference. First operand 11290 states and 15745 transitions. Second operand 29 states. [2019-09-08 04:29:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:29:59,040 INFO L93 Difference]: Finished difference Result 22786 states and 32569 transitions. [2019-09-08 04:29:59,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 04:29:59,041 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 253 [2019-09-08 04:29:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:29:59,096 INFO L225 Difference]: With dead ends: 22786 [2019-09-08 04:29:59,096 INFO L226 Difference]: Without dead ends: 10877 [2019-09-08 04:29:59,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=2579, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 04:29:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10877 states. [2019-09-08 04:29:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10877 to 10679. [2019-09-08 04:29:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10679 states. [2019-09-08 04:29:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10679 states to 10679 states and 14883 transitions. [2019-09-08 04:29:59,771 INFO L78 Accepts]: Start accepts. Automaton has 10679 states and 14883 transitions. Word has length 253 [2019-09-08 04:29:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:29:59,772 INFO L475 AbstractCegarLoop]: Abstraction has 10679 states and 14883 transitions. [2019-09-08 04:29:59,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-08 04:29:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10679 states and 14883 transitions. [2019-09-08 04:29:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 04:29:59,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:29:59,796 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:29:59,796 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:29:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:29:59,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1315243780, now seen corresponding path program 1 times [2019-09-08 04:29:59,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:29:59,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:29:59,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:59,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:29:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:29:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:00,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:30:00,154 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 04:30:00,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:00,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 3084 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:30:00,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:30:00,859 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 36 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 04:30:00,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:30:00,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-08 04:30:00,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 04:30:00,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 04:30:00,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:30:00,872 INFO L87 Difference]: Start difference. First operand 10679 states and 14883 transitions. Second operand 17 states. [2019-09-08 04:30:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:02,796 INFO L93 Difference]: Finished difference Result 21907 states and 30919 transitions. [2019-09-08 04:30:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 04:30:02,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 258 [2019-09-08 04:30:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:02,850 INFO L225 Difference]: With dead ends: 21907 [2019-09-08 04:30:02,850 INFO L226 Difference]: Without dead ends: 11289 [2019-09-08 04:30:02,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:30:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11289 states. [2019-09-08 04:30:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11289 to 10809. [2019-09-08 04:30:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10809 states. [2019-09-08 04:30:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10809 states to 10809 states and 15054 transitions. [2019-09-08 04:30:03,472 INFO L78 Accepts]: Start accepts. Automaton has 10809 states and 15054 transitions. Word has length 258 [2019-09-08 04:30:03,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:03,472 INFO L475 AbstractCegarLoop]: Abstraction has 10809 states and 15054 transitions. [2019-09-08 04:30:03,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 04:30:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 10809 states and 15054 transitions. [2019-09-08 04:30:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-08 04:30:03,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:03,501 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:03,501 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1366951173, now seen corresponding path program 1 times [2019-09-08 04:30:03,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:03,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:03,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:03,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:03,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:03,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:03,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:30:03,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:30:03,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:30:03,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:30:03,930 INFO L87 Difference]: Start difference. First operand 10809 states and 15054 transitions. Second operand 13 states. [2019-09-08 04:30:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:07,342 INFO L93 Difference]: Finished difference Result 31092 states and 43487 transitions. [2019-09-08 04:30:07,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:30:07,344 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 266 [2019-09-08 04:30:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:07,468 INFO L225 Difference]: With dead ends: 31092 [2019-09-08 04:30:07,468 INFO L226 Difference]: Without dead ends: 21925 [2019-09-08 04:30:07,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-09-08 04:30:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21925 states. [2019-09-08 04:30:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21925 to 21800. [2019-09-08 04:30:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21800 states. [2019-09-08 04:30:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21800 states to 21800 states and 30283 transitions. [2019-09-08 04:30:08,913 INFO L78 Accepts]: Start accepts. Automaton has 21800 states and 30283 transitions. Word has length 266 [2019-09-08 04:30:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:08,914 INFO L475 AbstractCegarLoop]: Abstraction has 21800 states and 30283 transitions. [2019-09-08 04:30:08,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:30:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 21800 states and 30283 transitions. [2019-09-08 04:30:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-08 04:30:08,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:08,972 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:08,972 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:08,973 INFO L82 PathProgramCache]: Analyzing trace with hash -146657505, now seen corresponding path program 1 times [2019-09-08 04:30:08,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:08,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:08,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:30:09,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:09,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:30:09,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:30:09,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:30:09,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:30:09,226 INFO L87 Difference]: Start difference. First operand 21800 states and 30283 transitions. Second operand 3 states. [2019-09-08 04:30:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:10,035 INFO L93 Difference]: Finished difference Result 44453 states and 62191 transitions. [2019-09-08 04:30:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:30:10,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 264 [2019-09-08 04:30:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:10,129 INFO L225 Difference]: With dead ends: 44453 [2019-09-08 04:30:10,129 INFO L226 Difference]: Without dead ends: 22742 [2019-09-08 04:30:10,177 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 04:30:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22742 states. [2019-09-08 04:30:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22742 to 22736. [2019-09-08 04:30:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22736 states. [2019-09-08 04:30:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22736 states to 22736 states and 31981 transitions. [2019-09-08 04:30:11,311 INFO L78 Accepts]: Start accepts. Automaton has 22736 states and 31981 transitions. Word has length 264 [2019-09-08 04:30:11,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:11,312 INFO L475 AbstractCegarLoop]: Abstraction has 22736 states and 31981 transitions. [2019-09-08 04:30:11,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:30:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 22736 states and 31981 transitions. [2019-09-08 04:30:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 04:30:11,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:11,355 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:11,355 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:11,356 INFO L82 PathProgramCache]: Analyzing trace with hash 67210205, now seen corresponding path program 1 times [2019-09-08 04:30:11,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:11,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:11,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:11,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:30:11,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:11,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:30:11,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:30:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:30:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:30:11,553 INFO L87 Difference]: Start difference. First operand 22736 states and 31981 transitions. Second operand 6 states. [2019-09-08 04:30:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:13,584 INFO L93 Difference]: Finished difference Result 64502 states and 89735 transitions. [2019-09-08 04:30:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:30:13,584 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 267 [2019-09-08 04:30:13,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:13,816 INFO L225 Difference]: With dead ends: 64502 [2019-09-08 04:30:13,816 INFO L226 Difference]: Without dead ends: 45823 [2019-09-08 04:30:13,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:30:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45823 states. [2019-09-08 04:30:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45823 to 45538. [2019-09-08 04:30:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45538 states. [2019-09-08 04:30:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45538 states to 45538 states and 64029 transitions. [2019-09-08 04:30:15,912 INFO L78 Accepts]: Start accepts. Automaton has 45538 states and 64029 transitions. Word has length 267 [2019-09-08 04:30:15,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:15,913 INFO L475 AbstractCegarLoop]: Abstraction has 45538 states and 64029 transitions. [2019-09-08 04:30:15,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:30:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 45538 states and 64029 transitions. [2019-09-08 04:30:16,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 04:30:16,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:16,046 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:16,047 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:16,047 INFO L82 PathProgramCache]: Analyzing trace with hash 880258997, now seen corresponding path program 1 times [2019-09-08 04:30:16,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:16,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:16,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:16,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:16,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:16,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:30:16,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:30:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:30:16,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:30:16,302 INFO L87 Difference]: Start difference. First operand 45538 states and 64029 transitions. Second operand 11 states. [2019-09-08 04:30:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:17,842 INFO L93 Difference]: Finished difference Result 79755 states and 111049 transitions. [2019-09-08 04:30:17,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:30:17,842 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 268 [2019-09-08 04:30:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:18,075 INFO L225 Difference]: With dead ends: 79755 [2019-09-08 04:30:18,075 INFO L226 Difference]: Without dead ends: 48198 [2019-09-08 04:30:18,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:30:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48198 states. [2019-09-08 04:30:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48198 to 47850. [2019-09-08 04:30:21,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47850 states. [2019-09-08 04:30:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47850 states to 47850 states and 67856 transitions. [2019-09-08 04:30:21,687 INFO L78 Accepts]: Start accepts. Automaton has 47850 states and 67856 transitions. Word has length 268 [2019-09-08 04:30:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:21,688 INFO L475 AbstractCegarLoop]: Abstraction has 47850 states and 67856 transitions. [2019-09-08 04:30:21,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:30:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 47850 states and 67856 transitions. [2019-09-08 04:30:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 04:30:21,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:21,743 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:21,743 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:21,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1318265467, now seen corresponding path program 1 times [2019-09-08 04:30:21,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:21,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:21,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:21,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:22,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:22,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:30:22,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:30:22,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:30:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:30:22,048 INFO L87 Difference]: Start difference. First operand 47850 states and 67856 transitions. Second operand 13 states. [2019-09-08 04:30:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:23,697 INFO L93 Difference]: Finished difference Result 87115 states and 121582 transitions. [2019-09-08 04:30:23,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:30:23,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 269 [2019-09-08 04:30:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:23,868 INFO L225 Difference]: With dead ends: 87115 [2019-09-08 04:30:23,868 INFO L226 Difference]: Without dead ends: 48050 [2019-09-08 04:30:23,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:30:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48050 states. [2019-09-08 04:30:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48050 to 47890. [2019-09-08 04:30:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47890 states. [2019-09-08 04:30:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47890 states to 47890 states and 67926 transitions. [2019-09-08 04:30:27,482 INFO L78 Accepts]: Start accepts. Automaton has 47890 states and 67926 transitions. Word has length 269 [2019-09-08 04:30:27,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:27,483 INFO L475 AbstractCegarLoop]: Abstraction has 47890 states and 67926 transitions. [2019-09-08 04:30:27,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:30:27,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47890 states and 67926 transitions. [2019-09-08 04:30:27,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 04:30:27,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:27,523 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:27,523 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:27,523 INFO L82 PathProgramCache]: Analyzing trace with hash 955727390, now seen corresponding path program 1 times [2019-09-08 04:30:27,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:27,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:27,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:27,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:30:27,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:27,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:30:27,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:30:27,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:30:27,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:30:27,736 INFO L87 Difference]: Start difference. First operand 47890 states and 67926 transitions. Second operand 6 states. [2019-09-08 04:30:30,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:30,411 INFO L93 Difference]: Finished difference Result 135776 states and 190256 transitions. [2019-09-08 04:30:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:30:30,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2019-09-08 04:30:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:30,793 INFO L225 Difference]: With dead ends: 135776 [2019-09-08 04:30:30,793 INFO L226 Difference]: Without dead ends: 96771 [2019-09-08 04:30:30,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:30:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96771 states. [2019-09-08 04:30:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96771 to 95846. [2019-09-08 04:30:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95846 states. [2019-09-08 04:30:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95846 states to 95846 states and 135953 transitions. [2019-09-08 04:30:36,815 INFO L78 Accepts]: Start accepts. Automaton has 95846 states and 135953 transitions. Word has length 269 [2019-09-08 04:30:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:36,816 INFO L475 AbstractCegarLoop]: Abstraction has 95846 states and 135953 transitions. [2019-09-08 04:30:36,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:30:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 95846 states and 135953 transitions. [2019-09-08 04:30:36,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-09-08 04:30:36,888 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:36,888 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:36,889 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:36,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:36,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1595214832, now seen corresponding path program 1 times [2019-09-08 04:30:36,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:36,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:36,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:36,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:36,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:37,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:37,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:30:37,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:30:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:30:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:30:37,110 INFO L87 Difference]: Start difference. First operand 95846 states and 135953 transitions. Second operand 11 states. [2019-09-08 04:30:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:42,492 INFO L93 Difference]: Finished difference Result 166983 states and 234407 transitions. [2019-09-08 04:30:42,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:30:42,493 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 270 [2019-09-08 04:30:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:42,900 INFO L225 Difference]: With dead ends: 166983 [2019-09-08 04:30:42,900 INFO L226 Difference]: Without dead ends: 101166 [2019-09-08 04:30:43,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 04:30:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101166 states. [2019-09-08 04:30:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101166 to 100374. [2019-09-08 04:30:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100374 states. [2019-09-08 04:30:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100374 states to 100374 states and 143557 transitions. [2019-09-08 04:30:46,665 INFO L78 Accepts]: Start accepts. Automaton has 100374 states and 143557 transitions. Word has length 270 [2019-09-08 04:30:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:46,666 INFO L475 AbstractCegarLoop]: Abstraction has 100374 states and 143557 transitions. [2019-09-08 04:30:46,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:30:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 100374 states and 143557 transitions. [2019-09-08 04:30:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 04:30:46,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:46,775 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:46,775 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:46,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1133173622, now seen corresponding path program 1 times [2019-09-08 04:30:46,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:46,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:30:47,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:47,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 04:30:47,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 04:30:47,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 04:30:47,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:30:47,023 INFO L87 Difference]: Start difference. First operand 100374 states and 143557 transitions. Second operand 13 states. [2019-09-08 04:30:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:30:50,177 INFO L93 Difference]: Finished difference Result 183587 states and 258571 transitions. [2019-09-08 04:30:50,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 04:30:50,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 271 [2019-09-08 04:30:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:30:50,583 INFO L225 Difference]: With dead ends: 183587 [2019-09-08 04:30:50,583 INFO L226 Difference]: Without dead ends: 101994 [2019-09-08 04:30:50,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:30:50,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101994 states. [2019-09-08 04:30:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101994 to 101554. [2019-09-08 04:30:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101554 states. [2019-09-08 04:30:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101554 states to 101554 states and 145097 transitions. [2019-09-08 04:30:58,324 INFO L78 Accepts]: Start accepts. Automaton has 101554 states and 145097 transitions. Word has length 271 [2019-09-08 04:30:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:58,325 INFO L475 AbstractCegarLoop]: Abstraction has 101554 states and 145097 transitions. [2019-09-08 04:30:58,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 04:30:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 101554 states and 145097 transitions. [2019-09-08 04:30:58,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 04:30:58,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:58,410 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:30:58,410 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:58,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:58,411 INFO L82 PathProgramCache]: Analyzing trace with hash 613911967, now seen corresponding path program 1 times [2019-09-08 04:30:58,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:58,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:58,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:58,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:58,600 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:30:58,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:58,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:30:58,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:30:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:30:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:30:58,601 INFO L87 Difference]: Start difference. First operand 101554 states and 145097 transitions. Second operand 6 states. [2019-09-08 04:31:08,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:08,036 INFO L93 Difference]: Finished difference Result 284132 states and 401183 transitions. [2019-09-08 04:31:08,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:31:08,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 272 [2019-09-08 04:31:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:08,752 INFO L225 Difference]: With dead ends: 284132 [2019-09-08 04:31:08,753 INFO L226 Difference]: Without dead ends: 183443 [2019-09-08 04:31:08,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:31:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183443 states. [2019-09-08 04:31:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183443 to 181836. [2019-09-08 04:31:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181836 states. [2019-09-08 04:31:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181836 states to 181836 states and 261265 transitions. [2019-09-08 04:31:16,614 INFO L78 Accepts]: Start accepts. Automaton has 181836 states and 261265 transitions. Word has length 272 [2019-09-08 04:31:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:16,615 INFO L475 AbstractCegarLoop]: Abstraction has 181836 states and 261265 transitions. [2019-09-08 04:31:16,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:31:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 181836 states and 261265 transitions. [2019-09-08 04:31:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 04:31:16,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:16,742 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:16,742 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash 189029200, now seen corresponding path program 1 times [2019-09-08 04:31:16,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:16,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:16,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:16,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:31:16,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:16,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:16,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:16,877 INFO L87 Difference]: Start difference. First operand 181836 states and 261265 transitions. Second operand 3 states. [2019-09-08 04:31:27,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:27,775 INFO L93 Difference]: Finished difference Result 378027 states and 548919 transitions. [2019-09-08 04:31:27,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:27,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-09-08 04:31:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:28,921 INFO L225 Difference]: With dead ends: 378027 [2019-09-08 04:31:28,921 INFO L226 Difference]: Without dead ends: 196278 [2019-09-08 04:31:29,231 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 04:31:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196278 states. [2019-09-08 04:31:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196278 to 196236. [2019-09-08 04:31:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196236 states. [2019-09-08 04:31:42,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196236 states to 196236 states and 287329 transitions. [2019-09-08 04:31:42,080 INFO L78 Accepts]: Start accepts. Automaton has 196236 states and 287329 transitions. Word has length 272 [2019-09-08 04:31:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:31:42,080 INFO L475 AbstractCegarLoop]: Abstraction has 196236 states and 287329 transitions. [2019-09-08 04:31:42,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:31:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 196236 states and 287329 transitions. [2019-09-08 04:31:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-08 04:31:42,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:31:42,259 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:31:42,260 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:31:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:31:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash 580855026, now seen corresponding path program 1 times [2019-09-08 04:31:42,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:31:42,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:31:42,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:42,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:31:42,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:31:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:31:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 04:31:42,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:31:42,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:31:42,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:31:42,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:31:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:31:42,412 INFO L87 Difference]: Start difference. First operand 196236 states and 287329 transitions. Second operand 3 states. [2019-09-08 04:31:57,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:31:57,264 INFO L93 Difference]: Finished difference Result 420075 states and 624807 transitions. [2019-09-08 04:31:57,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:31:57,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-09-08 04:31:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:31:58,157 INFO L225 Difference]: With dead ends: 420075 [2019-09-08 04:31:58,157 INFO L226 Difference]: Without dead ends: 223926 [2019-09-08 04:31:58,554 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 04:31:58,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223926 states. [2019-09-08 04:32:07,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223926 to 223884. [2019-09-08 04:32:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223884 states. [2019-09-08 04:32:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223884 states to 223884 states and 336769 transitions. [2019-09-08 04:32:08,616 INFO L78 Accepts]: Start accepts. Automaton has 223884 states and 336769 transitions. Word has length 273 [2019-09-08 04:32:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:08,616 INFO L475 AbstractCegarLoop]: Abstraction has 223884 states and 336769 transitions. [2019-09-08 04:32:08,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:32:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 223884 states and 336769 transitions. [2019-09-08 04:32:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-09-08 04:32:08,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:08,917 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:32:08,918 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:08,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:08,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1997900496, now seen corresponding path program 1 times [2019-09-08 04:32:08,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:08,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:08,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:08,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:08,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:09,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 04:32:10,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:10,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-09-08 04:32:10,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-08 04:32:10,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-08 04:32:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-09-08 04:32:10,341 INFO L87 Difference]: Start difference. First operand 223884 states and 336769 transitions. Second operand 28 states. [2019-09-08 04:32:23,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:23,048 INFO L93 Difference]: Finished difference Result 377046 states and 549912 transitions. [2019-09-08 04:32:23,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 04:32:23,048 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 274 [2019-09-08 04:32:23,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:23,928 INFO L225 Difference]: With dead ends: 377046 [2019-09-08 04:32:23,928 INFO L226 Difference]: Without dead ends: 228645 [2019-09-08 04:32:24,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=1459, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 04:32:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228645 states. [2019-09-08 04:32:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228645 to 226764. [2019-09-08 04:32:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226764 states. [2019-09-08 04:32:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226764 states to 226764 states and 341519 transitions. [2019-09-08 04:32:39,971 INFO L78 Accepts]: Start accepts. Automaton has 226764 states and 341519 transitions. Word has length 274 [2019-09-08 04:32:39,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:32:39,971 INFO L475 AbstractCegarLoop]: Abstraction has 226764 states and 341519 transitions. [2019-09-08 04:32:39,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-08 04:32:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 226764 states and 341519 transitions. [2019-09-08 04:32:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 04:32:40,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:32:40,302 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:32:40,302 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:32:40,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:32:40,302 INFO L82 PathProgramCache]: Analyzing trace with hash 33562145, now seen corresponding path program 1 times [2019-09-08 04:32:40,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:32:40,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:32:40,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:40,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:32:40,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:32:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:32:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:32:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:32:40,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:32:40,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:32:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:32:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:40,457 INFO L87 Difference]: Start difference. First operand 226764 states and 341519 transitions. Second operand 5 states. [2019-09-08 04:32:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:32:55,694 INFO L93 Difference]: Finished difference Result 371839 states and 542455 transitions. [2019-09-08 04:32:55,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:32:55,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 271 [2019-09-08 04:32:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:32:56,950 INFO L225 Difference]: With dead ends: 371839 [2019-09-08 04:32:56,951 INFO L226 Difference]: Without dead ends: 228354 [2019-09-08 04:32:57,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:32:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228354 states. [2019-09-08 04:33:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228354 to 226744. [2019-09-08 04:33:06,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226744 states. [2019-09-08 04:33:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226744 states to 226744 states and 341107 transitions. [2019-09-08 04:33:08,346 INFO L78 Accepts]: Start accepts. Automaton has 226744 states and 341107 transitions. Word has length 271 [2019-09-08 04:33:08,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:08,347 INFO L475 AbstractCegarLoop]: Abstraction has 226744 states and 341107 transitions. [2019-09-08 04:33:08,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:33:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 226744 states and 341107 transitions. [2019-09-08 04:33:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 04:33:08,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:08,637 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:08,637 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:08,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:08,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1368027839, now seen corresponding path program 1 times [2019-09-08 04:33:08,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:08,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:08,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:08,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:33:08,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:08,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:33:08,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:33:08,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:33:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:33:08,830 INFO L87 Difference]: Start difference. First operand 226744 states and 341107 transitions. Second operand 10 states. [2019-09-08 04:33:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:20,618 INFO L93 Difference]: Finished difference Result 226749 states and 341111 transitions. [2019-09-08 04:33:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:33:20,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 278 [2019-09-08 04:33:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:21,458 INFO L225 Difference]: With dead ends: 226749 [2019-09-08 04:33:21,458 INFO L226 Difference]: Without dead ends: 226744 [2019-09-08 04:33:21,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:33:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226744 states. [2019-09-08 04:33:30,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226744 to 226744. [2019-09-08 04:33:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226744 states. [2019-09-08 04:33:32,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226744 states to 226744 states and 340267 transitions. [2019-09-08 04:33:32,268 INFO L78 Accepts]: Start accepts. Automaton has 226744 states and 340267 transitions. Word has length 278 [2019-09-08 04:33:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:32,268 INFO L475 AbstractCegarLoop]: Abstraction has 226744 states and 340267 transitions. [2019-09-08 04:33:32,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:33:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 226744 states and 340267 transitions. [2019-09-08 04:33:32,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-08 04:33:32,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:32,579 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:32,580 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:32,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1393012953, now seen corresponding path program 1 times [2019-09-08 04:33:32,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:32,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:32,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:32,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:32,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 04:33:32,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:33:32,710 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 04:33:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:33,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 3148 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 04:33:33,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:33:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 04:33:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:33:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2019-09-08 04:33:33,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:33:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:33:33,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:33:33,333 INFO L87 Difference]: Start difference. First operand 226744 states and 340267 transitions. Second operand 12 states. [2019-09-08 04:33:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:33:48,466 INFO L93 Difference]: Finished difference Result 422529 states and 637263 transitions. [2019-09-08 04:33:48,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:33:48,467 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 275 [2019-09-08 04:33:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:33:49,186 INFO L225 Difference]: With dead ends: 422529 [2019-09-08 04:33:49,186 INFO L226 Difference]: Without dead ends: 195818 [2019-09-08 04:33:49,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-09-08 04:33:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195818 states. [2019-09-08 04:33:57,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195818 to 195546. [2019-09-08 04:33:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195546 states. [2019-09-08 04:33:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195546 states to 195546 states and 296082 transitions. [2019-09-08 04:33:58,137 INFO L78 Accepts]: Start accepts. Automaton has 195546 states and 296082 transitions. Word has length 275 [2019-09-08 04:33:58,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:33:58,137 INFO L475 AbstractCegarLoop]: Abstraction has 195546 states and 296082 transitions. [2019-09-08 04:33:58,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:33:58,137 INFO L276 IsEmpty]: Start isEmpty. Operand 195546 states and 296082 transitions. [2019-09-08 04:33:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-08 04:33:58,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:33:58,510 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:58,511 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:33:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:33:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash -947619720, now seen corresponding path program 1 times [2019-09-08 04:33:58,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:33:58,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:33:58,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:58,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:33:58,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:33:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:33:59,590 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-08 04:33:59,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:33:59,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:33:59,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:33:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:33:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:33:59,591 INFO L87 Difference]: Start difference. First operand 195546 states and 296082 transitions. Second operand 6 states. [2019-09-08 04:34:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:34:15,891 INFO L93 Difference]: Finished difference Result 514250 states and 770570 transitions. [2019-09-08 04:34:15,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:34:15,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 275 [2019-09-08 04:34:15,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:34:17,613 INFO L225 Difference]: With dead ends: 514250 [2019-09-08 04:34:17,613 INFO L226 Difference]: Without dead ends: 391793 [2019-09-08 04:34:18,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:34:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391793 states. [2019-09-08 04:34:41,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391793 to 389510. [2019-09-08 04:34:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389510 states. [2019-09-08 04:34:44,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389510 states to 389510 states and 599946 transitions. [2019-09-08 04:34:44,276 INFO L78 Accepts]: Start accepts. Automaton has 389510 states and 599946 transitions. Word has length 275 [2019-09-08 04:34:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:34:44,277 INFO L475 AbstractCegarLoop]: Abstraction has 389510 states and 599946 transitions. [2019-09-08 04:34:44,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:34:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 389510 states and 599946 transitions. [2019-09-08 04:34:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-09-08 04:34:44,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:34:44,912 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:44,912 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:34:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:34:44,913 INFO L82 PathProgramCache]: Analyzing trace with hash -437591323, now seen corresponding path program 1 times [2019-09-08 04:34:44,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:34:44,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:34:44,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:44,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:34:44,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:34:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:34:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 04:34:45,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:34:45,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:34:45,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:34:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:34:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:34:45,086 INFO L87 Difference]: Start difference. First operand 389510 states and 599946 transitions. Second operand 8 states. [2019-09-08 04:35:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:35:27,193 INFO L93 Difference]: Finished difference Result 1044803 states and 1579793 transitions. [2019-09-08 04:35:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:35:27,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 292 [2019-09-08 04:35:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:35:30,424 INFO L225 Difference]: With dead ends: 1044803 [2019-09-08 04:35:30,424 INFO L226 Difference]: Without dead ends: 785089 [2019-09-08 04:35:31,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:35:32,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785089 states. [2019-09-08 04:36:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785089 to 778692. [2019-09-08 04:36:42,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778692 states. [2019-09-08 04:36:46,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778692 states to 778692 states and 1203673 transitions. [2019-09-08 04:36:46,370 INFO L78 Accepts]: Start accepts. Automaton has 778692 states and 1203673 transitions. Word has length 292 [2019-09-08 04:36:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:36:46,370 INFO L475 AbstractCegarLoop]: Abstraction has 778692 states and 1203673 transitions. [2019-09-08 04:36:46,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:36:46,371 INFO L276 IsEmpty]: Start isEmpty. Operand 778692 states and 1203673 transitions. [2019-09-08 04:37:05,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-09-08 04:37:05,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:37:05,489 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:37:05,489 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:37:05,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:37:05,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1773667961, now seen corresponding path program 1 times [2019-09-08 04:37:05,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:37:05,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:37:05,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:05,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:37:05,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:37:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 04:37:05,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 04:37:05,697 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 04:37:05,711 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 04:37:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:37:06,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 04:37:06,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 04:37:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 04:37:06,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 04:37:06,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 04:37:06,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 04:37:06,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 04:37:06,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:37:06,355 INFO L87 Difference]: Start difference. First operand 778692 states and 1203673 transitions. Second operand 16 states. [2019-09-08 04:37:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:37:51,870 INFO L93 Difference]: Finished difference Result 1431127 states and 2166264 transitions. [2019-09-08 04:37:51,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 04:37:51,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 293 [2019-09-08 04:37:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:37:55,485 INFO L225 Difference]: With dead ends: 1431127 [2019-09-08 04:37:55,485 INFO L226 Difference]: Without dead ends: 782276 [2019-09-08 04:37:58,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2019-09-08 04:37:58,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782276 states.