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

About the Execution of GreatSPN+red for ShieldRVt-PT-020A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
391.752 20356.00 41680.00 63.00 TTFFTFTFTFFFTFFF 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-171683760000978.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 ShieldRVt-PT-020A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760000978
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 12 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 01:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 01:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 54K 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 ShieldRVt-PT-020A-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-020A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717078433192

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:13:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 14:13:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:13:54] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-30 14:13:54] [INFO ] Transformed 163 places.
[2024-05-30 14:13:54] [INFO ] Transformed 163 transitions.
[2024-05-30 14:13:54] [INFO ] Found NUPN structural information;
[2024-05-30 14:13:54] [INFO ] Parsed PT model containing 163 places and 163 transitions and 686 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Support contains 129 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 12 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2024-05-30 14:13:54] [INFO ] Computed 81 invariants in 12 ms
[2024-05-30 14:13:54] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 14:13:54] [INFO ] Invariant cache hit.
[2024-05-30 14:13:55] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-30 14:13:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 81/243 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 407 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4524 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 81/243 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 161/568 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/325 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 568 constraints, problems are : Problem set: 0 solved, 161 unsolved in 4410 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints]
After SMT, in 9024ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 9039ms
Finished structural reductions in LTL mode , in 1 iterations and 9486 ms. Remains : 163/163 places, 162/162 transitions.
Support contains 129 out of 163 places after structural reductions.
[2024-05-30 14:14:04] [INFO ] Flatten gal took : 42 ms
[2024-05-30 14:14:04] [INFO ] Flatten gal took : 17 ms
[2024-05-30 14:14:04] [INFO ] Input system was already deterministic with 162 transitions.
Reduction of identical properties reduced properties to check from 85 to 79
RANDOM walk for 40000 steps (8 resets) in 2042 ms. (19 steps per ms) remains 29/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
[2024-05-30 14:14:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 28/79 variables, 39/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 28/118 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 84/163 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 84/244 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 407 constraints, problems are : Problem set: 0 solved, 29 unsolved in 641 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 28/79 variables, 39/90 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 28/118 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 84/163 variables, 42/160 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 84/244 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 29/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/325 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 436 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1069 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 1720ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 27 different solutions.
Parikh walk visited 0 properties in 1682 ms.
Support contains 51 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 162 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 162 transition count 151
Applied a total of 22 rules in 73 ms. Remains 162 /163 variables (removed 1) and now considering 151/162 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 162/163 places, 151/162 transitions.
RANDOM walk for 40000 steps (8 resets) in 634 ms. (62 steps per ms) remains 18/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
// Phase 1: matrix 151 rows 162 cols
[2024-05-30 14:14:09] [INFO ] Computed 81 invariants in 3 ms
[2024-05-30 14:14:09] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 16/45 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/162 variables, 59/126 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 117/243 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 151/313 variables, 162/405 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 0/313 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 407 constraints, problems are : Problem set: 0 solved, 18 unsolved in 398 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 162/162 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 16/45 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 16/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/162 variables, 59/126 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 117/243 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 151/313 variables, 162/405 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/313 variables, 18/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/313 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/313 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 425 constraints, problems are : Problem set: 0 solved, 18 unsolved in 696 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 162/162 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1118ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 754 ms.
Support contains 29 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 151/151 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 162 transition count 146
Applied a total of 10 rules in 35 ms. Remains 162 /162 variables (removed 0) and now considering 146/151 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 162/162 places, 146/151 transitions.
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
// Phase 1: matrix 146 rows 162 cols
[2024-05-30 14:14:11] [INFO ] Computed 81 invariants in 1 ms
[2024-05-30 14:14:11] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/162 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 149/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 146/308 variables, 162/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 91 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 162/162 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 149/162 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 149/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 146/308 variables, 162/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/308 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 129 ms.
Refiners :[Domain max(s): 162/162 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 162/162 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4350 steps, including 109 resets, run visited all 1 properties in 17 ms. (steps per millisecond=255 )
Parikh walk visited 1 properties in 20 ms.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 12 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 162 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 13 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 162/163 places, 161/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 160
Applied a total of 3 rules in 13 ms. Remains 160 /163 variables (removed 3) and now considering 160/162 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 160/163 places, 160/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 10 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 162/163 places, 161/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 6 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:11] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:14:11] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 162 transition count 161
Applied a total of 2 rules in 9 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 162/163 places, 161/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 163/163 places, 162/162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:14:12] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-30 14:14:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 162 transitions and 684 arcs took 4 ms.
Total runtime 17986 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-020A

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: 163
TRANSITIONS: 162
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 570
MODEL NAME: /home/mcc/execution/412/model
163 places, 162 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 ShieldRVt-PT-020A-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-020A-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717078453548

--------------------
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 CTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-020A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVt-PT-020A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683760000978"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020A.tgz
mv ShieldRVt-PT-020A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;