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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3781.336 142277.00 212366.00 398.50 TFTFFTTTFTTTTFFT 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-171683760101026.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-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760101026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.0K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 02:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 01:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 136K 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-050A-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-050A-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717085081013

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-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 16:04:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 16:04:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:04:42] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-30 16:04:42] [INFO ] Transformed 403 places.
[2024-05-30 16:04:42] [INFO ] Transformed 403 transitions.
[2024-05-30 16:04:42] [INFO ] Found NUPN structural information;
[2024-05-30 16:04:42] [INFO ] Parsed PT model containing 403 places and 403 transitions and 1706 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-050A-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 203 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 30 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-30 16:04:42] [INFO ] Computed 201 invariants in 21 ms
[2024-05-30 16:04:43] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-30 16:04:43] [INFO ] Invariant cache hit.
[2024-05-30 16:04:43] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2024-05-30 16:04:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23939 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 402/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 201/603 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/805 variables, 401/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/805 variables, 0/1408 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1408 constraints, problems are : Problem set: 0 solved, 401 unsolved in 25617 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 49743ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 49766ms
Finished structural reductions in LTL mode , in 1 iterations and 50622 ms. Remains : 403/403 places, 402/402 transitions.
Support contains 203 out of 403 places after structural reductions.
[2024-05-30 16:05:33] [INFO ] Flatten gal took : 87 ms
[2024-05-30 16:05:33] [INFO ] Flatten gal took : 64 ms
[2024-05-30 16:05:33] [INFO ] Input system was already deterministic with 402 transitions.
Support contains 202 out of 403 places (down from 203) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 99 to 96
RANDOM walk for 40000 steps (8 resets) in 2415 ms. (16 steps per ms) remains 55/96 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 55/55 properties
[2024-05-30 16:05:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 77/195 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 77/292 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 208/403 variables, 104/396 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 208/604 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/805 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 805/805 variables, and 1007 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2479 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 77/195 variables, 97/215 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 77/292 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 208/403 variables, 104/396 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 208/604 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (OVERLAPS) 402/805 variables, 403/1007 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/805 variables, 55/1062 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/805 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 0/805 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 805/805 variables, and 1062 constraints, problems are : Problem set: 0 solved, 55 unsolved in 4663 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 0/0 constraints]
After SMT, in 7173ms problems are : Problem set: 0 solved, 55 unsolved
Fused 55 Parikh solutions to 38 different solutions.
Parikh walk visited 0 properties in 9442 ms.
Support contains 118 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Partial Free-agglomeration rule applied 32 times.
Drop transitions (Partial Free agglomeration) removed 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 34 place count 402 transition count 401
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 0 with 32 rules applied. Total rules applied 66 place count 402 transition count 369
Applied a total of 66 rules in 81 ms. Remains 402 /403 variables (removed 1) and now considering 369/402 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 402/403 places, 369/402 transitions.
RANDOM walk for 40000 steps (8 resets) in 1124 ms. (35 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 54/54 properties
Interrupted probabilistic random walk after 384580 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :53 out of 54
Probabilistic random walk after 384580 steps, saw 376051 distinct states, run finished after 3007 ms. (steps per millisecond=127 ) properties seen :53
// Phase 1: matrix 369 rows 402 cols
[2024-05-30 16:05:55] [INFO ] Computed 201 invariants in 6 ms
[2024-05-30 16:05:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/402 variables, 194/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 387/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 369/771 variables, 402/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/771 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/771 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 771/771 variables, and 1007 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 402/402 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/402 variables, 194/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 387/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 369/771 variables, 402/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/771 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/771 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 771/771 variables, and 1008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 402/402 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 468 ms.
Support contains 7 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 369/369 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 402 transition count 369
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 402 transition count 352
Applied a total of 34 rules in 46 ms. Remains 402 /402 variables (removed 0) and now considering 352/369 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 402/402 places, 352/369 transitions.
RANDOM walk for 40000 steps (8 resets) in 388 ms. (102 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 544364 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 544364 steps, saw 532712 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
// Phase 1: matrix 352 rows 402 cols
[2024-05-30 16:06:00] [INFO ] Computed 201 invariants in 12 ms
[2024-05-30 16:06:00] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/402 variables, 194/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 387/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 352/754 variables, 402/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/754 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 1007 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 402/402 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 387/402 variables, 194/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 387/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 352/754 variables, 402/1005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 2/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 1/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/754 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/754 variables, 0/1008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 754/754 variables, and 1008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Domain max(s): 402/402 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 402/402 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 343 ms.
Support contains 7 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 352/352 transitions.
Applied a total of 0 rules in 16 ms. Remains 402 /402 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 402/402 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 352/352 transitions.
Applied a total of 0 rules in 21 ms. Remains 402 /402 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-30 16:06:01] [INFO ] Invariant cache hit.
[2024-05-30 16:06:01] [INFO ] Implicit Places using invariants in 305 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 309 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/402 places, 352/352 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 342 ms. Remains : 401/402 places, 352/352 transitions.
RANDOM walk for 40000 steps (8 resets) in 323 ms. (123 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 574614 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 1
Probabilistic random walk after 574614 steps, saw 562069 distinct states, run finished after 3001 ms. (steps per millisecond=191 ) properties seen :0
// Phase 1: matrix 352 rows 401 cols
[2024-05-30 16:06:04] [INFO ] Computed 200 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/401 variables, 193/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 386/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 352/753 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/753 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 1002 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 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/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 386/401 variables, 193/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 386/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 352/753 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 1/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/753 variables, 0/1003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/753 variables, and 1003 constraints, problems are : Problem set: 0 solved, 1 unsolved in 355 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 324 ms.
Support contains 7 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 352/352 transitions.
Applied a total of 0 rules in 21 ms. Remains 401 /401 variables (removed 0) and now considering 352/352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 401/401 places, 352/352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 352/352 transitions.
Applied a total of 0 rules in 12 ms. Remains 401 /401 variables (removed 0) and now considering 352/352 (removed 0) transitions.
[2024-05-30 16:06:06] [INFO ] Invariant cache hit.
[2024-05-30 16:06:06] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-30 16:06:06] [INFO ] Invariant cache hit.
[2024-05-30 16:06:06] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-30 16:06:06] [INFO ] Redundant transitions in 26 ms returned []
Running 351 sub problems to find dead transitions.
[2024-05-30 16:06:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 352/753 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 0/753 variables, 0/1002 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 1002 constraints, problems are : Problem set: 0 solved, 351 unsolved in 19653 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/401 variables, 200/600 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/401 variables, 1/601 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (OVERLAPS) 352/753 variables, 401/1002 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 351/1353 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 0/1353 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 8 (OVERLAPS) 0/753 variables, 0/1353 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/753 variables, and 1353 constraints, problems are : Problem set: 0 solved, 351 unsolved in 24122 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 401/401 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints]
After SMT, in 43906ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 43911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44558 ms. Remains : 401/401 places, 352/352 transitions.
[2024-05-30 16:06:50] [INFO ] Flatten gal took : 69 ms
[2024-05-30 16:06:50] [INFO ] Flatten gal took : 44 ms
[2024-05-30 16:06:50] [INFO ] Input system was already deterministic with 402 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 19 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:50] [INFO ] Flatten gal took : 24 ms
[2024-05-30 16:06:50] [INFO ] Flatten gal took : 46 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 37 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 22 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 21 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 21 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 28 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 22 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 403/403 places, 402/402 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 400 transition count 400
Applied a total of 3 rules in 30 ms. Remains 400 /403 variables (removed 3) and now considering 400/402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 400/403 places, 400/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 14 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 14 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 18 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 44 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 20 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 31 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 33 ms
[2024-05-30 16:06:51] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 32 ms
[2024-05-30 16:06:51] [INFO ] Flatten gal took : 32 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 32 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 32 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 20 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 30 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 31 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 20 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 27 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 32 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 20 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 29 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 16 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 3 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 15 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 15 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 4 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 403/403 places, 402/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 16 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 15 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 402 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 403/403 places, 402/402 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 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 400 transition count 400
Applied a total of 3 rules in 28 ms. Remains 400 /403 variables (removed 3) and now considering 400/402 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 400/403 places, 400/402 transitions.
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 13 ms
[2024-05-30 16:06:52] [INFO ] Flatten gal took : 12 ms
[2024-05-30 16:06:52] [INFO ] Input system was already deterministic with 400 transitions.
RANDOM walk for 40000 steps (8 resets) in 604 ms. (66 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2070 steps, run visited all 1 properties in 20 ms. (steps per millisecond=103 )
Probabilistic random walk after 2070 steps, saw 1971 distinct states, run finished after 24 ms. (steps per millisecond=86 ) properties seen :1
FORMULA ShieldRVt-PT-050A-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-30 16:06:53] [INFO ] Flatten gal took : 18 ms
[2024-05-30 16:06:53] [INFO ] Flatten gal took : 23 ms
[2024-05-30 16:06:53] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2024-05-30 16:06:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 403 places, 402 transitions and 1704 arcs took 7 ms.
Total runtime 131156 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-050A

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: 403
TRANSITIONS: 402
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.003s]


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


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

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

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

BK_STOP 1717085223290

--------------------
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-050A"
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-050A, 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-171683760101026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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