-
Notifications
You must be signed in to change notification settings - Fork 122
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #446 from yavivanov/pr-plainOpenGoals-fix
Solving the second issue of PR#394 without plainOpenGoals
- Loading branch information
Showing
6 changed files
with
182 additions
and
4 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
69 changes: 69 additions & 0 deletions
69
case-studies-regression/fast-tests/regression/trace/issue446-1_analyzed.spthy
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,69 @@ | ||
theory lemma_falsified_verified begin | ||
|
||
// Function signature and definition of the equational theory E | ||
|
||
functions: fst/1, pair/2, snd/1 | ||
equations: fst(<x.1, x.2>) = x.1, snd(<x.1, x.2>) = x.2 | ||
|
||
|
||
|
||
|
||
|
||
rule (modulo E) A: | ||
[ ] --[ A( 'x' ) ]-> [ ] | ||
|
||
/* has exactly the trivial AC variant */ | ||
|
||
lemma lemma_verified: | ||
all-traces "∀ x #i. (A( x ) @ #i) ⇒ (A( x ) @ #i)" | ||
/* | ||
guarded formula characterizing all counter-examples: | ||
"∃ x #i. (A( x ) @ #i) ∧ ¬(A( x ) @ #i)" | ||
*/ | ||
simplify | ||
by contradiction /* from formulas */ | ||
|
||
lemma lemma_falsified: | ||
all-traces "∀ x #i. (A( x ) @ #i) ⇒ (A( x ) @ #i)" | ||
/* | ||
guarded formula characterizing all counter-examples: | ||
"∃ x #i. (A( x ) @ #i) ∧ ¬(A( x ) @ #i)" | ||
*/ | ||
simplify | ||
by contradiction /* from formulas */ | ||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
/* All wellformedness checks were successful. */ | ||
|
||
/* | ||
Generated from: | ||
Tamarin version 1.9.0 | ||
Maude version 3.2.2 | ||
Git revision: 2023bf45660993c250f71bea8f123d870bfb3e82 (with uncommited changes), branch: pr-plainOpenGoals-fix | ||
Compiled at: 2023-11-21 21:42:44.712168244 UTC | ||
*/ | ||
|
||
end | ||
/* Output | ||
maude tool: 'maude' | ||
checking version: 3.2.2. OK. | ||
checking installation: OK. | ||
|
||
============================================================================== | ||
summary of summaries: | ||
|
||
analyzed: examples/regression/trace/issue446-1.spthy | ||
|
||
output: examples/regression/trace/issue446-1.spthy.tmp | ||
processing time: 0.05s | ||
|
||
lemma_verified (all-traces): verified (2 steps) | ||
lemma_falsified (all-traces): verified (2 steps) | ||
|
||
============================================================================== | ||
*/ |
60 changes: 60 additions & 0 deletions
60
case-studies-regression/fast-tests/regression/trace/issue446-2_analyzed.spthy
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
theory MinValueEq begin | ||
|
||
// Function signature and definition of the equational theory E | ||
|
||
functions: fst/1, pair/2, snd/1 | ||
equations: fst(<x.1, x.2>) = x.1, snd(<x.1, x.2>) = x.2 | ||
|
||
|
||
|
||
|
||
|
||
rule (modulo E) AttackerMsg: | ||
[ In( x ) ] --[ Value( x ) ]-> [ ] | ||
|
||
/* has exactly the trivial AC variant */ | ||
|
||
lemma WrongEquality: | ||
all-traces | ||
"∀ a b #i #j. ((Value( a ) @ #i) ∧ (Value( b ) @ #j)) ⇒ (a = b)" | ||
/* | ||
guarded formula characterizing all counter-examples: | ||
"∃ a b #i #j. (Value( a ) @ #i) ∧ (Value( b ) @ #j) ∧ ¬(a = b)" | ||
*/ | ||
simplify | ||
SOLVED // trace found | ||
|
||
|
||
|
||
|
||
|
||
|
||
|
||
/* All wellformedness checks were successful. */ | ||
|
||
/* | ||
Generated from: | ||
Tamarin version 1.9.0 | ||
Maude version 3.2.2 | ||
Git revision: 2023bf45660993c250f71bea8f123d870bfb3e82 (with uncommited changes), branch: pr-plainOpenGoals-fix | ||
Compiled at: 2023-11-21 21:42:44.712168244 UTC | ||
*/ | ||
|
||
end | ||
/* Output | ||
maude tool: 'maude' | ||
checking version: 3.2.2. OK. | ||
checking installation: OK. | ||
|
||
============================================================================== | ||
summary of summaries: | ||
|
||
analyzed: examples/regression/trace/issue446-2.spthy | ||
|
||
output: examples/regression/trace/issue446-2.spthy.tmp | ||
processing time: 0.06s | ||
|
||
WrongEquality (all-traces): falsified - found trace (2 steps) | ||
|
||
============================================================================== | ||
*/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,25 @@ | ||
theory lemma_falsified_verified | ||
begin | ||
|
||
/* | ||
* Date: November 2021 | ||
* Comment: Minimal example for a missing check if | ||
* 'SOLVED' is present with a non-empty but incomplete proof. | ||
*/ | ||
|
||
rule A: | ||
[ ] | ||
--[ A('x')]-> | ||
[ ] | ||
|
||
lemma lemma_verified: | ||
all-traces | ||
"All x #i. A(x)@i ==> A(x)@i" | ||
|
||
lemma lemma_falsified: | ||
all-traces | ||
"All x #i. A(x)@i ==> A(x)@i" | ||
simplify | ||
SOLVED | ||
|
||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,20 @@ | ||
theory MinValueEq | ||
begin | ||
|
||
/* | ||
* Author: Philip Lukert | ||
* Date: November 2021 | ||
* Comment: minimal counterexample for issue 329 | ||
*/ | ||
|
||
rule AttackerMsg: | ||
[ In(x) ] | ||
--[ Value(x) ]-> | ||
[ ] | ||
|
||
// should fail | ||
lemma WrongEquality: | ||
"All a b #i #j. Value(a)@i & Value(b)@j ==> a=b" | ||
|
||
|
||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters