About the Execution of GreatSPN+red for ShieldIIPt-PT-003B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 874.619 | 15988.00 | 33039.00 | 78.20 | FTFTFFTFFFFTTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758300223.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPt-PT-003B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758300223
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-003B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716926590058
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 20:03:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 20:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:03:11] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-28 20:03:11] [INFO ] Transformed 213 places.
[2024-05-28 20:03:11] [INFO ] Transformed 198 transitions.
[2024-05-28 20:03:11] [INFO ] Found NUPN structural information;
[2024-05-28 20:03:11] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1479 ms. (27 steps per ms) remains 6/16 properties
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 289 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1053 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
// Phase 1: matrix 198 rows 213 cols
[2024-05-28 20:03:12] [INFO ] Computed 28 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 143/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem ShieldIIPt-PT-003B-ReachabilityFireability-2024-02 is UNSAT
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ShieldIIPt-PT-003B-ReachabilityFireability-2024-04 is UNSAT
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 70/213 variables, 28/171 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 70/241 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 198/411 variables, 213/454 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 0/454 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 454 constraints, problems are : Problem set: 2 solved, 4 unsolved in 644 ms.
Refiners :[Domain max(s): 213/213 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 111/111 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem ShieldIIPt-PT-003B-ReachabilityFireability-2024-03 is UNSAT
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem ShieldIIPt-PT-003B-ReachabilityFireability-2024-14 is UNSAT
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 102/213 variables, 28/139 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/213 variables, 102/241 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 15 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/213 variables, 7/248 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 2 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 4/252 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/252 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 198/411 variables, 213/465 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 2/467 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/467 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/467 constraints. Problems are: Problem set: 4 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 467 constraints, problems are : Problem set: 4 solved, 2 unsolved in 989 ms.
Refiners :[Domain max(s): 213/213 constraints, Positive P Invariants (semi-flows): 28/28 constraints, State Equation: 213/213 constraints, PredecessorRefiner: 2/6 constraints, Known Traps: 11/11 constraints]
After SMT, in 1745ms problems are : Problem set: 4 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 343 ms.
Support contains 50 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 198/198 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 213 transition count 175
Reduce places removed 23 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 29 rules applied. Total rules applied 52 place count 190 transition count 169
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 58 place count 184 transition count 169
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 58 place count 184 transition count 157
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 82 place count 172 transition count 157
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 96 place count 158 transition count 143
Iterating global reduction 3 with 14 rules applied. Total rules applied 110 place count 158 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 110 place count 158 transition count 141
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 156 transition count 141
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 182 place count 122 transition count 107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 186 place count 120 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 120 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 190 place count 118 transition count 105
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 118 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 193 place count 117 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 116 transition count 104
Applied a total of 194 rules in 75 ms. Remains 116 /213 variables (removed 97) and now considering 104/198 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 116/213 places, 104/198 transitions.
RANDOM walk for 40000 steps (8 resets) in 773 ms. (51 steps per ms) remains 1/2 properties
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
// Phase 1: matrix 104 rows 116 cols
[2024-05-28 20:03:15] [INFO ] Computed 27 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/91 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/104 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 101/205 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/219 variables, 11/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/220 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/91 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/104 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 101/205 variables, 104/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 14/219 variables, 11/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/220 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/220 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 34 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 104/104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 101
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 113 transition count 98
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 110 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 108 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 108 transition count 96
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 100 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 97 transition count 89
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 97 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 96 transition count 88
Applied a total of 41 rules in 22 ms. Remains 96 /116 variables (removed 20) and now considering 88/104 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 96/116 places, 88/104 transitions.
RANDOM walk for 40000 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1788082 steps, run timeout after 3001 ms. (steps per millisecond=595 ) properties seen :0 out of 1
Probabilistic random walk after 1788082 steps, saw 967686 distinct states, run finished after 3004 ms. (steps per millisecond=595 ) properties seen :0
// Phase 1: matrix 88 rows 96 cols
[2024-05-28 20:03:18] [INFO ] Computed 27 invariants in 2 ms
[2024-05-28 20:03:18] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/76 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/87 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/174 variables, 87/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/184 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 4/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/184 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 128 constraints, problems are : Problem set: 0 solved, 1 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/76 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/87 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:03:18] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 87/174 variables, 87/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/184 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/184 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/184 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/184 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 34 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-28 20:03:19] [INFO ] Invariant cache hit.
[2024-05-28 20:03:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-28 20:03:19] [INFO ] Invariant cache hit.
[2024-05-28 20:03:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-28 20:03:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-28 20:03:19] [INFO ] Redundant transitions in 2 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-28 20:03:19] [INFO ] Invariant cache hit.
[2024-05-28 20:03:19] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 3/96 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:03:19] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-28 20:03:20] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 88/184 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (OVERLAPS) 0/184 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 137 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2653 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 3/96 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 88/184 variables, 96/132 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 85/222 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-28 20:03:22] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (OVERLAPS) 0/184 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 223 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2684 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, State Equation: 96/96 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 10/10 constraints]
After SMT, in 5353ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 5354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5496 ms. Remains : 96/96 places, 88/88 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 88
Applied a total of 1 rules in 9 ms. Remains 96 /96 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 96 cols
[2024-05-28 20:03:24] [INFO ] Computed 27 invariants in 1 ms
[2024-05-28 20:03:24] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 20:03:24] [INFO ] [Nat]Absence check using 27 positive place invariants in 3 ms returned sat
[2024-05-28 20:03:24] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 20:03:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:03:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
TRAPS : Iteration 1
[2024-05-28 20:03:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:03:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 2
[2024-05-28 20:03:25] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 20:03:25] [INFO ] After 310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 369 ms.
[2024-05-28 20:03:25] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-28 20:03:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 88 transitions and 290 arcs took 3 ms.
[2024-05-28 20:03:25] [INFO ] Flatten gal took : 29 ms
Total runtime 14089 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldIIPt-PT-003B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 96
TRANSITIONS: 88
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.001s]
SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 663
MODEL NAME: /home/mcc/execution/407/model
96 places, 88 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPt-PT-003B-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716926606046
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-003B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPt-PT-003B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683758300223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003B.tgz
mv ShieldIIPt-PT-003B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;