mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-28 11:25:51 +00:00
Code Activity

fix build warnings

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2018-04-14 08:27:40 -07:00
parent 56827d5725
commit d939c05e72
2 changed files with 12 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/muz/base/dl_util.cpp
View file

@ -622,7 +622,7 @@ namespace datalog {
}
bool string_to_uint64(const char * s, uint64_t & res) {
#if _WINDOWS
#if 1
int converted = sscanf_s(s, "%I64u", &res);
#else
int converted = sscanf(s, "%llu", &res);

20
src/smt/theory_str.cpp
View file

@ -10130,10 +10130,11 @@ namespace smt {
// increment LengthAttemptCount
regex_inc_counter(regex_length_attempt_count, re);
{
unsigned v = regex_get_counter(regex_length_attempt_count, re);
TRACE("str", tout << "length attempt count for " << mk_pp(re, m) << " is " << v << std::endl;);
}
TRACE("str",
{
unsigned v = regex_get_counter(regex_length_attempt_count, re);
tout << "length attempt count for " << mk_pp(re, m) << " is " << v << std::endl;
});
continue;
}
@ -10541,11 +10542,12 @@ namespace smt {
continue;
}
{
unsigned v = regex_get_counter(regex_length_attempt_count, aut.get_regex_term());
TRACE("str", tout << "length attempt count of " << mk_pp(aut.get_regex_term(), m) << " is " << v
<< ", threshold is " << m_params.m_RegexAutomata_LengthAttemptThreshold << std::endl;);
}
TRACE("str",
{
unsigned v = regex_get_counter(regex_length_attempt_count, aut.get_regex_term());
tout << "length attempt count of " << mk_pp(aut.get_regex_term(), m) << " is " << v
<< ", threshold is " << m_params.m_RegexAutomata_LengthAttemptThreshold << std::endl;
});
if (regex_get_counter(regex_length_attempt_count, aut.get_regex_term()) >= m_params.m_RegexAutomata_LengthAttemptThreshold) {
unsigned intersectionDifficulty = estimate_automata_intersection_difficulty(aut_inter, aut.get_automaton());