fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690530000297
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for StigmergyElection-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
389.787 21874.00 38123.00 171.60 TTFFTTTTFTTTFTFF 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.r399-tall-171690530000297.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 StigmergyElection-PT-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530000297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 19:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 11 19:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 11 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 193K 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 StigmergyElection-PT-05a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717009546009

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 19:05:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 19:05:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:05:47] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-29 19:05:47] [INFO ] Transformed 72 places.
[2024-05-29 19:05:47] [INFO ] Transformed 450 transitions.
[2024-05-29 19:05:47] [INFO ] Found NUPN structural information;
[2024-05-29 19:05:47] [INFO ] Parsed PT model containing 72 places and 450 transitions and 3637 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 159/159 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 69 transition count 155
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 69 transition count 155
Applied a total of 6 rules in 20 ms. Remains 69 /72 variables (removed 3) and now considering 155/159 (removed 4) transitions.
[2024-05-29 19:05:47] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
// Phase 1: matrix 143 rows 69 cols
[2024-05-29 19:05:47] [INFO ] Computed 4 invariants in 14 ms
[2024-05-29 19:05:47] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-29 19:05:47] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2024-05-29 19:05:47] [INFO ] Invariant cache hit.
[2024-05-29 19:05:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-29 19:05:47] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-05-29 19:05:47] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2024-05-29 19:05:47] [INFO ] Invariant cache hit.
[2024-05-29 19:05:47] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-29 19:05:48] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 11 ms to minimize.
[2024-05-29 19:05:48] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 2 ms to minimize.
[2024-05-29 19:05:48] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:05:49] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 5 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:05:50] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:05:51] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:05:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 142/211 variables, 69/129 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 85/214 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 1/212 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 13 (OVERLAPS) 0/212 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 215 constraints, problems are : Problem set: 0 solved, 154 unsolved in 8447 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 56/60 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-05-29 19:05:57] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (OVERLAPS) 142/211 variables, 69/130 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 85/215 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 154/369 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 370 constraints, problems are : Problem set: 0 solved, 154 unsolved in 8290 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 57/57 constraints]
After SMT, in 17024ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 17040ms
Starting structural reductions in LTL mode, iteration 1 : 69/72 places, 155/159 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17444 ms. Remains : 69/72 places, 155/159 transitions.
Support contains 46 out of 69 places after structural reductions.
[2024-05-29 19:06:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 19:06:05] [INFO ] Flatten gal took : 34 ms
[2024-05-29 19:06:05] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-05a-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:06:05] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:06:05] [INFO ] Input system was already deterministic with 155 transitions.
Support contains 43 out of 69 places (down from 46) after GAL structural reductions.
RANDOM walk for 40000 steps (178 resets) in 1659 ms. (24 steps per ms) remains 3/42 properties
BEST_FIRST walk for 40003 steps (216 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (21 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
[2024-05-29 19:06:05] [INFO ] Flow matrix only has 143 transitions (discarded 12 similar events)
[2024-05-29 19:06:05] [INFO ] Invariant cache hit.
[2024-05-29 19:06:05] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 142/211 variables, 69/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 85/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1/212 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 159 constraints, problems are : Problem set: 0 solved, 3 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 69/69 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 58/69 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
Problem AtomicPropp0 is UNSAT
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
Problem AtomicPropp35 is UNSAT
After SMT solving in domain Int declared 69/212 variables, and 15 constraints, problems are : Problem set: 3 solved, 0 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/69 constraints, ReadFeed: 0/86 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 589ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 9 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 155 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 58 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 58 transition count 135
Applied a total of 22 rules in 7 ms. Remains 58 /69 variables (removed 11) and now considering 135/155 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 58/69 places, 135/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 147
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 63 transition count 145
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 63 transition count 145
Applied a total of 12 rules in 4 ms. Remains 63 /69 variables (removed 6) and now considering 145/155 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 63/69 places, 145/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 69 transition count 148
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 62 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 56 transition count 138
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 56 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 52 transition count 131
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 52 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 52 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 50 transition count 128
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 50 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 45 place count 50 transition count 122
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 53 place count 46 transition count 118
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 43 transition count 115
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 43 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 43 transition count 110
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 38 transition count 105
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 38 transition count 105
Applied a total of 75 rules in 54 ms. Remains 38 /69 variables (removed 31) and now considering 105/155 (removed 50) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 38/69 places, 105/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 58 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 58 transition count 135
Applied a total of 22 rules in 6 ms. Remains 58 /69 variables (removed 11) and now considering 135/155 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 58/69 places, 135/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 62 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 62 transition count 143
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 59 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 59 transition count 137
Applied a total of 20 rules in 4 ms. Remains 59 /69 variables (removed 10) and now considering 137/155 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 59/69 places, 137/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 145
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 145
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 60 transition count 139
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 60 transition count 139
Applied a total of 18 rules in 5 ms. Remains 60 /69 variables (removed 9) and now considering 139/155 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 60/69 places, 139/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 67 transition count 141
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 30 place count 54 transition count 138
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 51 transition count 138
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 33 place count 51 transition count 130
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 49 place count 43 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 38 transition count 122
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 38 transition count 122
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 36 transition count 118
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 36 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 36 transition count 117
Drop transitions (Redundant composition of simpler transitions.) removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 4 with 52 rules applied. Total rules applied 116 place count 36 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 36 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 35 transition count 64
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 126 place count 31 transition count 60
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 31 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 31 transition count 59
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 133 place count 26 transition count 54
Applied a total of 133 rules in 33 ms. Remains 26 /69 variables (removed 43) and now considering 54/155 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 26/69 places, 54/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 3 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 2 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 147
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 62 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 62 transition count 143
Applied a total of 14 rules in 3 ms. Remains 62 /69 variables (removed 7) and now considering 143/155 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 62/69 places, 143/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 143 transitions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 155/155 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 144
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 59 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 59 transition count 136
Applied a total of 20 rules in 4 ms. Remains 59 /69 variables (removed 10) and now considering 136/155 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 59/69 places, 136/155 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:06:06] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:06:06] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-29 19:06:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 69 places, 155 transitions and 899 arcs took 2 ms.
Total runtime 19800 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyElection-PT-05a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 69
TRANSITIONS: 155
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/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: 753
MODEL NAME: /home/mcc/execution/411/model
69 places, 155 transitions.

Creating all event NSFs..
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.
Building monolithic NSF...
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-05a-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717009567883

--------------------
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 CTLCardinality -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="StigmergyElection-PT-05a"
export BK_EXAMINATION="CTLCardinality"
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 StigmergyElection-PT-05a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530000297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05a.tgz
mv StigmergyElection-PT-05a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;