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-171683759900969.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-010B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759900969
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 8.8K Apr 11 21:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 21:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 21:35 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 119K 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-010B-CTLCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-12
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-13
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-14
FORMULA_NAME ShieldRVt-PT-010B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717076924000

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 13:48:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 13:48:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:48:45] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-30 13:48:45] [INFO ] Transformed 503 places.
[2024-05-30 13:48:45] [INFO ] Transformed 503 transitions.
[2024-05-30 13:48:45] [INFO ] Found NUPN structural information;
[2024-05-30 13:48:45] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldRVt-PT-010B-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 424 transition count 424
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 424 transition count 424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 159 place count 423 transition count 423
Iterating global reduction 0 with 1 rules applied. Total rules applied 160 place count 423 transition count 423
Applied a total of 160 rules in 90 ms. Remains 423 /503 variables (removed 80) and now considering 423/503 (removed 80) transitions.
// Phase 1: matrix 423 rows 423 cols
[2024-05-30 13:48:45] [INFO ] Computed 41 invariants in 17 ms
[2024-05-30 13:48:45] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-30 13:48:45] [INFO ] Invariant cache hit.
[2024-05-30 13:48:46] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-05-30 13:48:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:51] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 17 ms to minimize.
[2024-05-30 13:48:51] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 4 ms to minimize.
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 2 ms to minimize.
[2024-05-30 13:48:52] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 22 places in 639 ms of which 1 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:48:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 3 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-30 13:48:54] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:48:56] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 3 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 5 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:02] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:49:04] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-30 13:49:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-30 13:49:04] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:49:04] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 423/846 variables, 423/509 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:49:16] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 846/846 variables, and 511 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 47/88 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:20] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:49:22] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:49:22] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:23] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (OVERLAPS) 423/846 variables, 423/515 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 422/937 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 3 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 9 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 3 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:49:31] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 1 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 20/957 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:37] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 3 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-30 13:49:38] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 3 ms to minimize.
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 2 ms to minimize.
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 2 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:49:40] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:49:42] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 20/977 constraints. Problems are: Problem set: 0 solved, 422 unsolved
[2024-05-30 13:49:46] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:49:46] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 846/846 variables, and 979 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 93/93 constraints]
After SMT, in 60152ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 423/503 places, 423/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60868 ms. Remains : 423/503 places, 423/503 transitions.
Support contains 76 out of 423 places after structural reductions.
[2024-05-30 13:49:46] [INFO ] Flatten gal took : 101 ms
[2024-05-30 13:49:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVt-PT-010B-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:49:46] [INFO ] Flatten gal took : 52 ms
[2024-05-30 13:49:47] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 66 out of 423 places (down from 76) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1254 ms. (31 steps per ms) remains 1/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
[2024-05-30 13:49:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/423 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 423/846 variables, 423/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/846 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 846/846 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 386/423 variables, 39/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 13:49:48] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:49:48] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:49:48] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:49:48] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 16 places in 187 ms of which 3 ms to minimize.
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 3 ms to minimize.
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 423/846 variables, 423/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/846 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 1 ms to minimize.
[2024-05-30 13:49:50] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/846 variables, 2/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/846 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/846 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 846/846 variables, and 475 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1723 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 423/423 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 2432ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 423/423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 423 transition count 305
Reduce places removed 118 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 121 rules applied. Total rules applied 239 place count 305 transition count 302
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 302 transition count 302
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 242 place count 302 transition count 236
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 374 place count 236 transition count 236
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 396 place count 214 transition count 214
Iterating global reduction 3 with 22 rules applied. Total rules applied 418 place count 214 transition count 214
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 418 place count 214 transition count 201
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 444 place count 201 transition count 201
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 616 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 115 transition count 114
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 4 with 2 rules applied. Total rules applied 619 place count 114 transition count 113
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 675 place count 86 transition count 139
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 676 place count 86 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 677 place count 85 transition count 137
Applied a total of 677 rules in 119 ms. Remains 85 /423 variables (removed 338) and now considering 137/423 (removed 286) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 85/423 places, 137/423 transitions.
RANDOM walk for 40000 steps (14 resets) in 1090 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1541297 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :0 out of 1
Probabilistic random walk after 1541297 steps, saw 818098 distinct states, run finished after 3004 ms. (steps per millisecond=513 ) properties seen :0
// Phase 1: matrix 137 rows 85 cols
[2024-05-30 13:49:53] [INFO ] Computed 41 invariants in 2 ms
[2024-05-30 13:49:53] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/33 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/87 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 69/156 variables, 28/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/156 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/200 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/200 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 19/219 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/222 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/222 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/33 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 54/87 variables, 18/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 9/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/87 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 69/156 variables, 28/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 44/200 variables, 16/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/200 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/200 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 19/219 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/219 variables, 5/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/219 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/222 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/222 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/222 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/222 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 133 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 208ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 137/137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-30 13:49:53] [INFO ] Invariant cache hit.
[2024-05-30 13:49:54] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-30 13:49:54] [INFO ] Invariant cache hit.
[2024-05-30 13:49:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-30 13:49:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2024-05-30 13:49:54] [INFO ] Redundant transitions in 3 ms returned []
Running 136 sub problems to find dead transitions.
[2024-05-30 13:49:54] [INFO ] Invariant cache hit.
[2024-05-30 13:49:54] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/222 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/222 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 132 constraints, problems are : Problem set: 0 solved, 136 unsolved in 3244 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (OVERLAPS) 1/85 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/222 variables, 85/126 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 136/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 268 constraints, problems are : Problem set: 0 solved, 136 unsolved in 2180 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 85/85 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
After SMT, in 5498ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 5513ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6539 ms. Remains : 85/85 places, 137/137 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 39 edges and 85 vertex of which 4 / 85 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 266 edges and 83 vertex of which 80 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 79 transition count 128
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 1 with 3 rules applied. Total rules applied 9 place count 77 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 77 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 77 transition count 122
Applied a total of 14 rules in 27 ms. Remains 77 /85 variables (removed 8) and now considering 122/137 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 122 rows 77 cols
[2024-05-30 13:50:00] [INFO ] Computed 37 invariants in 1 ms
[2024-05-30 13:50:00] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 13:50:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-30 13:50:00] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 13:50:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-30 13:50:00] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 13:50:00] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 13:50:00] [INFO ] After 117ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 238 ms.
[2024-05-30 13:50:00] [INFO ] Flatten gal took : 37 ms
[2024-05-30 13:50:00] [INFO ] Flatten gal took : 34 ms
[2024-05-30 13:50:00] [INFO ] Input system was already deterministic with 423 transitions.
Computed a total of 131 stabilizing places and 131 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 422 transition count 302
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 302 transition count 302
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 240 place count 302 transition count 237
Deduced a syphon composed of 65 places in 18 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 370 place count 237 transition count 237
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 392 place count 215 transition count 215
Iterating global reduction 2 with 22 rules applied. Total rules applied 414 place count 215 transition count 215
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 414 place count 215 transition count 201
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 442 place count 201 transition count 201
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 594 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 595 place count 125 transition count 124
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 3 with 2 rules applied. Total rules applied 597 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 121 transition count 121
Applied a total of 600 rules in 99 ms. Remains 121 /423 variables (removed 302) and now considering 121/423 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 99 ms. Remains : 121/423 places, 121/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 19 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 121 transitions.
RANDOM walk for 7 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 394 transition count 394
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 394 transition count 394
Applied a total of 58 rules in 28 ms. Remains 394 /423 variables (removed 29) and now considering 394/423 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 394/423 places, 394/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 30 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 14 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 422 transition count 303
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 303 transition count 303
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 238 place count 303 transition count 236
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 372 place count 236 transition count 236
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 393 place count 215 transition count 215
Iterating global reduction 2 with 21 rules applied. Total rules applied 414 place count 215 transition count 215
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 414 place count 215 transition count 202
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 440 place count 202 transition count 202
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 594 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 595 place count 125 transition count 124
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 3 with 2 rules applied. Total rules applied 597 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 599 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 121 transition count 121
Applied a total of 600 rules in 112 ms. Remains 121 /423 variables (removed 302) and now considering 121/423 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 112 ms. Remains : 121/423 places, 121/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 30 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 422 transition count 301
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 301 transition count 301
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 242 place count 301 transition count 235
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 374 place count 235 transition count 235
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 395 place count 214 transition count 214
Iterating global reduction 2 with 21 rules applied. Total rules applied 416 place count 214 transition count 214
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 416 place count 214 transition count 200
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 444 place count 200 transition count 200
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 596 place count 124 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 597 place count 124 transition count 123
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 3 with 2 rules applied. Total rules applied 599 place count 123 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 601 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 120 transition count 120
Applied a total of 602 rules in 71 ms. Remains 120 /423 variables (removed 303) and now considering 120/423 (removed 303) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 120/423 places, 120/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 422 transition count 303
Reduce places removed 119 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 120 rules applied. Total rules applied 239 place count 303 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 240 place count 302 transition count 302
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 240 place count 302 transition count 237
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 370 place count 237 transition count 237
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 391 place count 216 transition count 216
Iterating global reduction 3 with 21 rules applied. Total rules applied 412 place count 216 transition count 216
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 412 place count 216 transition count 202
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 440 place count 202 transition count 202
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 590 place count 127 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 591 place count 127 transition count 126
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 4 with 2 rules applied. Total rules applied 593 place count 126 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 595 place count 124 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 596 place count 123 transition count 123
Applied a total of 596 rules in 66 ms. Remains 123 /423 variables (removed 300) and now considering 123/423 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 123/423 places, 123/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 47 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 123 transitions.
RANDOM walk for 58 steps (0 resets) in 7 ms. (7 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 115 transitions
Trivial Post-agglo rules discarded 115 transitions
Performed 115 trivial Post agglomeration. Transition count delta: 115
Iterating post reduction 0 with 115 rules applied. Total rules applied 115 place count 422 transition count 307
Reduce places removed 115 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 117 rules applied. Total rules applied 232 place count 307 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 234 place count 305 transition count 305
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 234 place count 305 transition count 239
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 366 place count 239 transition count 239
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 386 place count 219 transition count 219
Iterating global reduction 3 with 20 rules applied. Total rules applied 406 place count 219 transition count 219
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 406 place count 219 transition count 206
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 432 place count 206 transition count 206
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 582 place count 131 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 583 place count 131 transition count 130
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 4 with 2 rules applied. Total rules applied 585 place count 130 transition count 129
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 128 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 588 place count 127 transition count 127
Applied a total of 588 rules in 50 ms. Remains 127 /423 variables (removed 296) and now considering 127/423 (removed 296) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 127/423 places, 127/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 392 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 392 transition count 392
Applied a total of 62 rules in 11 ms. Remains 392 /423 variables (removed 31) and now considering 392/423 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 392/423 places, 392/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 392 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 392 transition count 392
Applied a total of 62 rules in 22 ms. Remains 392 /423 variables (removed 31) and now considering 392/423 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 392/423 places, 392/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 22 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 396 transition count 396
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 396 transition count 396
Applied a total of 54 rules in 12 ms. Remains 396 /423 variables (removed 27) and now considering 396/423 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 396/423 places, 396/423 transitions.
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:01] [INFO ] Flatten gal took : 26 ms
[2024-05-30 13:50:01] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 397 transition count 397
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 397 transition count 397
Applied a total of 52 rules in 25 ms. Remains 397 /423 variables (removed 26) and now considering 397/423 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 397/423 places, 397/423 transitions.
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 26 ms
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:02] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 392 transition count 392
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 392 transition count 392
Applied a total of 62 rules in 11 ms. Remains 392 /423 variables (removed 31) and now considering 392/423 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 392/423 places, 392/423 transitions.
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 20 ms
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:50:02] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 393 transition count 393
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 393 transition count 393
Applied a total of 60 rules in 39 ms. Remains 393 /423 variables (removed 30) and now considering 393/423 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 393/423 places, 393/423 transitions.
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:02] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 393 transition count 393
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 393 transition count 393
Applied a total of 60 rules in 26 ms. Remains 393 /423 variables (removed 30) and now considering 393/423 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 393/423 places, 393/423 transitions.
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 27 ms
[2024-05-30 13:50:02] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 423/423 places, 423/423 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 395 transition count 395
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 395 transition count 395
Applied a total of 56 rules in 23 ms. Remains 395 /423 variables (removed 28) and now considering 395/423 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 395/423 places, 395/423 transitions.
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 22 ms
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:50:02] [INFO ] Input system was already deterministic with 395 transitions.
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:50:02] [INFO ] Flatten gal took : 12 ms
[2024-05-30 13:50:02] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 15 ms.
[2024-05-30 13:50:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 423 places, 423 transitions and 1026 arcs took 3 ms.
Total runtime 77554 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-010B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 423
TRANSITIONS: 423
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.003s]


SAVING FILE /home/mcc/execution/413/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: 903
MODEL NAME: /home/mcc/execution/413/model
423 places, 423 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-010B-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-010B-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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