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

About the Execution of GreatSPN+red for ShieldIIPs-PT-100A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12072.468 3600000.00 14112587.00 269.50 ?F?TFF?????????? 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-171683758200161.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 ShieldIIPs-PT-100A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758200161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 11 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 15:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 15:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 868K 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 ShieldIIPs-PT-100A-CTLCardinality-2024-00
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-01
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-02
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-03
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-04
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-05
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-06
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-07
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-08
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-09
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-10
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2024-11
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2023-12
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2023-13
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2023-14
FORMULA_NAME ShieldIIPs-PT-100A-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716918035157

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 17:40:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 17:40:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:40:36] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-28 17:40:36] [INFO ] Transformed 2503 places.
[2024-05-28 17:40:36] [INFO ] Transformed 2403 transitions.
[2024-05-28 17:40:36] [INFO ] Found NUPN structural information;
[2024-05-28 17:40:36] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 361 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldIIPs-PT-100A-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 226 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2024-05-28 17:40:37] [INFO ] Computed 901 invariants in 42 ms
[2024-05-28 17:40:38] [INFO ] Implicit Places using invariants in 1719 ms returned []
[2024-05-28 17:40:38] [INFO ] Invariant cache hit.
[2024-05-28 17:40:42] [INFO ] Implicit Places using invariants and state equation in 3306 ms returned []
Implicit Place search using SMT with State Equation took 5056 ms to find 0 implicit places.
Running 2402 sub problems to find dead transitions.
[2024-05-28 17:40:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2502 variables, 2502/2502 constraints. Problems are: Problem set: 0 solved, 2402 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2502/4906 variables, and 2502 constraints, problems are : Problem set: 0 solved, 2402 unsolved in 30065 ms.
Refiners :[Domain max(s): 2502/2503 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 2402/2402 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2502 variables, 2502/2502 constraints. Problems are: Problem set: 0 solved, 2402 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2502/4906 variables, and 2502 constraints, problems are : Problem set: 0 solved, 2402 unsolved in 30033 ms.
Refiners :[Domain max(s): 2502/2503 constraints, Positive P Invariants (semi-flows): 0/901 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 0/2402 constraints, Known Traps: 0/0 constraints]
After SMT, in 61594ms problems are : Problem set: 0 solved, 2402 unsolved
Search for dead transitions found 0 dead transitions in 61633ms
Finished structural reductions in LTL mode , in 1 iterations and 66956 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 78 out of 2503 places after structural reductions.
[2024-05-28 17:41:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 17:41:44] [INFO ] Flatten gal took : 357 ms
FORMULA ShieldIIPs-PT-100A-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:41:44] [INFO ] Flatten gal took : 200 ms
[2024-05-28 17:41:44] [INFO ] Input system was already deterministic with 2403 transitions.
Support contains 60 out of 2503 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2587 ms. (15 steps per ms) remains 7/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 723 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 508 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 519 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 608 ms. (65 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 7/7 properties
[2024-05-28 17:41:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 30/46 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2457/2503 variables, 885/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2457/3404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2403/4906 variables, 2503/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/4906 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4906/4906 variables, and 5907 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2220 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 30/46 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 30/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2457/2503 variables, 885/947 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2457/3404 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:41:49] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 18 ms to minimize.
[2024-05-28 17:41:49] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 11 ms to minimize.
[2024-05-28 17:41:50] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:41:50] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-28 17:41:50] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:41:50] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:41:50] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 7/3411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2503 variables, 0/3411 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 2403/4906 variables, 2503/5914 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4906 variables, 7/5921 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-28 17:41:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4906 variables, 1/5922 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4906/4906 variables, and 5922 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5021 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 901/901 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 8/8 constraints]
After SMT, in 7271ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 42 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 691 times.
Drop transitions (Partial Free agglomeration) removed 691 transitions
Iterating global reduction 0 with 691 rules applied. Total rules applied 695 place count 2501 transition count 2401
Applied a total of 695 rules in 545 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 545 ms. Remains : 2501/2503 places, 2401/2403 transitions.
RANDOM walk for 40000 steps (8 resets) in 1361 ms. (29 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 502 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 531 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 502 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 6/6 properties
// Phase 1: matrix 2401 rows 2501 cols
[2024-05-28 17:41:56] [INFO ] Computed 901 invariants in 223 ms
[2024-05-28 17:41:56] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 24/38 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2457/2495 variables, 884/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2495 variables, 2457/3393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2495 variables, 0/3393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/2501 variables, 3/3396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2501 variables, 6/3402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 0/3402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2401/4902 variables, 2501/5903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4902 variables, 4/5907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/4902 variables, 0/5907 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4902/4902 variables, and 5907 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2276 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 898/898 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 24/38 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 24/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2457/2495 variables, 884/936 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2495 variables, 2457/3393 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:41:58] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 5 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2495 variables, 7/3400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2495 variables, 0/3400 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 6/2501 variables, 3/3403 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2501 variables, 6/3409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:42:00] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2501 variables, 1/3410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2501 variables, 0/3410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2401/4902 variables, 2501/5911 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4902 variables, 4/5915 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4902 variables, 6/5921 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:42:02] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 5 ms to minimize.
[2024-05-28 17:42:03] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 5 ms to minimize.
[2024-05-28 17:42:03] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 5 ms to minimize.
[2024-05-28 17:42:04] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 5 ms to minimize.
[2024-05-28 17:42:04] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 5 ms to minimize.
[2024-05-28 17:42:04] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 4 ms to minimize.
[2024-05-28 17:42:05] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 4 ms to minimize.
[2024-05-28 17:42:05] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 5 ms to minimize.
[2024-05-28 17:42:06] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 5 ms to minimize.
[2024-05-28 17:42:06] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 4 ms to minimize.
[2024-05-28 17:42:06] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 4 ms to minimize.
[2024-05-28 17:42:07] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 4 ms to minimize.
[2024-05-28 17:42:07] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2024-05-28 17:42:07] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 4 ms to minimize.
[2024-05-28 17:42:08] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 4 ms to minimize.
[2024-05-28 17:42:08] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 4 ms to minimize.
[2024-05-28 17:42:08] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 3 ms to minimize.
[2024-05-28 17:42:08] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 6 ms to minimize.
[2024-05-28 17:42:09] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2024-05-28 17:42:09] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/4902 variables, 20/5941 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:42:10] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 4 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:42:11] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:42:12] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-05-28 17:42:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2024-05-28 17:42:12] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:42:12] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:42:13] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 17:42:14] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/4902 variables, 16/5957 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:42:15] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4902 variables, 1/5958 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-28 17:42:16] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4902 variables, 1/5959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4902 variables, 0/5959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/4902 variables, 0/5959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4902/4902 variables, and 5959 constraints, problems are : Problem set: 0 solved, 6 unsolved in 22405 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 898/898 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 2501/2501 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 46/46 constraints]
After SMT, in 24931ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 44837 steps, including 988 resets, run visited all 6 properties in 1360 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 1374 ms.
[2024-05-28 17:42:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 17:42:22] [INFO ] Flatten gal took : 157 ms
FORMULA ShieldIIPs-PT-100A-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:42:22] [INFO ] Flatten gal took : 144 ms
[2024-05-28 17:42:22] [INFO ] Input system was already deterministic with 2403 transitions.
Support contains 54 out of 2503 places (down from 60) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 59 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 2503/2503 places, 2403/2403 transitions.
[2024-05-28 17:42:22] [INFO ] Flatten gal took : 139 ms
[2024-05-28 17:42:23] [INFO ] Flatten gal took : 130 ms
[2024-05-28 17:42:23] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 59 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 2503/2503 places, 2403/2403 transitions.
[2024-05-28 17:42:23] [INFO ] Flatten gal took : 122 ms
[2024-05-28 17:42:23] [INFO ] Flatten gal took : 129 ms
[2024-05-28 17:42:23] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 188 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 188 ms. Remains : 2501/2503 places, 2401/2403 transitions.
[2024-05-28 17:42:23] [INFO ] Flatten gal took : 121 ms
[2024-05-28 17:42:24] [INFO ] Flatten gal took : 127 ms
[2024-05-28 17:42:24] [INFO ] Input system was already deterministic with 2401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 186 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 2501/2503 places, 2401/2403 transitions.
[2024-05-28 17:42:24] [INFO ] Flatten gal took : 122 ms
[2024-05-28 17:42:24] [INFO ] Flatten gal took : 127 ms
[2024-05-28 17:42:24] [INFO ] Input system was already deterministic with 2401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 177 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 177 ms. Remains : 2499/2503 places, 2400/2403 transitions.
[2024-05-28 17:42:25] [INFO ] Flatten gal took : 70 ms
[2024-05-28 17:42:25] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:42:25] [INFO ] Input system was already deterministic with 2400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 55 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 2503/2503 places, 2403/2403 transitions.
[2024-05-28 17:42:25] [INFO ] Flatten gal took : 136 ms
[2024-05-28 17:42:25] [INFO ] Flatten gal took : 122 ms
[2024-05-28 17:42:25] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2502 transition count 2401
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 160 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 162 ms. Remains : 2499/2503 places, 2400/2403 transitions.
[2024-05-28 17:42:26] [INFO ] Flatten gal took : 69 ms
[2024-05-28 17:42:26] [INFO ] Flatten gal took : 76 ms
[2024-05-28 17:42:26] [INFO ] Input system was already deterministic with 2400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 2503/2503 places, 2403/2403 transitions.
[2024-05-28 17:42:26] [INFO ] Flatten gal took : 118 ms
[2024-05-28 17:42:26] [INFO ] Flatten gal took : 124 ms
[2024-05-28 17:42:26] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 153 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 153 ms. Remains : 2501/2503 places, 2401/2403 transitions.
[2024-05-28 17:42:27] [INFO ] Flatten gal took : 118 ms
[2024-05-28 17:42:27] [INFO ] Flatten gal took : 128 ms
[2024-05-28 17:42:27] [INFO ] Input system was already deterministic with 2401 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 2503 transition count 2402
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 151 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 152 ms. Remains : 2501/2503 places, 2401/2403 transitions.
[2024-05-28 17:42:27] [INFO ] Flatten gal took : 122 ms
[2024-05-28 17:42:27] [INFO ] Flatten gal took : 126 ms
[2024-05-28 17:42:27] [INFO ] Input system was already deterministic with 2401 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 53 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 2503/2503 places, 2403/2403 transitions.
[2024-05-28 17:42:28] [INFO ] Flatten gal took : 117 ms
[2024-05-28 17:42:28] [INFO ] Flatten gal took : 137 ms
[2024-05-28 17:42:28] [INFO ] Input system was already deterministic with 2403 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 54 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 2503/2503 places, 2403/2403 transitions.
[2024-05-28 17:42:28] [INFO ] Flatten gal took : 121 ms
[2024-05-28 17:42:28] [INFO ] Flatten gal took : 124 ms
[2024-05-28 17:42:28] [INFO ] Input system was already deterministic with 2403 transitions.
[2024-05-28 17:42:28] [INFO ] Flatten gal took : 118 ms
[2024-05-28 17:42:29] [INFO ] Flatten gal took : 134 ms
[2024-05-28 17:42:29] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-28 17:42:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 2403 transitions and 10806 arcs took 14 ms.
Total runtime 112796 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-100A

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: 2503
TRANSITIONS: 2403
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.059s, Sys 0.002s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 747
MODEL NAME: /home/mcc/execution/412/model
2503 places, 2403 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.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 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="ShieldIIPs-PT-100A"
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 ShieldIIPs-PT-100A, 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 r355-tall-171683758200161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A 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 ;