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-112bae1 [2019-09-08 05:35:51,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 05:35:51,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 05:35:51,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 05:35:51,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 05:35:51,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 05:35:51,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 05:35:51,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 05:35:51,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 05:35:51,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 05:35:51,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 05:35:51,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 05:35:51,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 05:35:51,502 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 05:35:51,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 05:35:51,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 05:35:51,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 05:35:51,505 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 05:35:51,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 05:35:51,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 05:35:51,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 05:35:51,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 05:35:51,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 05:35:51,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 05:35:51,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 05:35:51,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 05:35:51,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 05:35:51,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 05:35:51,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 05:35:51,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 05:35:51,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 05:35:51,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 05:35:51,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 05:35:51,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 05:35:51,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 05:35:51,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 05:35:51,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 05:35:51,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 05:35:51,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 05:35:51,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 05:35:51,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 05:35:51,528 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 05:35:51,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 05:35:51,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 05:35:51,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 05:35:51,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 05:35:51,557 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 05:35:51,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 05:35:51,558 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 05:35:51,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 05:35:51,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 05:35:51,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 05:35:51,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 05:35:51,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 05:35:51,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 05:35:51,561 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 05:35:51,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 05:35:51,561 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 05:35:51,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 05:35:51,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 05:35:51,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 05:35:51,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 05:35:51,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 05:35:51,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:35:51,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 05:35:51,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 05:35:51,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 05:35:51,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 05:35:51,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 05:35:51,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 05:35:51,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 05:35:51,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 05:35:51,629 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 05:35:51,633 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 05:35:51,634 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 05:35:51,635 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 05:35:51,635 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-09-08 05:35:51,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139dbc63c/9b8d4530d3b94ecc8f6d1896621f6681/FLAGabbe1c4b5 [2019-09-08 05:35:52,361 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 05:35:52,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec7_product31.cil.c [2019-09-08 05:35:52,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139dbc63c/9b8d4530d3b94ecc8f6d1896621f6681/FLAGabbe1c4b5 [2019-09-08 05:35:52,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139dbc63c/9b8d4530d3b94ecc8f6d1896621f6681 [2019-09-08 05:35:52,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 05:35:52,725 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 05:35:52,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 05:35:52,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 05:35:52,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 05:35:52,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593235c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:52, skipping insertion in model container [2019-09-08 05:35:52,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:35:52" (1/1) ... [2019-09-08 05:35:52,742 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 05:35:52,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 05:35:53,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:35:53,608 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 05:35:53,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 05:35:53,849 INFO L192 MainTranslator]: Completed translation [2019-09-08 05:35:53,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53 WrapperNode [2019-09-08 05:35:53,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 05:35:53,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 05:35:53,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 05:35:53,851 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 05:35:53,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:53,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:53,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:53,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:53,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:54,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:54,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... [2019-09-08 05:35:54,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 05:35:54,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 05:35:54,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 05:35:54,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 05:35:54,063 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 05:35:54,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 05:35:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 05:35:54,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 05:35:54,159 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__wrappee__Base [2019-09-08 05:35:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob [2019-09-08 05:35:54,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__wrappee__Base [2019-09-08 05:35:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh [2019-09-08 05:35:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__wrappee__Base [2019-09-08 05:35:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck [2019-09-08 05:35:54,161 INFO L138 BoogieDeclarations]: Found implementation of procedure bobToRjh [2019-09-08 05:35:54,162 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhToBob [2019-09-08 05:35:54,162 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 05:35:54,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 05:35:54,163 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAdd [2019-09-08 05:35:54,165 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAdd [2019-09-08 05:35:54,165 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyAddChuck [2019-09-08 05:35:54,168 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyAddChuck [2019-09-08 05:35:54,169 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2019-09-08 05:35:54,169 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAddRjh [2019-09-08 05:35:54,169 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhDeletePrivateKey [2019-09-08 05:35:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure bobKeyChange [2019-09-08 05:35:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhKeyChange [2019-09-08 05:35:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure rjhEnableForwarding [2019-09-08 05:35:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:35:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 05:35:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure mail [2019-09-08 05:35:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2019-09-08 05:35:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Encrypt [2019-09-08 05:35:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2019-09-08 05:35:54,172 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver [2019-09-08 05:35:54,172 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Sign [2019-09-08 05:35:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Forward [2019-09-08 05:35:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__wrappee__Verify [2019-09-08 05:35:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming [2019-09-08 05:35:54,174 INFO L138 BoogieDeclarations]: Found implementation of procedure createClient [2019-09-08 05:35:54,174 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2019-09-08 05:35:54,174 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2019-09-08 05:35:54,174 INFO L138 BoogieDeclarations]: Found implementation of procedure is_queue_empty [2019-09-08 05:35:54,175 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_client [2019-09-08 05:35:54,175 INFO L138 BoogieDeclarations]: Found implementation of procedure get_queued_email [2019-09-08 05:35:54,175 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2019-09-08 05:35:54,175 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2019-09-08 05:35:54,175 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-09-08 05:35:54,176 INFO L138 BoogieDeclarations]: Found implementation of procedure forward [2019-09-08 05:35:54,176 INFO L138 BoogieDeclarations]: Found implementation of procedure verify [2019-09-08 05:35:54,176 INFO L138 BoogieDeclarations]: Found implementation of procedure initEmail [2019-09-08 05:35:54,176 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailId [2019-09-08 05:35:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailId [2019-09-08 05:35:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2019-09-08 05:35:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2019-09-08 05:35:54,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2019-09-08 05:35:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2019-09-08 05:35:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSubject [2019-09-08 05:35:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSubject [2019-09-08 05:35:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailBody [2019-09-08 05:35:54,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailBody [2019-09-08 05:35:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2019-09-08 05:35:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2019-09-08 05:35:54,179 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2019-09-08 05:35:54,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2019-09-08 05:35:54,180 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2019-09-08 05:35:54,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSigned [2019-09-08 05:35:54,180 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2019-09-08 05:35:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailSignKey [2019-09-08 05:35:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2019-09-08 05:35:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsSignatureVerified [2019-09-08 05:35:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 05:35:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 05:35:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 05:35:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 05:35:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 05:35:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 05:35:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Keys [2019-09-08 05:35:54,182 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Encrypt [2019-09-08 05:35:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__wrappee__Forward [2019-09-08 05:35:54,183 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail [2019-09-08 05:35:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__wrappee__Keys [2019-09-08 05:35:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2019-09-08 05:35:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure cloneEmail [2019-09-08 05:35:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure createEmail [2019-09-08 05:35:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure prompt [2019-09-08 05:35:54,184 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 05:35:54,185 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 05:35:54,185 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 05:35:54,186 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 05:35:54,186 INFO L138 BoogieDeclarations]: Found implementation of procedure initClient [2019-09-08 05:35:54,186 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientName [2019-09-08 05:35:54,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientName [2019-09-08 05:35:54,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientOutbuffer [2019-09-08 05:35:54,188 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientOutbuffer [2019-09-08 05:35:54,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2019-09-08 05:35:54,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2019-09-08 05:35:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientAddressBookEntry [2019-09-08 05:35:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAlias [2019-09-08 05:35:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure findClientAddressBookAlias [2019-09-08 05:35:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAlias [2019-09-08 05:35:54,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2019-09-08 05:35:54,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2019-09-08 05:35:54,191 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAutoResponse [2019-09-08 05:35:54,191 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAutoResponse [2019-09-08 05:35:54,191 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2019-09-08 05:35:54,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2019-09-08 05:35:54,192 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringSize [2019-09-08 05:35:54,192 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringSize [2019-09-08 05:35:54,192 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2019-09-08 05:35:54,192 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringUser [2019-09-08 05:35:54,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2019-09-08 05:35:54,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientKeyringPublicKey [2019-09-08 05:35:54,193 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2019-09-08 05:35:54,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2019-09-08 05:35:54,193 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientForwardReceiver [2019-09-08 05:35:54,193 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientForwardReceiver [2019-09-08 05:35:54,194 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientId [2019-09-08 05:35:54,194 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2019-09-08 05:35:54,194 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 05:35:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 05:35:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 05:35:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 05:35:54,195 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-09-08 05:35:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2019-09-08 05:35:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2019-09-08 05:35:54,196 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringUser [2019-09-08 05:35:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2019-09-08 05:35:54,197 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringPublicKey [2019-09-08 05:35:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2019-09-08 05:35:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientForwardReceiver [2019-09-08 05:35:54,198 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2019-09-08 05:35:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 05:35:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 05:35:54,199 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 05:35:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure is_queue_empty [2019-09-08 05:35:54,200 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_client [2019-09-08 05:35:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure get_queued_email [2019-09-08 05:35:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2019-09-08 05:35:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2019-09-08 05:35:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2019-09-08 05:35:54,201 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob [2019-09-08 05:35:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh [2019-09-08 05:35:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck [2019-09-08 05:35:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure bobToRjh [2019-09-08 05:35:54,208 INFO L130 BoogieDeclarations]: Found specification of procedure rjhToBob [2019-09-08 05:35:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 05:35:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 05:35:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 05:35:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAdd [2019-09-08 05:35:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyAddChuck [2019-09-08 05:35:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAdd [2019-09-08 05:35:54,219 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyAddChuck [2019-09-08 05:35:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2019-09-08 05:35:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure bobKeyChange [2019-09-08 05:35:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure rjhKeyChange [2019-09-08 05:35:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure rjhDeletePrivateKey [2019-09-08 05:35:54,220 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAddRjh [2019-09-08 05:35:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure rjhEnableForwarding [2019-09-08 05:35:54,221 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__wrappee__Base [2019-09-08 05:35:54,223 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__wrappee__Base [2019-09-08 05:35:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__wrappee__Base [2019-09-08 05:35:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 05:35:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 05:35:54,224 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2019-09-08 05:35:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__EncryptVerify_spec__1 [2019-09-08 05:35:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure initClient [2019-09-08 05:35:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2019-09-08 05:35:54,225 INFO L130 BoogieDeclarations]: Found specification of procedure getClientForwardReceiver [2019-09-08 05:35:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure getClientId [2019-09-08 05:35:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2019-09-08 05:35:54,226 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2019-09-08 05:35:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2019-09-08 05:35:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2019-09-08 05:35:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2019-09-08 05:35:54,227 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2019-09-08 05:35:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2019-09-08 05:35:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2019-09-08 05:35:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2019-09-08 05:35:54,228 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2019-09-08 05:35:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSigned [2019-09-08 05:35:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2019-09-08 05:35:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSignKey [2019-09-08 05:35:54,229 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsSignatureVerified [2019-09-08 05:35:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure printMail [2019-09-08 05:35:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure createEmail [2019-09-08 05:35:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2019-09-08 05:35:54,230 INFO L130 BoogieDeclarations]: Found specification of procedure mail [2019-09-08 05:35:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure deliver [2019-09-08 05:35:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure incoming [2019-09-08 05:35:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure createClient [2019-09-08 05:35:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2019-09-08 05:35:54,231 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-09-08 05:35:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure forward [2019-09-08 05:35:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure verify [2019-09-08 05:35:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2019-09-08 05:35:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Encrypt [2019-09-08 05:35:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Sign [2019-09-08 05:35:54,232 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Forward [2019-09-08 05:35:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__wrappee__Verify [2019-09-08 05:35:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure initEmail [2019-09-08 05:35:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailId [2019-09-08 05:35:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailId [2019-09-08 05:35:54,233 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSubject [2019-09-08 05:35:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailSubject [2019-09-08 05:35:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailBody [2019-09-08 05:35:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailBody [2019-09-08 05:35:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2019-09-08 05:35:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 05:35:54,234 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 05:35:54,235 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 05:35:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 05:35:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 05:35:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 05:35:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 05:35:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 05:35:54,236 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 05:35:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 05:35:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure cloneEmail [2019-09-08 05:35:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Keys [2019-09-08 05:35:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Encrypt [2019-09-08 05:35:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__wrappee__Forward [2019-09-08 05:35:54,237 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__wrappee__Keys [2019-09-08 05:35:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure prompt [2019-09-08 05:35:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 05:35:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure getClientName [2019-09-08 05:35:54,238 INFO L130 BoogieDeclarations]: Found specification of procedure setClientName [2019-09-08 05:35:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure getClientOutbuffer [2019-09-08 05:35:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure setClientOutbuffer [2019-09-08 05:35:54,239 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2019-09-08 05:35:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2019-09-08 05:35:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure createClientAddressBookEntry [2019-09-08 05:35:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAlias [2019-09-08 05:35:54,240 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAlias [2019-09-08 05:35:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2019-09-08 05:35:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2019-09-08 05:35:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAutoResponse [2019-09-08 05:35:54,241 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAutoResponse [2019-09-08 05:35:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure getClientKeyringSize [2019-09-08 05:35:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure findClientAddressBookAlias [2019-09-08 05:35:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringSize [2019-09-08 05:35:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 05:35:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 05:35:54,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 05:35:56,648 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 05:35:56,648 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-08 05:35:56,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:35:56 BoogieIcfgContainer [2019-09-08 05:35:56,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 05:35:56,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 05:35:56,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 05:35:56,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 05:35:56,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:35:52" (1/3) ... [2019-09-08 05:35:56,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a62ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:35:56, skipping insertion in model container [2019-09-08 05:35:56,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:35:53" (2/3) ... [2019-09-08 05:35:56,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a62ba4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:35:56, skipping insertion in model container [2019-09-08 05:35:56,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:35:56" (3/3) ... [2019-09-08 05:35:56,660 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec7_product31.cil.c [2019-09-08 05:35:56,672 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 05:35:56,686 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 05:35:56,705 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 05:35:56,753 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 05:35:56,754 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 05:35:56,754 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 05:35:56,755 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 05:35:56,755 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 05:35:56,756 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 05:35:56,760 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 05:35:56,760 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 05:35:56,760 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 05:35:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states. [2019-09-08 05:35:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 05:35:56,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:56,840 INFO L399 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-09-08 05:35:56,846 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:56,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1012113491, now seen corresponding path program 1 times [2019-09-08 05:35:56,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:35:57,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:57,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 05:35:57,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 05:35:57,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 05:35:57,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:35:57,486 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 2 states. [2019-09-08 05:35:57,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:57,595 INFO L93 Difference]: Finished difference Result 850 states and 1117 transitions. [2019-09-08 05:35:57,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 05:35:57,597 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 182 [2019-09-08 05:35:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:57,640 INFO L225 Difference]: With dead ends: 850 [2019-09-08 05:35:57,640 INFO L226 Difference]: Without dead ends: 531 [2019-09-08 05:35:57,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 05:35:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-08 05:35:57,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2019-09-08 05:35:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-09-08 05:35:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 701 transitions. [2019-09-08 05:35:57,767 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 701 transitions. Word has length 182 [2019-09-08 05:35:57,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:57,769 INFO L475 AbstractCegarLoop]: Abstraction has 531 states and 701 transitions. [2019-09-08 05:35:57,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 05:35:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 701 transitions. [2019-09-08 05:35:57,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 05:35:57,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:57,776 INFO L399 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-09-08 05:35:57,777 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:57,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:57,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1074774869, now seen corresponding path program 1 times [2019-09-08 05:35:57,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:57,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:57,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:35:58,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:58,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:35:58,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:35:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:35:58,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:58,094 INFO L87 Difference]: Start difference. First operand 531 states and 701 transitions. Second operand 3 states. [2019-09-08 05:35:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:58,149 INFO L93 Difference]: Finished difference Result 833 states and 1082 transitions. [2019-09-08 05:35:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:35:58,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-08 05:35:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:58,155 INFO L225 Difference]: With dead ends: 833 [2019-09-08 05:35:58,155 INFO L226 Difference]: Without dead ends: 534 [2019-09-08 05:35:58,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:58,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-08 05:35:58,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 533. [2019-09-08 05:35:58,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-09-08 05:35:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 703 transitions. [2019-09-08 05:35:58,191 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 703 transitions. Word has length 183 [2019-09-08 05:35:58,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:58,192 INFO L475 AbstractCegarLoop]: Abstraction has 533 states and 703 transitions. [2019-09-08 05:35:58,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:35:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 703 transitions. [2019-09-08 05:35:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 05:35:58,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:58,197 INFO L399 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-09-08 05:35:58,197 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:58,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:58,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1838955167, now seen corresponding path program 1 times [2019-09-08 05:35:58,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:58,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:35:58,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:58,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:35:58,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:35:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:35:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:58,444 INFO L87 Difference]: Start difference. First operand 533 states and 703 transitions. Second operand 3 states. [2019-09-08 05:35:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:35:58,502 INFO L93 Difference]: Finished difference Result 1042 states and 1404 transitions. [2019-09-08 05:35:58,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:35:58,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-08 05:35:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:35:58,513 INFO L225 Difference]: With dead ends: 1042 [2019-09-08 05:35:58,513 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 05:35:58,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:35:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 05:35:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 573. [2019-09-08 05:35:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-08 05:35:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 772 transitions. [2019-09-08 05:35:58,574 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 772 transitions. Word has length 189 [2019-09-08 05:35:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:35:58,575 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 772 transitions. [2019-09-08 05:35:58,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:35:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 772 transitions. [2019-09-08 05:35:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 05:35:58,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:35:58,585 INFO L399 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-09-08 05:35:58,586 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:35:58,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:35:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash -120410327, now seen corresponding path program 1 times [2019-09-08 05:35:58,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:35:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:35:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:58,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:35:58,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:35:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:35:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:35:59,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:35:59,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 05:35:59,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 05:35:59,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 05:35:59,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:35:59,131 INFO L87 Difference]: Start difference. First operand 573 states and 772 transitions. Second operand 19 states. [2019-09-08 05:36:04,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:04,774 INFO L93 Difference]: Finished difference Result 2037 states and 2754 transitions. [2019-09-08 05:36:04,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 05:36:04,778 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 190 [2019-09-08 05:36:04,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:04,794 INFO L225 Difference]: With dead ends: 2037 [2019-09-08 05:36:04,795 INFO L226 Difference]: Without dead ends: 1751 [2019-09-08 05:36:04,799 INFO L628 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-09-08 05:36:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2019-09-08 05:36:04,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1714. [2019-09-08 05:36:04,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2019-09-08 05:36:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2325 transitions. [2019-09-08 05:36:04,953 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2325 transitions. Word has length 190 [2019-09-08 05:36:04,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:04,955 INFO L475 AbstractCegarLoop]: Abstraction has 1714 states and 2325 transitions. [2019-09-08 05:36:04,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 05:36:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2325 transitions. [2019-09-08 05:36:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:36:04,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:04,965 INFO L399 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-09-08 05:36:04,965 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:04,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:04,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1465895855, now seen corresponding path program 1 times [2019-09-08 05:36:04,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:04,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:04,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:04,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:05,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:05,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:36:05,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:36:05,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:36:05,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:36:05,400 INFO L87 Difference]: Start difference. First operand 1714 states and 2325 transitions. Second operand 15 states. [2019-09-08 05:36:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:09,812 INFO L93 Difference]: Finished difference Result 3011 states and 4062 transitions. [2019-09-08 05:36:09,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 05:36:09,813 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 191 [2019-09-08 05:36:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:09,824 INFO L225 Difference]: With dead ends: 3011 [2019-09-08 05:36:09,824 INFO L226 Difference]: Without dead ends: 1816 [2019-09-08 05:36:09,829 INFO L628 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-09-08 05:36:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2019-09-08 05:36:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1784. [2019-09-08 05:36:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-09-08 05:36:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2439 transitions. [2019-09-08 05:36:09,921 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2439 transitions. Word has length 191 [2019-09-08 05:36:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:09,922 INFO L475 AbstractCegarLoop]: Abstraction has 1784 states and 2439 transitions. [2019-09-08 05:36:09,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:36:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2439 transitions. [2019-09-08 05:36:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:36:09,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:09,928 INFO L399 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-09-08 05:36:09,929 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:09,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1602067908, now seen corresponding path program 1 times [2019-09-08 05:36:09,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:09,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:09,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:09,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 05:36:10,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:10,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 05:36:10,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 05:36:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 05:36:10,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 05:36:10,352 INFO L87 Difference]: Start difference. First operand 1784 states and 2439 transitions. Second operand 16 states. [2019-09-08 05:36:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:10,824 INFO L93 Difference]: Finished difference Result 3171 states and 4308 transitions. [2019-09-08 05:36:10,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 05:36:10,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 191 [2019-09-08 05:36:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:10,836 INFO L225 Difference]: With dead ends: 3171 [2019-09-08 05:36:10,836 INFO L226 Difference]: Without dead ends: 1856 [2019-09-08 05:36:10,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2019-09-08 05:36:10,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2019-09-08 05:36:10,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1825. [2019-09-08 05:36:10,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1825 states. [2019-09-08 05:36:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2486 transitions. [2019-09-08 05:36:10,932 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2486 transitions. Word has length 191 [2019-09-08 05:36:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:10,933 INFO L475 AbstractCegarLoop]: Abstraction has 1825 states and 2486 transitions. [2019-09-08 05:36:10,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 05:36:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2486 transitions. [2019-09-08 05:36:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:36:10,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:10,939 INFO L399 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-09-08 05:36:10,939 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash 204651284, now seen corresponding path program 1 times [2019-09-08 05:36:10,940 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:10,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:10,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:10,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:10,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:11,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:11,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:11,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:11,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:11,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:11,124 INFO L87 Difference]: Start difference. First operand 1825 states and 2486 transitions. Second operand 5 states. [2019-09-08 05:36:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:12,636 INFO L93 Difference]: Finished difference Result 4634 states and 6300 transitions. [2019-09-08 05:36:12,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 05:36:12,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-09-08 05:36:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:12,662 INFO L225 Difference]: With dead ends: 4634 [2019-09-08 05:36:12,663 INFO L226 Difference]: Without dead ends: 3988 [2019-09-08 05:36:12,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2019-09-08 05:36:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3957. [2019-09-08 05:36:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3957 states. [2019-09-08 05:36:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3957 states to 3957 states and 5379 transitions. [2019-09-08 05:36:12,903 INFO L78 Accepts]: Start accepts. Automaton has 3957 states and 5379 transitions. Word has length 191 [2019-09-08 05:36:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:12,903 INFO L475 AbstractCegarLoop]: Abstraction has 3957 states and 5379 transitions. [2019-09-08 05:36:12,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:12,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3957 states and 5379 transitions. [2019-09-08 05:36:12,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 05:36:12,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:12,916 INFO L399 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-09-08 05:36:12,917 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:12,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash 224988659, now seen corresponding path program 1 times [2019-09-08 05:36:12,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:12,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:13,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:13,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:13,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:13,193 INFO L87 Difference]: Start difference. First operand 3957 states and 5379 transitions. Second operand 7 states. [2019-09-08 05:36:15,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:15,515 INFO L93 Difference]: Finished difference Result 13336 states and 18632 transitions. [2019-09-08 05:36:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 05:36:15,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 191 [2019-09-08 05:36:15,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:15,595 INFO L225 Difference]: With dead ends: 13336 [2019-09-08 05:36:15,595 INFO L226 Difference]: Without dead ends: 10293 [2019-09-08 05:36:15,614 INFO L628 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-09-08 05:36:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10293 states. [2019-09-08 05:36:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10293 to 10271. [2019-09-08 05:36:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10271 states. [2019-09-08 05:36:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10271 states to 10271 states and 14191 transitions. [2019-09-08 05:36:16,153 INFO L78 Accepts]: Start accepts. Automaton has 10271 states and 14191 transitions. Word has length 191 [2019-09-08 05:36:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:16,154 INFO L475 AbstractCegarLoop]: Abstraction has 10271 states and 14191 transitions. [2019-09-08 05:36:16,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:36:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 10271 states and 14191 transitions. [2019-09-08 05:36:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 05:36:16,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:16,165 INFO L399 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-09-08 05:36:16,165 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash 10550669, now seen corresponding path program 1 times [2019-09-08 05:36:16,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:16,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:16,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:16,971 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:16,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:16,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 05:36:16,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 05:36:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 05:36:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-09-08 05:36:16,974 INFO L87 Difference]: Start difference. First operand 10271 states and 14191 transitions. Second operand 26 states. [2019-09-08 05:36:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:18,110 INFO L93 Difference]: Finished difference Result 19928 states and 27760 transitions. [2019-09-08 05:36:18,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 05:36:18,110 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 192 [2019-09-08 05:36:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:18,165 INFO L225 Difference]: With dead ends: 19928 [2019-09-08 05:36:18,165 INFO L226 Difference]: Without dead ends: 8778 [2019-09-08 05:36:18,210 INFO L628 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-09-08 05:36:18,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8778 states. [2019-09-08 05:36:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8778 to 8555. [2019-09-08 05:36:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8555 states. [2019-09-08 05:36:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8555 states to 8555 states and 11702 transitions. [2019-09-08 05:36:18,773 INFO L78 Accepts]: Start accepts. Automaton has 8555 states and 11702 transitions. Word has length 192 [2019-09-08 05:36:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:18,774 INFO L475 AbstractCegarLoop]: Abstraction has 8555 states and 11702 transitions. [2019-09-08 05:36:18,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 05:36:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 8555 states and 11702 transitions. [2019-09-08 05:36:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 05:36:18,784 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:18,784 INFO L399 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-09-08 05:36:18,785 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1712144114, now seen corresponding path program 1 times [2019-09-08 05:36:18,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:18,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:18,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 05:36:18,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 05:36:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 05:36:18,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:36:18,976 INFO L87 Difference]: Start difference. First operand 8555 states and 11702 transitions. Second operand 10 states. [2019-09-08 05:36:19,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:19,128 INFO L93 Difference]: Finished difference Result 8620 states and 11804 transitions. [2019-09-08 05:36:19,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:36:19,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 196 [2019-09-08 05:36:19,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:19,168 INFO L225 Difference]: With dead ends: 8620 [2019-09-08 05:36:19,168 INFO L226 Difference]: Without dead ends: 8545 [2019-09-08 05:36:19,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 05:36:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8545 states. [2019-09-08 05:36:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8545 to 8537. [2019-09-08 05:36:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8537 states. [2019-09-08 05:36:19,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8537 states to 8537 states and 11660 transitions. [2019-09-08 05:36:19,542 INFO L78 Accepts]: Start accepts. Automaton has 8537 states and 11660 transitions. Word has length 196 [2019-09-08 05:36:19,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:19,542 INFO L475 AbstractCegarLoop]: Abstraction has 8537 states and 11660 transitions. [2019-09-08 05:36:19,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 05:36:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 8537 states and 11660 transitions. [2019-09-08 05:36:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:36:19,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:19,553 INFO L399 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-09-08 05:36:19,553 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1889598004, now seen corresponding path program 1 times [2019-09-08 05:36:19,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:19,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:19,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:19,715 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:19,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:19,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:19,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:19,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:19,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:19,717 INFO L87 Difference]: Start difference. First operand 8537 states and 11660 transitions. Second operand 5 states. [2019-09-08 05:36:20,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:20,553 INFO L93 Difference]: Finished difference Result 16187 states and 21888 transitions. [2019-09-08 05:36:20,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:20,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-09-08 05:36:20,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:20,597 INFO L225 Difference]: With dead ends: 16187 [2019-09-08 05:36:20,598 INFO L226 Difference]: Without dead ends: 8726 [2019-09-08 05:36:20,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8726 states. [2019-09-08 05:36:20,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8726 to 8641. [2019-09-08 05:36:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8641 states. [2019-09-08 05:36:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8641 states to 8641 states and 11794 transitions. [2019-09-08 05:36:20,959 INFO L78 Accepts]: Start accepts. Automaton has 8641 states and 11794 transitions. Word has length 201 [2019-09-08 05:36:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:20,959 INFO L475 AbstractCegarLoop]: Abstraction has 8641 states and 11794 transitions. [2019-09-08 05:36:20,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8641 states and 11794 transitions. [2019-09-08 05:36:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 05:36:20,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:20,971 INFO L399 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-09-08 05:36:20,971 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1244172180, now seen corresponding path program 1 times [2019-09-08 05:36:20,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:20,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:20,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:20,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:21,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:21,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 05:36:21,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:36:21,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:36:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:36:21,199 INFO L87 Difference]: Start difference. First operand 8641 states and 11794 transitions. Second operand 11 states. [2019-09-08 05:36:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:21,698 INFO L93 Difference]: Finished difference Result 16228 states and 21857 transitions. [2019-09-08 05:36:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 05:36:21,700 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 201 [2019-09-08 05:36:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:21,738 INFO L225 Difference]: With dead ends: 16228 [2019-09-08 05:36:21,738 INFO L226 Difference]: Without dead ends: 8651 [2019-09-08 05:36:21,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-08 05:36:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8651 states. [2019-09-08 05:36:22,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8651 to 8603. [2019-09-08 05:36:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8603 states. [2019-09-08 05:36:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8603 states to 8603 states and 11712 transitions. [2019-09-08 05:36:22,249 INFO L78 Accepts]: Start accepts. Automaton has 8603 states and 11712 transitions. Word has length 201 [2019-09-08 05:36:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:22,249 INFO L475 AbstractCegarLoop]: Abstraction has 8603 states and 11712 transitions. [2019-09-08 05:36:22,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:36:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 8603 states and 11712 transitions. [2019-09-08 05:36:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 05:36:22,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:22,263 INFO L399 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, 1] [2019-09-08 05:36:22,263 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 77682263, now seen corresponding path program 1 times [2019-09-08 05:36:22,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:22,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:22,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:22,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:22,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 05:36:22,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 05:36:22,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 05:36:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 05:36:22,421 INFO L87 Difference]: Start difference. First operand 8603 states and 11712 transitions. Second operand 5 states. [2019-09-08 05:36:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:22,584 INFO L93 Difference]: Finished difference Result 13994 states and 18673 transitions. [2019-09-08 05:36:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 05:36:22,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-08 05:36:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:22,616 INFO L225 Difference]: With dead ends: 13994 [2019-09-08 05:36:22,616 INFO L226 Difference]: Without dead ends: 6972 [2019-09-08 05:36:22,631 INFO L628 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-09-08 05:36:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6972 states. [2019-09-08 05:36:22,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6972 to 6966. [2019-09-08 05:36:22,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-09-08 05:36:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 9439 transitions. [2019-09-08 05:36:22,906 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 9439 transitions. Word has length 203 [2019-09-08 05:36:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:22,907 INFO L475 AbstractCegarLoop]: Abstraction has 6966 states and 9439 transitions. [2019-09-08 05:36:22,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 05:36:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 9439 transitions. [2019-09-08 05:36:22,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 05:36:22,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:22,916 INFO L399 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-09-08 05:36:22,917 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2081172186, now seen corresponding path program 1 times [2019-09-08 05:36:22,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:22,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:22,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:22,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:22,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 05:36:23,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:23,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:36:23,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:36:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:36:23,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:36:23,155 INFO L87 Difference]: Start difference. First operand 6966 states and 9439 transitions. Second operand 6 states. [2019-09-08 05:36:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:24,639 INFO L93 Difference]: Finished difference Result 19532 states and 26225 transitions. [2019-09-08 05:36:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 05:36:24,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-09-08 05:36:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:24,699 INFO L225 Difference]: With dead ends: 19532 [2019-09-08 05:36:24,699 INFO L226 Difference]: Without dead ends: 13915 [2019-09-08 05:36:24,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 05:36:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2019-09-08 05:36:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 13781. [2019-09-08 05:36:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13781 states. [2019-09-08 05:36:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13781 states to 13781 states and 18691 transitions. [2019-09-08 05:36:25,277 INFO L78 Accepts]: Start accepts. Automaton has 13781 states and 18691 transitions. Word has length 202 [2019-09-08 05:36:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:25,278 INFO L475 AbstractCegarLoop]: Abstraction has 13781 states and 18691 transitions. [2019-09-08 05:36:25,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:36:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13781 states and 18691 transitions. [2019-09-08 05:36:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-08 05:36:25,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:25,294 INFO L399 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-09-08 05:36:25,294 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:25,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2073017152, now seen corresponding path program 1 times [2019-09-08 05:36:25,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:25,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:25,470 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:36:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:36:25,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:36:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:36:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:36:25,472 INFO L87 Difference]: Start difference. First operand 13781 states and 18691 transitions. Second operand 8 states. [2019-09-08 05:36:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:27,395 INFO L93 Difference]: Finished difference Result 40776 states and 55650 transitions. [2019-09-08 05:36:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 05:36:27,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-09-08 05:36:27,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:27,545 INFO L225 Difference]: With dead ends: 40776 [2019-09-08 05:36:27,545 INFO L226 Difference]: Without dead ends: 28418 [2019-09-08 05:36:27,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:36:27,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28418 states. [2019-09-08 05:36:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28418 to 28053. [2019-09-08 05:36:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28053 states. [2019-09-08 05:36:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28053 states to 28053 states and 38246 transitions. [2019-09-08 05:36:29,155 INFO L78 Accepts]: Start accepts. Automaton has 28053 states and 38246 transitions. Word has length 221 [2019-09-08 05:36:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:29,156 INFO L475 AbstractCegarLoop]: Abstraction has 28053 states and 38246 transitions. [2019-09-08 05:36:29,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:36:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 28053 states and 38246 transitions. [2019-09-08 05:36:29,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 05:36:29,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:29,190 INFO L399 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-09-08 05:36:29,190 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:29,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:29,190 INFO L82 PathProgramCache]: Analyzing trace with hash 348099570, now seen corresponding path program 1 times [2019-09-08 05:36:29,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:29,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:29,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:29,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:36:29,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:29,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-08 05:36:29,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 05:36:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 05:36:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-09-08 05:36:29,465 INFO L87 Difference]: Start difference. First operand 28053 states and 38246 transitions. Second operand 15 states. [2019-09-08 05:36:34,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:34,190 INFO L93 Difference]: Finished difference Result 45150 states and 60803 transitions. [2019-09-08 05:36:34,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 05:36:34,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 222 [2019-09-08 05:36:34,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:34,312 INFO L225 Difference]: With dead ends: 45150 [2019-09-08 05:36:34,313 INFO L226 Difference]: Without dead ends: 28284 [2019-09-08 05:36:34,353 INFO L628 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-09-08 05:36:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28284 states. [2019-09-08 05:36:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28284 to 27364. [2019-09-08 05:36:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27364 states. [2019-09-08 05:36:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27364 states to 27364 states and 37243 transitions. [2019-09-08 05:36:35,331 INFO L78 Accepts]: Start accepts. Automaton has 27364 states and 37243 transitions. Word has length 222 [2019-09-08 05:36:35,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:35,332 INFO L475 AbstractCegarLoop]: Abstraction has 27364 states and 37243 transitions. [2019-09-08 05:36:35,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 05:36:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 27364 states and 37243 transitions. [2019-09-08 05:36:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 05:36:35,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:35,366 INFO L399 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-09-08 05:36:35,367 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash 650820244, now seen corresponding path program 1 times [2019-09-08 05:36:35,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:35,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:35,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:35,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:35,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:36:35,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:35,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:35,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:35,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:35,553 INFO L87 Difference]: Start difference. First operand 27364 states and 37243 transitions. Second operand 7 states. [2019-09-08 05:36:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:41,829 INFO L93 Difference]: Finished difference Result 78245 states and 106527 transitions. [2019-09-08 05:36:41,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:36:41,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 222 [2019-09-08 05:36:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:42,016 INFO L225 Difference]: With dead ends: 78245 [2019-09-08 05:36:42,016 INFO L226 Difference]: Without dead ends: 56102 [2019-09-08 05:36:42,063 INFO L628 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-09-08 05:36:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56102 states. [2019-09-08 05:36:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56102 to 54219. [2019-09-08 05:36:45,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54219 states. [2019-09-08 05:36:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54219 states to 54219 states and 73848 transitions. [2019-09-08 05:36:45,424 INFO L78 Accepts]: Start accepts. Automaton has 54219 states and 73848 transitions. Word has length 222 [2019-09-08 05:36:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:45,425 INFO L475 AbstractCegarLoop]: Abstraction has 54219 states and 73848 transitions. [2019-09-08 05:36:45,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:36:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 54219 states and 73848 transitions. [2019-09-08 05:36:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 05:36:45,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:45,459 INFO L399 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-09-08 05:36:45,459 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -6611154, now seen corresponding path program 2 times [2019-09-08 05:36:45,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:45,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:45,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:36:45,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 05:36:45,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:36:45,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:36:45,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 05:36:46,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 05:36:46,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 05:36:46,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 2871 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 05:36:46,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:36:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:36:46,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:36:46,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2019-09-08 05:36:46,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 05:36:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 05:36:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-09-08 05:36:46,560 INFO L87 Difference]: Start difference. First operand 54219 states and 73848 transitions. Second operand 18 states. [2019-09-08 05:36:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:36:50,960 INFO L93 Difference]: Finished difference Result 109046 states and 148766 transitions. [2019-09-08 05:36:50,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 05:36:50,960 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 222 [2019-09-08 05:36:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:36:51,355 INFO L225 Difference]: With dead ends: 109046 [2019-09-08 05:36:51,355 INFO L226 Difference]: Without dead ends: 54879 [2019-09-08 05:36:51,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 05:36:51,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54879 states. [2019-09-08 05:36:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54879 to 54485. [2019-09-08 05:36:57,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54485 states. [2019-09-08 05:36:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54485 states to 54485 states and 74188 transitions. [2019-09-08 05:36:57,566 INFO L78 Accepts]: Start accepts. Automaton has 54485 states and 74188 transitions. Word has length 222 [2019-09-08 05:36:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:36:57,567 INFO L475 AbstractCegarLoop]: Abstraction has 54485 states and 74188 transitions. [2019-09-08 05:36:57,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 05:36:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 54485 states and 74188 transitions. [2019-09-08 05:36:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 05:36:57,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:36:57,638 INFO L399 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-09-08 05:36:57,638 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:36:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:36:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1836734643, now seen corresponding path program 1 times [2019-09-08 05:36:57,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:36:57,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:36:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:57,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 05:36:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:36:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:36:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:36:57,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:36:57,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 05:36:57,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 05:36:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 05:36:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 05:36:57,861 INFO L87 Difference]: Start difference. First operand 54485 states and 74188 transitions. Second operand 7 states. [2019-09-08 05:37:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:08,552 INFO L93 Difference]: Finished difference Result 151589 states and 206079 transitions. [2019-09-08 05:37:08,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 05:37:08,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 224 [2019-09-08 05:37:08,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:09,107 INFO L225 Difference]: With dead ends: 151589 [2019-09-08 05:37:09,110 INFO L226 Difference]: Without dead ends: 110385 [2019-09-08 05:37:09,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 05:37:09,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110385 states. [2019-09-08 05:37:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110385 to 106488. [2019-09-08 05:37:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106488 states. [2019-09-08 05:37:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106488 states to 106488 states and 144849 transitions. [2019-09-08 05:37:13,240 INFO L78 Accepts]: Start accepts. Automaton has 106488 states and 144849 transitions. Word has length 224 [2019-09-08 05:37:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:13,241 INFO L475 AbstractCegarLoop]: Abstraction has 106488 states and 144849 transitions. [2019-09-08 05:37:13,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 05:37:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 106488 states and 144849 transitions. [2019-09-08 05:37:13,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 05:37:13,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:13,344 INFO L399 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-09-08 05:37:13,344 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:13,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:13,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1031736719, now seen corresponding path program 1 times [2019-09-08 05:37:13,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:13,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:13,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:13,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 05:37:14,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 05:37:14,340 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 05:37:14,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:15,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 2873 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 05:37:15,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 05:37:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 05:37:15,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 05:37:15,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-08 05:37:15,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 05:37:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 05:37:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 05:37:15,293 INFO L87 Difference]: Start difference. First operand 106488 states and 144849 transitions. Second operand 11 states. [2019-09-08 05:37:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:22,972 INFO L93 Difference]: Finished difference Result 223546 states and 300653 transitions. [2019-09-08 05:37:22,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:37:22,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2019-09-08 05:37:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:23,513 INFO L225 Difference]: With dead ends: 223546 [2019-09-08 05:37:23,513 INFO L226 Difference]: Without dead ends: 122587 [2019-09-08 05:37:23,701 INFO L628 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-09-08 05:37:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122587 states. [2019-09-08 05:37:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122587 to 120778. [2019-09-08 05:37:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120778 states. [2019-09-08 05:37:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120778 states to 120778 states and 161555 transitions. [2019-09-08 05:37:33,286 INFO L78 Accepts]: Start accepts. Automaton has 120778 states and 161555 transitions. Word has length 224 [2019-09-08 05:37:33,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:33,287 INFO L475 AbstractCegarLoop]: Abstraction has 120778 states and 161555 transitions. [2019-09-08 05:37:33,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 05:37:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 120778 states and 161555 transitions. [2019-09-08 05:37:33,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-08 05:37:33,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:33,362 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:37:33,362 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:33,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:33,362 INFO L82 PathProgramCache]: Analyzing trace with hash -2052879992, now seen corresponding path program 1 times [2019-09-08 05:37:33,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:33,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:33,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:33,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 05:37:33,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:33,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:37:33,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:37:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:37:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:37:33,511 INFO L87 Difference]: Start difference. First operand 120778 states and 161555 transitions. Second operand 3 states. [2019-09-08 05:37:37,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:37,388 INFO L93 Difference]: Finished difference Result 245181 states and 331021 transitions. [2019-09-08 05:37:37,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:37:37,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-09-08 05:37:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:37,896 INFO L225 Difference]: With dead ends: 245181 [2019-09-08 05:37:37,896 INFO L226 Difference]: Without dead ends: 124714 [2019-09-08 05:37:38,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:37:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124714 states. [2019-09-08 05:37:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124714 to 124666. [2019-09-08 05:37:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124666 states. [2019-09-08 05:37:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124666 states to 124666 states and 169715 transitions. [2019-09-08 05:37:43,357 INFO L78 Accepts]: Start accepts. Automaton has 124666 states and 169715 transitions. Word has length 251 [2019-09-08 05:37:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:37:43,358 INFO L475 AbstractCegarLoop]: Abstraction has 124666 states and 169715 transitions. [2019-09-08 05:37:43,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:37:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 124666 states and 169715 transitions. [2019-09-08 05:37:43,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 05:37:43,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:37:43,461 INFO L399 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] [2019-09-08 05:37:43,461 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:37:43,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:37:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash 828724958, now seen corresponding path program 1 times [2019-09-08 05:37:43,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:37:43,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:37:43,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:43,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:37:43,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:37:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:37:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 05:37:43,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:37:43,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:37:43,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:37:43,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:37:43,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:37:43,676 INFO L87 Difference]: Start difference. First operand 124666 states and 169715 transitions. Second operand 8 states. [2019-09-08 05:37:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:37:57,433 INFO L93 Difference]: Finished difference Result 379328 states and 528999 transitions. [2019-09-08 05:37:57,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:37:57,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 253 [2019-09-08 05:37:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:37:58,302 INFO L225 Difference]: With dead ends: 379328 [2019-09-08 05:37:58,302 INFO L226 Difference]: Without dead ends: 254973 [2019-09-08 05:37:58,534 INFO L628 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-09-08 05:37:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254973 states. [2019-09-08 05:38:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254973 to 200321. [2019-09-08 05:38:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200321 states. [2019-09-08 05:38:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200321 states to 200321 states and 282712 transitions. [2019-09-08 05:38:12,595 INFO L78 Accepts]: Start accepts. Automaton has 200321 states and 282712 transitions. Word has length 253 [2019-09-08 05:38:12,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:38:12,596 INFO L475 AbstractCegarLoop]: Abstraction has 200321 states and 282712 transitions. [2019-09-08 05:38:12,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:38:12,596 INFO L276 IsEmpty]: Start isEmpty. Operand 200321 states and 282712 transitions. [2019-09-08 05:38:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 05:38:12,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:38:12,887 INFO L399 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, 1] [2019-09-08 05:38:12,887 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:38:12,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:38:12,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1680189258, now seen corresponding path program 1 times [2019-09-08 05:38:12,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:38:12,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:38:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:12,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:38:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:38:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:38:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 05:38:13,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:38:13,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:38:13,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:38:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:38:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:38:13,134 INFO L87 Difference]: Start difference. First operand 200321 states and 282712 transitions. Second operand 8 states. [2019-09-08 05:38:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:38:37,249 INFO L93 Difference]: Finished difference Result 612725 states and 889974 transitions. [2019-09-08 05:38:37,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:38:37,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 259 [2019-09-08 05:38:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:38:38,874 INFO L225 Difference]: With dead ends: 612725 [2019-09-08 05:38:38,874 INFO L226 Difference]: Without dead ends: 412715 [2019-09-08 05:38:39,324 INFO L628 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-09-08 05:38:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412715 states. [2019-09-08 05:39:04,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412715 to 300238. [2019-09-08 05:39:04,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300238 states. [2019-09-08 05:39:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300238 states to 300238 states and 447467 transitions. [2019-09-08 05:39:05,588 INFO L78 Accepts]: Start accepts. Automaton has 300238 states and 447467 transitions. Word has length 259 [2019-09-08 05:39:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:05,589 INFO L475 AbstractCegarLoop]: Abstraction has 300238 states and 447467 transitions. [2019-09-08 05:39:05,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:39:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 300238 states and 447467 transitions. [2019-09-08 05:39:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 05:39:14,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:39:14,011 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:39:14,011 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:39:14,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:39:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash -252926818, now seen corresponding path program 1 times [2019-09-08 05:39:14,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:39:14,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:39:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:14,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:39:14,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:39:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:39:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:39:14,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:39:14,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:39:14,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:39:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:39:14,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:14,136 INFO L87 Difference]: Start difference. First operand 300238 states and 447467 transitions. Second operand 3 states. [2019-09-08 05:39:34,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:39:34,048 INFO L93 Difference]: Finished difference Result 629445 states and 976429 transitions. [2019-09-08 05:39:34,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:39:34,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 05:39:34,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:39:35,992 INFO L225 Difference]: With dead ends: 629445 [2019-09-08 05:39:35,992 INFO L226 Difference]: Without dead ends: 329518 [2019-09-08 05:39:36,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:39:36,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329518 states. [2019-09-08 05:39:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329518 to 316071. [2019-09-08 05:39:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316071 states. [2019-09-08 05:39:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316071 states to 316071 states and 511124 transitions. [2019-09-08 05:39:55,975 INFO L78 Accepts]: Start accepts. Automaton has 316071 states and 511124 transitions. Word has length 241 [2019-09-08 05:39:55,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:39:55,975 INFO L475 AbstractCegarLoop]: Abstraction has 316071 states and 511124 transitions. [2019-09-08 05:39:55,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 05:39:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 316071 states and 511124 transitions. [2019-09-08 05:40:06,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-09-08 05:40:06,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:40:06,019 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:40:06,019 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:40:06,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:40:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1227484096, now seen corresponding path program 1 times [2019-09-08 05:40:06,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:40:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:40:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:06,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:40:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:40:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:40:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 05:40:06,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:40:06,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 05:40:06,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 05:40:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 05:40:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:40:06,203 INFO L87 Difference]: Start difference. First operand 316071 states and 511124 transitions. Second operand 8 states. [2019-09-08 05:40:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:40:43,808 INFO L93 Difference]: Finished difference Result 971783 states and 1660122 transitions. [2019-09-08 05:40:43,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 05:40:43,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 242 [2019-09-08 05:40:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:40:57,415 INFO L225 Difference]: With dead ends: 971783 [2019-09-08 05:40:57,416 INFO L226 Difference]: Without dead ends: 656023 [2019-09-08 05:40:58,173 INFO L628 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-09-08 05:40:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656023 states. [2019-09-08 05:41:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656023 to 514180. [2019-09-08 05:41:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514180 states. [2019-09-08 05:41:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514180 states to 514180 states and 913769 transitions. [2019-09-08 05:41:51,611 INFO L78 Accepts]: Start accepts. Automaton has 514180 states and 913769 transitions. Word has length 242 [2019-09-08 05:41:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:41:51,611 INFO L475 AbstractCegarLoop]: Abstraction has 514180 states and 913769 transitions. [2019-09-08 05:41:51,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 05:41:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 514180 states and 913769 transitions. [2019-09-08 05:42:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 05:42:04,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:42:04,432 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:42:04,432 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:42:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:42:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash -301580601, now seen corresponding path program 1 times [2019-09-08 05:42:04,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:42:04,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:42:04,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:04,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:42:04,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:42:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:42:04,584 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:42:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:42:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 05:42:04,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 05:42:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 05:42:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 05:42:04,586 INFO L87 Difference]: Start difference. First operand 514180 states and 913769 transitions. Second operand 6 states. [2019-09-08 05:42:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:42:43,317 INFO L93 Difference]: Finished difference Result 1029489 states and 1851481 transitions. [2019-09-08 05:42:43,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 05:42:43,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 05:42:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:42:46,368 INFO L225 Difference]: With dead ends: 1029489 [2019-09-08 05:42:46,368 INFO L226 Difference]: Without dead ends: 515620 [2019-09-08 05:42:47,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 05:42:47,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515620 states. [2019-09-08 05:43:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515620 to 475541. [2019-09-08 05:43:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475541 states. [2019-09-08 05:43:42,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475541 states to 475541 states and 846509 transitions. [2019-09-08 05:43:42,170 INFO L78 Accepts]: Start accepts. Automaton has 475541 states and 846509 transitions. Word has length 240 [2019-09-08 05:43:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 05:43:42,171 INFO L475 AbstractCegarLoop]: Abstraction has 475541 states and 846509 transitions. [2019-09-08 05:43:42,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 05:43:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 475541 states and 846509 transitions. [2019-09-08 05:43:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 05:43:59,032 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 05:43:59,032 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 05:43:59,032 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 05:43:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 05:43:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash 332558698, now seen corresponding path program 1 times [2019-09-08 05:43:59,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 05:43:59,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 05:43:59,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:59,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 05:43:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 05:43:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 05:43:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 05:43:59,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 05:43:59,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 05:43:59,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 05:43:59,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 05:43:59,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:43:59,165 INFO L87 Difference]: Start difference. First operand 475541 states and 846509 transitions. Second operand 3 states. [2019-09-08 05:44:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 05:44:43,796 INFO L93 Difference]: Finished difference Result 1063003 states and 2021433 transitions. [2019-09-08 05:44:43,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 05:44:43,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 05:44:43,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 05:44:47,462 INFO L225 Difference]: With dead ends: 1063003 [2019-09-08 05:44:47,462 INFO L226 Difference]: Without dead ends: 587773 [2019-09-08 05:44:48,524 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 05:44:48,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587773 states.