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_spec7_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 13:51:01,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 13:51:01,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 13:51:01,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 13:51:01,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 13:51:01,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 13:51:01,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 13:51:01,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 13:51:01,117 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 13:51:01,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 13:51:01,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 13:51:01,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 13:51:01,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 13:51:01,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 13:51:01,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 13:51:01,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 13:51:01,125 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 13:51:01,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 13:51:01,128 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 13:51:01,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 13:51:01,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 13:51:01,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 13:51:01,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 13:51:01,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 13:51:01,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 13:51:01,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 13:51:01,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 13:51:01,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 13:51:01,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 13:51:01,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 13:51:01,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 13:51:01,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 13:51:01,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 13:51:01,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 13:51:01,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 13:51:01,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 13:51:01,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 13:51:01,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 13:51:01,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 13:51:01,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 13:51:01,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 13:51:01,152 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 13:51:01,167 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 13:51:01,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 13:51:01,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 13:51:01,169 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 13:51:01,169 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 13:51:01,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 13:51:01,170 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 13:51:01,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 13:51:01,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 13:51:01,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 13:51:01,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 13:51:01,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 13:51:01,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 13:51:01,171 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 13:51:01,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 13:51:01,171 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 13:51:01,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 13:51:01,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 13:51:01,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 13:51:01,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 13:51:01,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 13:51:01,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:51:01,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 13:51:01,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 13:51:01,173 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 13:51:01,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 13:51:01,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 13:51:01,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 13:51:01,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 13:51:01,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 13:51:01,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 13:51:01,227 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 13:51:01,229 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 13:51:01,229 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 13:51:01,230 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c [2019-10-02 13:51:01,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c777b2aa/730d5af57d184dad85c8d39eb68ee699/FLAG8fac56cbe [2019-10-02 13:51:01,958 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 13:51:01,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c [2019-10-02 13:51:01,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c777b2aa/730d5af57d184dad85c8d39eb68ee699/FLAG8fac56cbe [2019-10-02 13:51:02,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c777b2aa/730d5af57d184dad85c8d39eb68ee699 [2019-10-02 13:51:02,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 13:51:02,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 13:51:02,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 13:51:02,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 13:51:02,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 13:51:02,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:51:02" (1/1) ... [2019-10-02 13:51:02,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3283d116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:02, skipping insertion in model container [2019-10-02 13:51:02,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 01:51:02" (1/1) ... [2019-10-02 13:51:02,150 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 13:51:02,230 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 13:51:03,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:51:03,056 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 13:51:03,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 13:51:03,279 INFO L192 MainTranslator]: Completed translation [2019-10-02 13:51:03,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03 WrapperNode [2019-10-02 13:51:03,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 13:51:03,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 13:51:03,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 13:51:03,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 13:51:03,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... [2019-10-02 13:51:03,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 13:51:03,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 13:51:03,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 13:51:03,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 13:51:03,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 13:51:03,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 13:51:03,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 13:51:03,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 13:51:03,574 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-10-02 13:51:03,575 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-10-02 13:51:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-10-02 13:51:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-10-02 13:51:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-10-02 13:51:03,576 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-10-02 13:51:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-10-02 13:51:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-10-02 13:51:03,577 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 13:51:03,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 13:51:03,578 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-10-02 13:51:03,579 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-10-02 13:51:03,580 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-10-02 13:51:03,582 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-10-02 13:51:03,582 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-10-02 13:51:03,583 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-10-02 13:51:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-10-02 13:51:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-10-02 13:51:03,584 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-10-02 13:51:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-10-02 13:51:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:51:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 13:51:03,585 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-10-02 13:51:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-10-02 13:51:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-10-02 13:51:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-10-02 13:51:03,586 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-10-02 13:51:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-10-02 13:51:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-10-02 13:51:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-10-02 13:51:03,587 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-10-02 13:51:03,588 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-10-02 13:51:03,588 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-10-02 13:51:03,588 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-10-02 13:51:03,588 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-10-02 13:51:03,588 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-10-02 13:51:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-10-02 13:51:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-10-02 13:51:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-10-02 13:51:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-10-02 13:51:03,589 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-10-02 13:51:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-10-02 13:51:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-10-02 13:51:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-10-02 13:51:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-10-02 13:51:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-10-02 13:51:03,590 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-10-02 13:51:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-10-02 13:51:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-10-02 13:51:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-10-02 13:51:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-10-02 13:51:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-10-02 13:51:03,591 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-10-02 13:51:03,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-10-02 13:51:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-10-02 13:51:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-10-02 13:51:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-10-02 13:51:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 13:51:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 13:51:03,593 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 13:51:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 13:51:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 13:51:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 13:51:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-10-02 13:51:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-10-02 13:51:03,594 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-10-02 13:51:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 13:51:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 13:51:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 13:51:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 13:51:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-10-02 13:51:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-10-02 13:51:03,596 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-10-02 13:51:03,597 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-10-02 13:51:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-10-02 13:51:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-10-02 13:51:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-10-02 13:51:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-10-02 13:51:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-10-02 13:51:03,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-10-02 13:51:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-10-02 13:51:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-10-02 13:51:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-10-02 13:51:03,599 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-10-02 13:51:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-10-02 13:51:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-10-02 13:51:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-10-02 13:51:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-10-02 13:51:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-10-02 13:51:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-10-02 13:51:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-10-02 13:51:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-10-02 13:51:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-10-02 13:51:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 13:51:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 13:51:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 13:51:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 13:51:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-10-02 13:51:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-10-02 13:51:03,602 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-10-02 13:51:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-10-02 13:51:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-10-02 13:51:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-10-02 13:51:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-10-02 13:51:03,603 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-10-02 13:51:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-10-02 13:51:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 13:51:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 13:51:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 13:51:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-10-02 13:51:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-10-02 13:51:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-10-02 13:51:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-10-02 13:51:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-10-02 13:51:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-10-02 13:51:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-10-02 13:51:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-10-02 13:51:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-10-02 13:51:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-10-02 13:51:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-10-02 13:51:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-10-02 13:51:03,607 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-10-02 13:51:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-10-02 13:51:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-10-02 13:51:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-10-02 13:51:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-10-02 13:51:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-10-02 13:51:03,608 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-10-02 13:51:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-10-02 13:51:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-10-02 13:51:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-10-02 13:51:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-10-02 13:51:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-10-02 13:51:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-10-02 13:51:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-10-02 13:51:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-10-02 13:51:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-10-02 13:51:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-10-02 13:51:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-10-02 13:51:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-10-02 13:51:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-10-02 13:51:03,612 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-10-02 13:51:03,613 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-10-02 13:51:03,614 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-10-02 13:51:03,615 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 13:51:03,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 13:51:03,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 13:51:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 13:51:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 13:51:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-10-02 13:51:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-10-02 13:51:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-10-02 13:51:03,618 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-10-02 13:51:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-10-02 13:51:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-10-02 13:51:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 13:51:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-10-02 13:51:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-10-02 13:51:03,619 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-10-02 13:51:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-10-02 13:51:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-10-02 13:51:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-10-02 13:51:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-10-02 13:51:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-10-02 13:51:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-10-02 13:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-10-02 13:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-10-02 13:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-10-02 13:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-10-02 13:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-10-02 13:51:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-10-02 13:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-10-02 13:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 13:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 13:51:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 13:51:05,949 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 13:51:05,949 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 13:51:05,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:51:05 BoogieIcfgContainer [2019-10-02 13:51:05,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 13:51:05,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 13:51:05,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 13:51:05,957 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 13:51:05,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 01:51:02" (1/3) ... [2019-10-02 13:51:05,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fa76a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:51:05, skipping insertion in model container [2019-10-02 13:51:05,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 01:51:03" (2/3) ... [2019-10-02 13:51:05,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fa76a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 01:51:05, skipping insertion in model container [2019-10-02 13:51:05,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 01:51:05" (3/3) ... [2019-10-02 13:51:05,962 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product31.cil.c [2019-10-02 13:51:05,973 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 13:51:05,989 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 13:51:06,007 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 13:51:06,052 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 13:51:06,053 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 13:51:06,053 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 13:51:06,053 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 13:51:06,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 13:51:06,054 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 13:51:06,054 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 13:51:06,057 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 13:51:06,058 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 13:51:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states. [2019-10-02 13:51:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 13:51:06,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:06,133 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:06,136 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1012113491, now seen corresponding path program 1 times [2019-10-02 13:51:06,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:06,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:06,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:06,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:06,876 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:51:06,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:06,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 13:51:06,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 13:51:06,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 13:51:06,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:51:06,903 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 2 states. [2019-10-02 13:51:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:06,987 INFO L93 Difference]: Finished difference Result 850 states and 1117 transitions. [2019-10-02 13:51:06,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 13:51:06,989 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2019-10-02 13:51:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:07,026 INFO L225 Difference]: With dead ends: 850 [2019-10-02 13:51:07,027 INFO L226 Difference]: Without dead ends: 531 [2019-10-02 13:51:07,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 13:51:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-10-02 13:51:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2019-10-02 13:51:07,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-02 13:51:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 701 transitions. [2019-10-02 13:51:07,202 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 701 transitions. Word has length 182 [2019-10-02 13:51:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:07,208 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 701 transitions. [2019-10-02 13:51:07,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 13:51:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 701 transitions. [2019-10-02 13:51:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 13:51:07,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:07,227 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:07,228 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:07,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1074774869, now seen corresponding path program 1 times [2019-10-02 13:51:07,229 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:07,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:07,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:07,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:07,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:51:07,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:07,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:51:07,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:51:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:51:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:51:07,559 INFO L87 Difference]: Start difference. First operand 531 states and 701 transitions. Second operand 3 states. [2019-10-02 13:51:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:07,631 INFO L93 Difference]: Finished difference Result 833 states and 1082 transitions. [2019-10-02 13:51:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:51:07,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-02 13:51:07,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:07,638 INFO L225 Difference]: With dead ends: 833 [2019-10-02 13:51:07,638 INFO L226 Difference]: Without dead ends: 534 [2019-10-02 13:51:07,640 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:51:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-02 13:51:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 533. [2019-10-02 13:51:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-02 13:51:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 703 transitions. [2019-10-02 13:51:07,683 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 703 transitions. Word has length 183 [2019-10-02 13:51:07,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:07,683 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 703 transitions. [2019-10-02 13:51:07,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:51:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 703 transitions. [2019-10-02 13:51:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 13:51:07,688 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:07,688 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:07,688 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1838955167, now seen corresponding path program 1 times [2019-10-02 13:51:07,689 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:07,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:07,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:07,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:07,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:51:07,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:07,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:51:07,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:51:07,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:51:07,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:51:07,947 INFO L87 Difference]: Start difference. First operand 533 states and 703 transitions. Second operand 3 states. [2019-10-02 13:51:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:08,001 INFO L93 Difference]: Finished difference Result 1042 states and 1404 transitions. [2019-10-02 13:51:08,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:51:08,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-02 13:51:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:08,013 INFO L225 Difference]: With dead ends: 1042 [2019-10-02 13:51:08,013 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 13:51:08,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:51:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 13:51:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 573. [2019-10-02 13:51:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-02 13:51:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 772 transitions. [2019-10-02 13:51:08,071 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 772 transitions. Word has length 189 [2019-10-02 13:51:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:08,073 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 772 transitions. [2019-10-02 13:51:08,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:51:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 772 transitions. [2019-10-02 13:51:08,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 13:51:08,085 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:08,085 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:08,086 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash -120410327, now seen corresponding path program 1 times [2019-10-02 13:51:08,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:08,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:08,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:08,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:51:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:08,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-10-02 13:51:08,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 13:51:08,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 13:51:08,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:51:08,735 INFO L87 Difference]: Start difference. First operand 573 states and 772 transitions. Second operand 19 states. [2019-10-02 13:51:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:13,777 INFO L93 Difference]: Finished difference Result 2037 states and 2754 transitions. [2019-10-02 13:51:13,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-10-02 13:51:13,783 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2019-10-02 13:51:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:13,799 INFO L225 Difference]: With dead ends: 2037 [2019-10-02 13:51:13,800 INFO L226 Difference]: Without dead ends: 1751 [2019-10-02 13:51:13,806 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=2683, Unknown=0, NotChecked=0, Total=2970 [2019-10-02 13:51:13,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-10-02 13:51:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1714. [2019-10-02 13:51:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2019-10-02 13:51:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2325 transitions. [2019-10-02 13:51:13,981 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2325 transitions. Word has length 190 [2019-10-02 13:51:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:13,982 INFO L475 AbstractCegarLoop]: Abstraction has 1714 states and 2325 transitions. [2019-10-02 13:51:13,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 13:51:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2325 transitions. [2019-10-02 13:51:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:51:13,988 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:13,989 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:13,989 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:13,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1465895855, now seen corresponding path program 1 times [2019-10-02 13:51:13,990 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:13,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:13,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:13,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:13,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:51:14,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:14,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:51:14,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:51:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:51:14,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:51:14,385 INFO L87 Difference]: Start difference. First operand 1714 states and 2325 transitions. Second operand 15 states. [2019-10-02 13:51:18,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:18,019 INFO L93 Difference]: Finished difference Result 3011 states and 4062 transitions. [2019-10-02 13:51:18,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-02 13:51:18,020 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2019-10-02 13:51:18,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:18,036 INFO L225 Difference]: With dead ends: 3011 [2019-10-02 13:51:18,036 INFO L226 Difference]: Without dead ends: 1816 [2019-10-02 13:51:18,046 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=229, Invalid=1933, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 13:51:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-10-02 13:51:18,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1784. [2019-10-02 13:51:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-10-02 13:51:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2439 transitions. [2019-10-02 13:51:18,346 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2439 transitions. Word has length 191 [2019-10-02 13:51:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:18,348 INFO L475 AbstractCegarLoop]: Abstraction has 1784 states and 2439 transitions. [2019-10-02 13:51:18,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:51:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2439 transitions. [2019-10-02 13:51:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 13:51:18,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:18,355 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:18,355 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash -632508049, now seen corresponding path program 1 times [2019-10-02 13:51:18,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:18,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:18,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:18,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:18,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:51:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:51:18,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:51:18,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:51:18,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:51:18,550 INFO L87 Difference]: Start difference. First operand 1784 states and 2439 transitions. Second operand 5 states. [2019-10-02 13:51:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:18,649 INFO L93 Difference]: Finished difference Result 2728 states and 3668 transitions. [2019-10-02 13:51:18,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:51:18,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 194 [2019-10-02 13:51:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:18,659 INFO L225 Difference]: With dead ends: 2728 [2019-10-02 13:51:18,660 INFO L226 Difference]: Without dead ends: 1448 [2019-10-02 13:51:18,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:51:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-10-02 13:51:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1448. [2019-10-02 13:51:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2019-10-02 13:51:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1982 transitions. [2019-10-02 13:51:18,753 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1982 transitions. Word has length 194 [2019-10-02 13:51:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:18,756 INFO L475 AbstractCegarLoop]: Abstraction has 1448 states and 1982 transitions. [2019-10-02 13:51:18,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:51:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1982 transitions. [2019-10-02 13:51:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:51:18,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:18,762 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:18,763 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1602067908, now seen corresponding path program 1 times [2019-10-02 13:51:18,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:18,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 13:51:19,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:19,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 13:51:19,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 13:51:19,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 13:51:19,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 13:51:19,152 INFO L87 Difference]: Start difference. First operand 1448 states and 1982 transitions. Second operand 16 states. [2019-10-02 13:51:19,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:19,596 INFO L93 Difference]: Finished difference Result 2464 states and 3327 transitions. [2019-10-02 13:51:19,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 13:51:19,597 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 191 [2019-10-02 13:51:19,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:19,607 INFO L225 Difference]: With dead ends: 2464 [2019-10-02 13:51:19,608 INFO L226 Difference]: Without dead ends: 1500 [2019-10-02 13:51:19,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-10-02 13:51:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2019-10-02 13:51:19,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1482. [2019-10-02 13:51:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2019-10-02 13:51:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2026 transitions. [2019-10-02 13:51:19,699 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 2026 transitions. Word has length 191 [2019-10-02 13:51:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:19,701 INFO L475 AbstractCegarLoop]: Abstraction has 1482 states and 2026 transitions. [2019-10-02 13:51:19,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 13:51:19,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 2026 transitions. [2019-10-02 13:51:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:51:19,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:19,707 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:19,707 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 204651284, now seen corresponding path program 1 times [2019-10-02 13:51:19,709 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:19,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:19,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:19,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:19,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:19,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:51:19,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:51:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:51:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:51:19,944 INFO L87 Difference]: Start difference. First operand 1482 states and 2026 transitions. Second operand 5 states. [2019-10-02 13:51:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:21,190 INFO L93 Difference]: Finished difference Result 3953 states and 5365 transitions. [2019-10-02 13:51:21,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 13:51:21,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-02 13:51:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:21,214 INFO L225 Difference]: With dead ends: 3953 [2019-10-02 13:51:21,214 INFO L226 Difference]: Without dead ends: 3305 [2019-10-02 13:51:21,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:51:21,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2019-10-02 13:51:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3274. [2019-10-02 13:51:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3274 states. [2019-10-02 13:51:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4448 transitions. [2019-10-02 13:51:21,406 INFO L78 Accepts]: Start accepts. Automaton has 3274 states and 4448 transitions. Word has length 191 [2019-10-02 13:51:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:21,407 INFO L475 AbstractCegarLoop]: Abstraction has 3274 states and 4448 transitions. [2019-10-02 13:51:21,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:51:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3274 states and 4448 transitions. [2019-10-02 13:51:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 13:51:21,416 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:21,416 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:21,417 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:21,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash 224988659, now seen corresponding path program 1 times [2019-10-02 13:51:21,418 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:21,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:21,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:21,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:21,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:21,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:51:21,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:51:21,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:51:21,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:51:21,656 INFO L87 Difference]: Start difference. First operand 3274 states and 4448 transitions. Second operand 7 states. [2019-10-02 13:51:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:23,904 INFO L93 Difference]: Finished difference Result 10723 states and 14842 transitions. [2019-10-02 13:51:23,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 13:51:23,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-10-02 13:51:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:23,974 INFO L225 Difference]: With dead ends: 10723 [2019-10-02 13:51:23,974 INFO L226 Difference]: Without dead ends: 8306 [2019-10-02 13:51:23,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:51:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8306 states. [2019-10-02 13:51:24,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8306 to 8284. [2019-10-02 13:51:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8284 states. [2019-10-02 13:51:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 11357 transitions. [2019-10-02 13:51:24,452 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 11357 transitions. Word has length 191 [2019-10-02 13:51:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:24,457 INFO L475 AbstractCegarLoop]: Abstraction has 8284 states and 11357 transitions. [2019-10-02 13:51:24,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:51:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 11357 transitions. [2019-10-02 13:51:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 13:51:24,465 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:24,466 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:51:24,466 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:24,466 INFO L82 PathProgramCache]: Analyzing trace with hash 10550669, now seen corresponding path program 1 times [2019-10-02 13:51:24,466 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:24,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:24,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:24,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:24,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:25,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:25,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-02 13:51:25,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-02 13:51:25,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-02 13:51:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-10-02 13:51:25,153 INFO L87 Difference]: Start difference. First operand 8284 states and 11357 transitions. Second operand 26 states. [2019-10-02 13:51:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:26,232 INFO L93 Difference]: Finished difference Result 15927 states and 21988 transitions. [2019-10-02 13:51:26,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 13:51:26,233 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-10-02 13:51:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:26,301 INFO L225 Difference]: With dead ends: 15927 [2019-10-02 13:51:26,301 INFO L226 Difference]: Without dead ends: 7071 [2019-10-02 13:51:26,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=1239, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:51:26,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2019-10-02 13:51:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 6938. [2019-10-02 13:51:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-10-02 13:51:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 9452 transitions. [2019-10-02 13:51:26,698 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 9452 transitions. Word has length 192 [2019-10-02 13:51:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:26,699 INFO L475 AbstractCegarLoop]: Abstraction has 6938 states and 9452 transitions. [2019-10-02 13:51:26,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-02 13:51:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 9452 transitions. [2019-10-02 13:51:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 13:51:26,707 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:26,707 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:51:26,708 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1712144114, now seen corresponding path program 1 times [2019-10-02 13:51:26,708 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:26,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:26,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:26,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:26,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:26,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:26,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 13:51:26,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 13:51:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 13:51:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 13:51:26,942 INFO L87 Difference]: Start difference. First operand 6938 states and 9452 transitions. Second operand 10 states. [2019-10-02 13:51:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:27,233 INFO L93 Difference]: Finished difference Result 6991 states and 9534 transitions. [2019-10-02 13:51:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:51:27,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2019-10-02 13:51:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:27,282 INFO L225 Difference]: With dead ends: 6991 [2019-10-02 13:51:27,283 INFO L226 Difference]: Without dead ends: 6930 [2019-10-02 13:51:27,290 INFO L640 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-10-02 13:51:27,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2019-10-02 13:51:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 6922. [2019-10-02 13:51:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-10-02 13:51:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 9416 transitions. [2019-10-02 13:51:27,619 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 9416 transitions. Word has length 196 [2019-10-02 13:51:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:27,620 INFO L475 AbstractCegarLoop]: Abstraction has 6922 states and 9416 transitions. [2019-10-02 13:51:27,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 13:51:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 9416 transitions. [2019-10-02 13:51:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:51:27,629 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:27,629 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:51:27,629 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:27,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1889598004, now seen corresponding path program 1 times [2019-10-02 13:51:27,630 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:27,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:27,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:27,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:27,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 13:51:27,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 13:51:27,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 13:51:27,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 13:51:27,779 INFO L87 Difference]: Start difference. First operand 6922 states and 9416 transitions. Second operand 5 states. [2019-10-02 13:51:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:27,971 INFO L93 Difference]: Finished difference Result 11692 states and 15673 transitions. [2019-10-02 13:51:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 13:51:27,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-10-02 13:51:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:28,009 INFO L225 Difference]: With dead ends: 11692 [2019-10-02 13:51:28,009 INFO L226 Difference]: Without dead ends: 7071 [2019-10-02 13:51:28,030 INFO L640 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-10-02 13:51:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2019-10-02 13:51:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 7004. [2019-10-02 13:51:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7004 states. [2019-10-02 13:51:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7004 states to 7004 states and 9521 transitions. [2019-10-02 13:51:28,350 INFO L78 Accepts]: Start accepts. Automaton has 7004 states and 9521 transitions. Word has length 201 [2019-10-02 13:51:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:28,351 INFO L475 AbstractCegarLoop]: Abstraction has 7004 states and 9521 transitions. [2019-10-02 13:51:28,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 13:51:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 7004 states and 9521 transitions. [2019-10-02 13:51:28,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 13:51:28,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:28,362 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-10-02 13:51:28,363 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1244172180, now seen corresponding path program 1 times [2019-10-02 13:51:28,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:28,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:28,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:28,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:28,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:28,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 13:51:28,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:51:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:51:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:51:28,716 INFO L87 Difference]: Start difference. First operand 7004 states and 9521 transitions. Second operand 11 states. [2019-10-02 13:51:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:29,177 INFO L93 Difference]: Finished difference Result 11675 states and 15600 transitions. [2019-10-02 13:51:29,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 13:51:29,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2019-10-02 13:51:29,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:29,208 INFO L225 Difference]: With dead ends: 11675 [2019-10-02 13:51:29,208 INFO L226 Difference]: Without dead ends: 7002 [2019-10-02 13:51:29,227 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-10-02 13:51:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7002 states. [2019-10-02 13:51:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7002 to 6966. [2019-10-02 13:51:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-10-02 13:51:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 9439 transitions. [2019-10-02 13:51:29,556 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 9439 transitions. Word has length 201 [2019-10-02 13:51:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:29,557 INFO L475 AbstractCegarLoop]: Abstraction has 6966 states and 9439 transitions. [2019-10-02 13:51:29,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:51:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 9439 transitions. [2019-10-02 13:51:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 13:51:29,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:29,565 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:29,566 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2081172186, now seen corresponding path program 1 times [2019-10-02 13:51:29,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:29,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:29,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 13:51:29,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:29,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 13:51:29,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 13:51:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 13:51:29,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 13:51:29,743 INFO L87 Difference]: Start difference. First operand 6966 states and 9439 transitions. Second operand 6 states. [2019-10-02 13:51:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:30,729 INFO L93 Difference]: Finished difference Result 19532 states and 26225 transitions. [2019-10-02 13:51:30,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 13:51:30,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-10-02 13:51:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:30,810 INFO L225 Difference]: With dead ends: 19532 [2019-10-02 13:51:30,810 INFO L226 Difference]: Without dead ends: 13915 [2019-10-02 13:51:31,019 INFO L640 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-10-02 13:51:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2019-10-02 13:51:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 13781. [2019-10-02 13:51:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13781 states. [2019-10-02 13:51:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 18691 transitions. [2019-10-02 13:51:31,644 INFO L78 Accepts]: Start accepts. Automaton has 13781 states and 18691 transitions. Word has length 202 [2019-10-02 13:51:31,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:31,645 INFO L475 AbstractCegarLoop]: Abstraction has 13781 states and 18691 transitions. [2019-10-02 13:51:31,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 13:51:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 13781 states and 18691 transitions. [2019-10-02 13:51:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 13:51:31,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:31,666 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:31,666 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:31,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2073017152, now seen corresponding path program 1 times [2019-10-02 13:51:31,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:31,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 13:51:31,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:31,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:51:31,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:51:31,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:51:31,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:51:31,884 INFO L87 Difference]: Start difference. First operand 13781 states and 18691 transitions. Second operand 8 states. [2019-10-02 13:51:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:34,534 INFO L93 Difference]: Finished difference Result 40776 states and 55650 transitions. [2019-10-02 13:51:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 13:51:34,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-10-02 13:51:34,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:34,685 INFO L225 Difference]: With dead ends: 40776 [2019-10-02 13:51:34,685 INFO L226 Difference]: Without dead ends: 28418 [2019-10-02 13:51:34,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:51:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28418 states. [2019-10-02 13:51:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28418 to 28053. [2019-10-02 13:51:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-10-02 13:51:36,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 38246 transitions. [2019-10-02 13:51:36,613 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 38246 transitions. Word has length 221 [2019-10-02 13:51:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:36,614 INFO L475 AbstractCegarLoop]: Abstraction has 28053 states and 38246 transitions. [2019-10-02 13:51:36,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:51:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 38246 transitions. [2019-10-02 13:51:36,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:51:36,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:36,661 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:36,661 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:36,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash 348099570, now seen corresponding path program 1 times [2019-10-02 13:51:36,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:36,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:51:37,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:37,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-02 13:51:37,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 13:51:37,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 13:51:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 13:51:37,118 INFO L87 Difference]: Start difference. First operand 28053 states and 38246 transitions. Second operand 15 states. [2019-10-02 13:51:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:40,892 INFO L93 Difference]: Finished difference Result 45150 states and 60803 transitions. [2019-10-02 13:51:40,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-02 13:51:40,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 222 [2019-10-02 13:51:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:41,030 INFO L225 Difference]: With dead ends: 45150 [2019-10-02 13:51:41,030 INFO L226 Difference]: Without dead ends: 28284 [2019-10-02 13:51:41,076 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 13:51:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28284 states. [2019-10-02 13:51:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28284 to 27364. [2019-10-02 13:51:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27364 states. [2019-10-02 13:51:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27364 states to 27364 states and 37243 transitions. [2019-10-02 13:51:42,410 INFO L78 Accepts]: Start accepts. Automaton has 27364 states and 37243 transitions. Word has length 222 [2019-10-02 13:51:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:42,411 INFO L475 AbstractCegarLoop]: Abstraction has 27364 states and 37243 transitions. [2019-10-02 13:51:42,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 13:51:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 27364 states and 37243 transitions. [2019-10-02 13:51:42,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:51:42,454 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:42,455 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:42,455 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:42,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:42,455 INFO L82 PathProgramCache]: Analyzing trace with hash 650820244, now seen corresponding path program 1 times [2019-10-02 13:51:42,455 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:42,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:42,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:42,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:42,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:51:42,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:51:42,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:51:42,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:51:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:51:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:51:42,679 INFO L87 Difference]: Start difference. First operand 27364 states and 37243 transitions. Second operand 7 states. [2019-10-02 13:51:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:48,902 INFO L93 Difference]: Finished difference Result 78245 states and 106527 transitions. [2019-10-02 13:51:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:51:48,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-10-02 13:51:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:49,161 INFO L225 Difference]: With dead ends: 78245 [2019-10-02 13:51:49,162 INFO L226 Difference]: Without dead ends: 56102 [2019-10-02 13:51:49,242 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:51:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56102 states. [2019-10-02 13:51:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56102 to 54219. [2019-10-02 13:51:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54219 states. [2019-10-02 13:51:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54219 states to 54219 states and 73848 transitions. [2019-10-02 13:51:51,776 INFO L78 Accepts]: Start accepts. Automaton has 54219 states and 73848 transitions. Word has length 222 [2019-10-02 13:51:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:51:51,777 INFO L475 AbstractCegarLoop]: Abstraction has 54219 states and 73848 transitions. [2019-10-02 13:51:51,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:51:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 54219 states and 73848 transitions. [2019-10-02 13:51:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-02 13:51:51,836 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:51:51,836 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:51:51,837 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:51:51,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:51:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash -6611154, now seen corresponding path program 2 times [2019-10-02 13:51:51,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:51:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:51:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:51,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:51:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:51:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:51:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 13:51:52,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:51:52,022 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:51:52,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 13:51:52,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 13:51:52,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 13:51:52,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 2871 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:51:52,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:51:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 13:51:52,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:51:52,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-10-02 13:51:52,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 13:51:52,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 13:51:52,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-02 13:51:52,962 INFO L87 Difference]: Start difference. First operand 54219 states and 73848 transitions. Second operand 18 states. [2019-10-02 13:51:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:51:59,354 INFO L93 Difference]: Finished difference Result 109046 states and 148766 transitions. [2019-10-02 13:51:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-02 13:51:59,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 222 [2019-10-02 13:51:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:51:59,734 INFO L225 Difference]: With dead ends: 109046 [2019-10-02 13:51:59,735 INFO L226 Difference]: Without dead ends: 54879 [2019-10-02 13:51:59,929 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 13:51:59,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54879 states. [2019-10-02 13:52:03,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54879 to 54485. [2019-10-02 13:52:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54485 states. [2019-10-02 13:52:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54485 states to 54485 states and 74188 transitions. [2019-10-02 13:52:03,429 INFO L78 Accepts]: Start accepts. Automaton has 54485 states and 74188 transitions. Word has length 222 [2019-10-02 13:52:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:03,430 INFO L475 AbstractCegarLoop]: Abstraction has 54485 states and 74188 transitions. [2019-10-02 13:52:03,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 13:52:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 54485 states and 74188 transitions. [2019-10-02 13:52:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:52:03,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:03,495 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:03,495 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1836734643, now seen corresponding path program 1 times [2019-10-02 13:52:03,496 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:03,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:03,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 13:52:03,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:52:03,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:03,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 13:52:03,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 13:52:03,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 13:52:03,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 13:52:03,734 INFO L87 Difference]: Start difference. First operand 54485 states and 74188 transitions. Second operand 7 states. [2019-10-02 13:52:12,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:12,065 INFO L93 Difference]: Finished difference Result 151589 states and 206079 transitions. [2019-10-02 13:52:12,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 13:52:12,066 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-10-02 13:52:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:12,676 INFO L225 Difference]: With dead ends: 151589 [2019-10-02 13:52:12,676 INFO L226 Difference]: Without dead ends: 110385 [2019-10-02 13:52:12,819 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-02 13:52:12,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110385 states. [2019-10-02 13:52:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110385 to 106488. [2019-10-02 13:52:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106488 states. [2019-10-02 13:52:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106488 states to 106488 states and 144849 transitions. [2019-10-02 13:52:19,672 INFO L78 Accepts]: Start accepts. Automaton has 106488 states and 144849 transitions. Word has length 224 [2019-10-02 13:52:19,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:19,673 INFO L475 AbstractCegarLoop]: Abstraction has 106488 states and 144849 transitions. [2019-10-02 13:52:19,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 13:52:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 106488 states and 144849 transitions. [2019-10-02 13:52:19,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 13:52:19,783 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:19,783 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:19,784 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1031736719, now seen corresponding path program 1 times [2019-10-02 13:52:19,784 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:19,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:19,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:19,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:19,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 13:52:20,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:52:20,009 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:52:20,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:20,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 2873 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 13:52:20,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:52:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 13:52:20,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:52:20,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-10-02 13:52:20,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 13:52:20,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 13:52:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 13:52:20,897 INFO L87 Difference]: Start difference. First operand 106488 states and 144849 transitions. Second operand 11 states. [2019-10-02 13:52:30,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:30,249 INFO L93 Difference]: Finished difference Result 223546 states and 300653 transitions. [2019-10-02 13:52:30,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:52:30,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2019-10-02 13:52:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:30,736 INFO L225 Difference]: With dead ends: 223546 [2019-10-02 13:52:30,736 INFO L226 Difference]: Without dead ends: 122587 [2019-10-02 13:52:30,920 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2019-10-02 13:52:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122587 states. [2019-10-02 13:52:34,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122587 to 120728. [2019-10-02 13:52:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120728 states. [2019-10-02 13:52:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120728 states to 120728 states and 161492 transitions. [2019-10-02 13:52:34,979 INFO L78 Accepts]: Start accepts. Automaton has 120728 states and 161492 transitions. Word has length 224 [2019-10-02 13:52:34,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:34,980 INFO L475 AbstractCegarLoop]: Abstraction has 120728 states and 161492 transitions. [2019-10-02 13:52:34,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 13:52:34,980 INFO L276 IsEmpty]: Start isEmpty. Operand 120728 states and 161492 transitions. [2019-10-02 13:52:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-02 13:52:35,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:35,072 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:35,072 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2077726198, now seen corresponding path program 1 times [2019-10-02 13:52:35,072 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:35,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:35,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:35,199 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 13:52:35,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:35,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 13:52:35,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 13:52:35,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 13:52:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:52:35,200 INFO L87 Difference]: Start difference. First operand 120728 states and 161492 transitions. Second operand 3 states. [2019-10-02 13:52:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:52:42,638 INFO L93 Difference]: Finished difference Result 245081 states and 330895 transitions. [2019-10-02 13:52:42,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 13:52:42,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-10-02 13:52:42,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:52:43,155 INFO L225 Difference]: With dead ends: 245081 [2019-10-02 13:52:43,155 INFO L226 Difference]: Without dead ends: 124664 [2019-10-02 13:52:43,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 13:52:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124664 states. [2019-10-02 13:52:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124664 to 124566. [2019-10-02 13:52:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124566 states. [2019-10-02 13:52:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124566 states to 124566 states and 169589 transitions. [2019-10-02 13:52:47,460 INFO L78 Accepts]: Start accepts. Automaton has 124566 states and 169589 transitions. Word has length 232 [2019-10-02 13:52:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:52:47,461 INFO L475 AbstractCegarLoop]: Abstraction has 124566 states and 169589 transitions. [2019-10-02 13:52:47,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 13:52:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 124566 states and 169589 transitions. [2019-10-02 13:52:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 13:52:47,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:52:47,560 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 13:52:47,561 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:52:47,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:52:47,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1079554170, now seen corresponding path program 1 times [2019-10-02 13:52:47,561 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:52:47,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:52:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:47,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:52:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:52:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:52:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 13:52:47,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:52:47,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:52:47,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:52:47,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:52:47,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:52:47,781 INFO L87 Difference]: Start difference. First operand 124566 states and 169589 transitions. Second operand 8 states. [2019-10-02 13:53:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:01,529 INFO L93 Difference]: Finished difference Result 379028 states and 528621 transitions. [2019-10-02 13:53:01,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:53:01,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 258 [2019-10-02 13:53:01,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:02,555 INFO L225 Difference]: With dead ends: 379028 [2019-10-02 13:53:02,556 INFO L226 Difference]: Without dead ends: 254773 [2019-10-02 13:53:02,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:53:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254773 states. [2019-10-02 13:53:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254773 to 200323. [2019-10-02 13:53:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200323 states. [2019-10-02 13:53:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200323 states to 200323 states and 282714 transitions. [2019-10-02 13:53:17,518 INFO L78 Accepts]: Start accepts. Automaton has 200323 states and 282714 transitions. Word has length 258 [2019-10-02 13:53:17,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:53:17,518 INFO L475 AbstractCegarLoop]: Abstraction has 200323 states and 282714 transitions. [2019-10-02 13:53:17,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:53:17,519 INFO L276 IsEmpty]: Start isEmpty. Operand 200323 states and 282714 transitions. [2019-10-02 13:53:17,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 13:53:17,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:53:17,740 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2019-10-02 13:53:17,741 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:53:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:53:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1641888862, now seen corresponding path program 1 times [2019-10-02 13:53:17,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:53:17,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:53:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:17,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:53:17,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:53:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:53:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:53:17,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:53:17,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:53:17,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:53:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:53:17,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:53:17,937 INFO L87 Difference]: Start difference. First operand 200323 states and 282714 transitions. Second operand 8 states. [2019-10-02 13:53:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:53:40,616 INFO L93 Difference]: Finished difference Result 612731 states and 889980 transitions. [2019-10-02 13:53:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:53:40,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 254 [2019-10-02 13:53:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:53:42,194 INFO L225 Difference]: With dead ends: 612731 [2019-10-02 13:53:42,194 INFO L226 Difference]: Without dead ends: 412719 [2019-10-02 13:53:42,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:53:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412719 states. [2019-10-02 13:54:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412719 to 302771. [2019-10-02 13:54:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302771 states. [2019-10-02 13:54:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302771 states to 302771 states and 450746 transitions. [2019-10-02 13:54:06,739 INFO L78 Accepts]: Start accepts. Automaton has 302771 states and 450746 transitions. Word has length 254 [2019-10-02 13:54:06,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:54:06,740 INFO L475 AbstractCegarLoop]: Abstraction has 302771 states and 450746 transitions. [2019-10-02 13:54:06,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:54:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 302771 states and 450746 transitions. [2019-10-02 13:54:07,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 13:54:07,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:54:07,335 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-10-02 13:54:07,336 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:54:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:54:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash -416893982, now seen corresponding path program 1 times [2019-10-02 13:54:07,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:54:07,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:54:07,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:07,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:54:07,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:54:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:54:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 13:54:07,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 13:54:07,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 13:54:07,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 13:54:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 13:54:07,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 13:54:07,593 INFO L87 Difference]: Start difference. First operand 302771 states and 450746 transitions. Second operand 8 states. [2019-10-02 13:54:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:54:49,559 INFO L93 Difference]: Finished difference Result 931883 states and 1437516 transitions. [2019-10-02 13:54:49,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 13:54:49,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 255 [2019-10-02 13:54:49,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:54:53,063 INFO L225 Difference]: With dead ends: 931883 [2019-10-02 13:54:53,063 INFO L226 Difference]: Without dead ends: 629423 [2019-10-02 13:54:53,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-02 13:54:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629423 states. [2019-10-02 13:55:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629423 to 488007. [2019-10-02 13:55:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488007 states. [2019-10-02 13:55:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488007 states to 488007 states and 773032 transitions. [2019-10-02 13:55:48,166 INFO L78 Accepts]: Start accepts. Automaton has 488007 states and 773032 transitions. Word has length 255 [2019-10-02 13:55:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 13:55:48,166 INFO L475 AbstractCegarLoop]: Abstraction has 488007 states and 773032 transitions. [2019-10-02 13:55:48,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 13:55:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 488007 states and 773032 transitions. [2019-10-02 13:55:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 13:55:50,392 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 13:55:50,392 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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-10-02 13:55:50,392 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 13:55:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 13:55:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1897589821, now seen corresponding path program 1 times [2019-10-02 13:55:50,393 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 13:55:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 13:55:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:50,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:50,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 13:55:50,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 13:55:51,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 13:55:51,638 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 13:55:51,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 13:55:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 13:55:52,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 3109 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 13:55:52,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 13:55:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 13:55:52,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 13:55:52,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [45] total 52 [2019-10-02 13:55:52,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-10-02 13:55:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-10-02 13:55:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=2535, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 13:55:52,579 INFO L87 Difference]: Start difference. First operand 488007 states and 773032 transitions. Second operand 52 states. [2019-10-02 13:58:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 13:58:20,964 INFO L93 Difference]: Finished difference Result 1407229 states and 2231609 transitions. [2019-10-02 13:58:20,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2019-10-02 13:58:20,965 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 259 [2019-10-02 13:58:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 13:58:25,155 INFO L225 Difference]: With dead ends: 1407229 [2019-10-02 13:58:25,155 INFO L226 Difference]: Without dead ends: 910088 [2019-10-02 13:58:26,440 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14304 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=2731, Invalid=42851, Unknown=0, NotChecked=0, Total=45582 [2019-10-02 13:58:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910088 states.