|Anonymous | Login | Signup for a new account||2019-05-19 21:30 CEST|
|Main | My View | View Issues | Change Log | Roadmap | Repositories|
|View Issue Details|
|ID||Project||Category||View Status||Date Submitted||Last Update|
|0002329||Frama-C||Plug-in > wp||public||2017-10-09 17:15||2017-10-12 10:21|
|Platform||Phosphorus-20170501||OS||OS Version||xubuntu 17.04|
|Product Version||Frama-C 15-Phosphorus|
|Target Version||Fixed in Version|
|Summary||0002329: suggest unique term normalization for lemmas and goals|
|Description||Running "frama-c -wp -wp-prop g aaa.c" on the attached file fails to prove the assertion "g", although it obviously follows from "f" by applying lemma "lem". One reason for that is of course the inherent incompleteness of SMT provers like Alt-Ergo and Cvc4. However, another reason is that Frama-C's term normalization(1) swaps some arguments of "+", and|
(2) performs swaps in the lemma that differ from those performed in the goal.
As a result, in the attached mlw file,
"(L_Foo(a,b+c)=true) -> (L_Bar(a,c+d)=true)"
appears in the lemma, while "(L_Foo(a,i_1+i_2)=true) -> (L_Bar(a,i+i_1)=true)" appears in the goal. The latter is equivalent to
"(L_Foo(a,c+b)=true) -> (L_Bar(a,d+c)=true)"
when expressed in a notation closer to the source-code. Variable "c" is common to L_Foo and L_Bar; note its different positions in the lemma vs. in the goal.
If the goal is changed to "(L_Foo(a,i_2+i_1)=true) -> (L_Bar(a,i_1+i)=true)", it syntactically matches the lemma, and Alt-Ergo proves it in a few milliseconds.
Unless there are good reasons to swap the arguments of "+", they should be kept in their source-code order; this way, the user has a chance to control what is given to the provers.
However, if there *are* good reasons to include argument swapping in term normalization, it should be performed in the same way both in lemmas and in goals.
A possible explanation for the above behavior of Frama-C is that, for some
reason, source-code variable names are transformed to unrelated internal names
in goals, but not in lemmas, and that term normalization just orders arguments
of commutative functions lexicographically (cf. issue 0002100).
|Tags||No tags attached.|
|Attached Files|| aaa.c [^] (378 bytes) 2017-10-09 17:15 [Show Content]
main_assert_g_Alt-Ergo.mlw [^] (32,115 bytes) 2017-10-09 17:17
|On second thought, I guess argument reordering is done as part of Qed simplification, and it *does* make sense: goals like "p(a+b) ==> p(b+a)" can be proven already by Qed, thanks to reordering.|
|2017-10-09 17:15||Jochen||New Issue|
|2017-10-09 17:15||Jochen||Status||new => assigned|
|2017-10-09 17:15||Jochen||Assigned To||=> correnson|
|2017-10-09 17:15||Jochen||File Added: aaa.c|
|2017-10-09 17:17||Jochen||File Added: main_assert_g_Alt-Ergo.mlw|
|2017-10-12 10:21||Jochen||Note Added: 0006467|
|Copyright © 2000 - 2019 MantisBT Team|