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.r575-smll-171734919500049.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 MedleyA-PT-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919500049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 82K Jun 2 16:33 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 MedleyA-PT-07-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717353949822

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:45:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:45:52] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-02 18:45:52] [INFO ] Transformed 145 places.
[2024-06-02 18:45:52] [INFO ] Transformed 287 transitions.
[2024-06-02 18:45:52] [INFO ] Found NUPN structural information;
[2024-06-02 18:45:52] [INFO ] Parsed PT model containing 145 places and 287 transitions and 1240 arcs in 404 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 38 ms.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
FORMULA MedleyA-PT-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 285/285 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 142 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 129 transition count 271
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 129 transition count 271
Applied a total of 27 rules in 68 ms. Remains 129 /143 variables (removed 14) and now considering 271/285 (removed 14) transitions.
// Phase 1: matrix 271 rows 129 cols
[2024-06-02 18:45:52] [INFO ] Computed 10 invariants in 39 ms
[2024-06-02 18:45:53] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-02 18:45:53] [INFO ] Invariant cache hit.
[2024-06-02 18:45:53] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-06-02 18:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:45:58] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 19 ms to minimize.
[2024-06-02 18:45:58] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:45:58] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-02 18:45:59] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:01] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:46:01] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-06-02 18:46:01] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2024-06-02 18:46:02] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 4/22 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:03] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:46:03] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 2/24 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/24 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 271/399 variables, 128/152 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:07] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:46:07] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/154 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/154 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 10 (OVERLAPS) 1/400 variables, 1/155 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:13] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 3 ms to minimize.
[2024-06-02 18:46:13] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 3 ms to minimize.
[2024-06-02 18:46:13] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-06-02 18:46:13] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:46:14] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 2 ms to minimize.
[2024-06-02 18:46:14] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 6/161 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 0/161 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 13 (OVERLAPS) 0/400 variables, 0/161 constraints. Problems are: Problem set: 48 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 161 constraints, problems are : Problem set: 48 solved, 222 unsolved in 27585 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 48 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 17/27 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/27 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 271/399 variables, 128/155 constraints. Problems are: Problem set: 48 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 221/376 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:27] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-02 18:46:28] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 2 ms to minimize.
[2024-06-02 18:46:29] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 2 ms to minimize.
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 34 places in 129 ms of which 2 ms to minimize.
[2024-06-02 18:46:30] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 7/383 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:35] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-06-02 18:46:37] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-06-02 18:46:38] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 3/386 constraints. Problems are: Problem set: 48 solved, 222 unsolved
[2024-06-02 18:46:44] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 1 ms to minimize.
[2024-06-02 18:46:45] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 3 ms to minimize.
[2024-06-02 18:46:45] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/389 constraints. Problems are: Problem set: 48 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/400 variables, and 389 constraints, problems are : Problem set: 48 solved, 222 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 128/129 constraints, PredecessorRefiner: 221/270 constraints, Known Traps: 30/35 constraints]
After SMT, in 58596ms problems are : Problem set: 48 solved, 222 unsolved
Search for dead transitions found 48 dead transitions in 58634ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 129/143 places, 223/285 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59678 ms. Remains : 129/143 places, 223/285 transitions.
Support contains 72 out of 129 places after structural reductions.
[2024-06-02 18:46:52] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 18:46:52] [INFO ] Flatten gal took : 73 ms
FORMULA MedleyA-PT-07-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-07-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:46:52] [INFO ] Flatten gal took : 30 ms
[2024-06-02 18:46:52] [INFO ] Input system was already deterministic with 223 transitions.
Support contains 70 out of 129 places (down from 72) after GAL structural reductions.
RANDOM walk for 40000 steps (1408 resets) in 3350 ms. (11 steps per ms) remains 22/48 properties
BEST_FIRST walk for 4004 steps (32 resets) in 52 ms. (75 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (32 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (28 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (30 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (28 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (31 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (30 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (30 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (30 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 50 ms. (78 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (29 resets) in 44 ms. (88 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (29 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (28 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
// Phase 1: matrix 223 rows 129 cols
[2024-06-02 18:46:54] [INFO ] Computed 10 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 41/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 3 (OVERLAPS) 36/114 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 209/323 variables, 114/123 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 20/343 variables, 8/131 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/131 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 2/345 variables, 1/132 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 2/134 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 7/352 variables, 5/139 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/352 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/352 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 139 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1042 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 43/76 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 38/114 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-06-02 18:46:55] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-06-02 18:46:55] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-06-02 18:46:55] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
Problem AtomicPropp4 is UNSAT
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:46:56] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 14/23 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 209/323 variables, 114/137 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 16/153 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-06-02 18:46:57] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 1/154 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 20/343 variables, 8/162 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 3/165 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-06-02 18:46:58] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/166 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 2/345 variables, 1/167 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 2/169 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 7/352 variables, 5/174 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/352 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/352 variables, 0/174 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 174 constraints, problems are : Problem set: 2 solved, 19 unsolved in 3939 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 19/21 constraints, Known Traps: 16/16 constraints]
After SMT, in 5006ms problems are : Problem set: 2 solved, 19 unsolved
Parikh walk visited 16 properties in 14694 ms.
Support contains 6 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 223/223 transitions.
Graph (complete) has 387 edges and 129 vertex of which 125 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 125 transition count 192
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 54 place count 103 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 58 place count 102 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 100 transition count 187
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 60 place count 100 transition count 183
Deduced a syphon composed of 4 places in 7 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 68 place count 96 transition count 183
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 82 place count 82 transition count 164
Iterating global reduction 4 with 14 rules applied. Total rules applied 96 place count 82 transition count 164
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 96 place count 82 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 80 transition count 162
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 45 rules applied. Total rules applied 145 place count 57 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 57 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 163 place count 49 transition count 174
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 184 place count 49 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 186 place count 48 transition count 165
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 48 transition count 161
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 194 place count 44 transition count 161
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 197 place count 44 transition count 158
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 200 place count 41 transition count 158
Applied a total of 200 rules in 124 ms. Remains 41 /129 variables (removed 88) and now considering 158/223 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 41/129 places, 158/223 transitions.
RANDOM walk for 7126 steps (1294 resets) in 155 ms. (45 steps per ms) remains 0/3 properties
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA MedleyA-PT-07-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 223 transitions.
Computed a total of 17 stabilizing places and 19 stable transitions
Graph (complete) has 387 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 111 transition count 203
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 111 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 110 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 110 transition count 201
Applied a total of 37 rules in 12 ms. Remains 110 /129 variables (removed 19) and now considering 201/223 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 110/129 places, 201/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 11 ms. Remains 105 /129 variables (removed 24) and now considering 195/223 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 105/129 places, 195/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 106 transition count 197
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 106 transition count 197
Applied a total of 45 rules in 11 ms. Remains 106 /129 variables (removed 23) and now considering 197/223 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 106/129 places, 197/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 106 transition count 198
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 106 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 105 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 105 transition count 196
Applied a total of 47 rules in 8 ms. Remains 105 /129 variables (removed 24) and now considering 196/223 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 105/129 places, 196/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 110 transition count 204
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 110 transition count 204
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 108 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 108 transition count 200
Applied a total of 41 rules in 6 ms. Remains 108 /129 variables (removed 21) and now considering 200/223 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 108/129 places, 200/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 108 transition count 201
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 108 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 106 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 106 transition count 197
Applied a total of 45 rules in 7 ms. Remains 106 /129 variables (removed 23) and now considering 197/223 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 106/129 places, 197/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 112 transition count 206
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 112 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 111 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 111 transition count 204
Applied a total of 35 rules in 6 ms. Remains 111 /129 variables (removed 18) and now considering 204/223 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 111/129 places, 204/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 110 transition count 202
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 110 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 108 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 108 transition count 198
Applied a total of 41 rules in 5 ms. Remains 108 /129 variables (removed 21) and now considering 198/223 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 108/129 places, 198/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Graph (complete) has 387 edges and 129 vertex of which 123 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 122 transition count 201
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 105 transition count 199
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 104 transition count 194
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 49 place count 100 transition count 193
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 49 place count 100 transition count 190
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 55 place count 97 transition count 190
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 69 place count 83 transition count 172
Iterating global reduction 4 with 14 rules applied. Total rules applied 83 place count 83 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 83 place count 83 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 81 transition count 170
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 111 place count 68 transition count 159
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 67 transition count 157
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 67 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 120 place count 67 transition count 150
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 67 transition count 147
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 126 place count 64 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 126 place count 64 transition count 145
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 130 place count 62 transition count 145
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 134 place count 60 transition count 143
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 60 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 136 place count 59 transition count 142
Applied a total of 136 rules in 54 ms. Remains 59 /129 variables (removed 70) and now considering 142/223 (removed 81) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 59/129 places, 142/223 transitions.
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:47:14] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:47:14] [INFO ] Input system was already deterministic with 142 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 7 ms. Remains 105 /129 variables (removed 24) and now considering 195/223 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 105/129 places, 195/223 transitions.
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:15] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 107 transition count 199
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 107 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 105 transition count 195
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 105 transition count 195
Applied a total of 47 rules in 7 ms. Remains 105 /129 variables (removed 24) and now considering 195/223 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 105/129 places, 195/223 transitions.
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:15] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 223/223 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 128 transition count 223
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 108 transition count 200
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 108 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 107 transition count 198
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 107 transition count 198
Applied a total of 43 rules in 5 ms. Remains 107 /129 variables (removed 22) and now considering 198/223 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 107/129 places, 198/223 transitions.
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:47:15] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:47:15] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:47:15] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-02 18:47:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 223 transitions and 855 arcs took 3 ms.
Total runtime 83112 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-07

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


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


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

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

Process ID: 715
MODEL NAME: /home/mcc/execution/413/model
129 places, 223 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 MedleyA-PT-07-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-07-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717354372512

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-07"
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 MedleyA-PT-07, 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 r575-smll-171734919500049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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