About the Execution of GreatSPN+red for RingSingleMessageInMbox-PT-d0m010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 767.880 | 23994.00 | 73040.00 | 59.90 | FTFTTTFTTFTTTFFF | 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.r333-tall-171679077500018.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 RingSingleMessageInMbox-PT-d0m010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077500018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 23:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 23:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 23:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716792033104
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:40:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:40:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:40:34] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-05-27 06:40:34] [INFO ] Transformed 385 places.
[2024-05-27 06:40:34] [INFO ] Transformed 59 transitions.
[2024-05-27 06:40:34] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Support contains 44 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Applied a total of 2 rules in 15 ms. Remains 54 /56 variables (removed 2) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 54 cols
[2024-05-27 06:40:34] [INFO ] Computed 3 invariants in 9 ms
[2024-05-27 06:40:34] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-27 06:40:34] [INFO ] Invariant cache hit.
[2024-05-27 06:40:34] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:40:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 58 sub problems to find dead transitions.
[2024-05-27 06:40:34] [INFO ] Invariant cache hit.
[2024-05-27 06:40:34] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/54 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 4 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 0/113 variables, 0/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 84 constraints, problems are : Problem set: 5 solved, 53 unsolved in 902 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 2/51 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 3/54 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 59/113 variables, 54/57 constraints. Problems are: Problem set: 5 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 27/84 constraints. Problems are: Problem set: 5 solved, 53 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 53/137 constraints. Problems are: Problem set: 7 solved, 51 unsolved
[2024-05-27 06:40:36] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 8 ms to minimize.
[2024-05-27 06:40:36] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/139 constraints. Problems are: Problem set: 7 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 139 constraints, problems are : Problem set: 7 solved, 51 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 53/58 constraints, Known Traps: 2/2 constraints]
After SMT, in 3061ms problems are : Problem set: 7 solved, 51 unsolved
Search for dead transitions found 7 dead transitions in 3074ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/56 places, 52/59 transitions.
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 51
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 2 rules in 2 ms. Remains 52 /54 variables (removed 2) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 52 cols
[2024-05-27 06:40:37] [INFO ] Computed 7 invariants in 1 ms
[2024-05-27 06:40:38] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-27 06:40:38] [INFO ] Invariant cache hit.
[2024-05-27 06:40:38] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 06:40:38] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 52/56 places, 51/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3519 ms. Remains : 52/56 places, 51/59 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Support contains 39 out of 48 places after structural reductions.
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:40:38] [INFO ] Flatten gal took : 24 ms
[2024-05-27 06:40:38] [INFO ] Flatten gal took : 11 ms
[2024-05-27 06:40:38] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 38 out of 48 places (down from 39) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 44 to 40
RANDOM walk for 40000 steps (8618 resets) in 1328 ms. (30 steps per ms) remains 13/40 properties
BEST_FIRST walk for 40002 steps (3727 resets) in 352 ms. (113 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40002 steps (3768 resets) in 267 ms. (149 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1970 resets) in 200 ms. (199 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40003 steps (3740 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (3865 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (2083 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (2039 resets) in 144 ms. (275 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (2035 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1951 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 06:40:39] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 06:40:39] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 1 (OVERLAPS) 17/31 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 8/39 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 43/82 variables, 39/42 constraints. Problems are: Problem set: 2 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 16/58 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/99 variables, 9/67 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 8/75 constraints. Problems are: Problem set: 3 solved, 6 unsolved
[2024-05-27 06:40:39] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-27 06:40:39] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 2/77 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/99 variables, 0/77 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 77 constraints, problems are : Problem set: 3 solved, 6 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 9/37 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 39/76 variables, 37/40 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 12/52 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/53 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/53 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 22/98 variables, 10/63 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 12/75 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 5/80 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 2/82 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/82 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/99 variables, 1/83 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/99 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/99 variables, 0/83 constraints. Problems are: Problem set: 3 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 83 constraints, problems are : Problem set: 3 solved, 6 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 854ms problems are : Problem set: 3 solved, 6 unsolved
Parikh walk visited 1 properties in 601 ms.
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 46 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 8 place count 42 transition count 42
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 42 transition count 42
Applied a total of 12 rules in 21 ms. Remains 42 /48 variables (removed 6) and now considering 42/51 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 42/48 places, 42/51 transitions.
RANDOM walk for 40000 steps (8779 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3825 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (3818 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3770 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1951 resets) in 162 ms. (245 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (1991 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
// Phase 1: matrix 42 rows 42 cols
[2024-05-27 06:40:41] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 06:40:41] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/65 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 17/82 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/84 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/84 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 61 constraints, problems are : Problem set: 0 solved, 4 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 35/65 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 17/82 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/84 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/84 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 65 constraints, problems are : Problem set: 0 solved, 4 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 104 ms.
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 42/42 places, 42/42 transitions.
RANDOM walk for 40000 steps (8764 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3833 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3791 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3796 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 433 steps, run visited all 3 properties in 14 ms. (steps per millisecond=30 )
Probabilistic random walk after 433 steps, saw 236 distinct states, run finished after 23 ms. (steps per millisecond=18 ) properties seen :3
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 5 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 7 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 51 transitions.
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 46 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 50
Applied a total of 3 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 50/51 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 46/48 places, 50/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 45 transition count 49
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 45 transition count 49
Applied a total of 5 rules in 3 ms. Remains 45 /48 variables (removed 3) and now considering 49/51 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/48 places, 49/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 45 transition count 49
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 45 transition count 49
Applied a total of 5 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 49/51 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 49/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/48 places, 47/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 6 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 43/48 places, 45/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 49
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 49
Applied a total of 4 rules in 1 ms. Remains 46 /48 variables (removed 2) and now considering 49/51 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/48 places, 49/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 46
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 46
Applied a total of 7 rules in 3 ms. Remains 44 /48 variables (removed 4) and now considering 46/51 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/48 places, 46/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 6 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 42/48 places, 44/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 2 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 43/48 places, 47/51 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Input system was already deterministic with 47 transitions.
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 3 ms
[2024-05-27 06:40:42] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:40:42] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-27 06:40:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 51 transitions and 199 arcs took 1 ms.
Total runtime 8114 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running RingSingleMessageInMbox-PT-d0m010
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 48
TRANSITIONS: 51
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/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: 570
MODEL NAME: /home/mcc/execution/412/model
48 places, 51 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 RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA RingSingleMessageInMbox-PT-d0m010-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716792057098
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="RingSingleMessageInMbox-PT-d0m010"
export BK_EXAMINATION="CTLFireability"
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 RingSingleMessageInMbox-PT-d0m010, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679077500018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m010.tgz
mv RingSingleMessageInMbox-PT-d0m010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;