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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 107K 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-10-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717357447354

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:44:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:44:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:44:10] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2024-06-02 19:44:10] [INFO ] Transformed 149 places.
[2024-06-02 19:44:10] [INFO ] Transformed 340 transitions.
[2024-06-02 19:44:10] [INFO ] Found NUPN structural information;
[2024-06-02 19:44:10] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 468 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 25 ms.
Support contains 90 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 136 transition count 327
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 136 transition count 327
Applied a total of 24 rules in 58 ms. Remains 136 /149 variables (removed 13) and now considering 327/340 (removed 13) transitions.
// Phase 1: matrix 327 rows 136 cols
[2024-06-02 19:44:10] [INFO ] Computed 10 invariants in 44 ms
[2024-06-02 19:44:10] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-02 19:44:10] [INFO ] Invariant cache hit.
[2024-06-02 19:44:11] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 878 ms to find 0 implicit places.
Running 326 sub problems to find dead transitions.
[2024-06-02 19:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 326 unsolved
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:16] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 25 ms to minimize.
[2024-06-02 19:44:16] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 3 ms to minimize.
[2024-06-02 19:44:17] [INFO ] Deduced a trap composed of 51 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:44:17] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-06-02 19:44:17] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:44:17] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:44:17] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-06-02 19:44:17] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:44:18] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:44:18] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:44:18] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:44:18] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 12/22 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:20] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 3 ms to minimize.
[2024-06-02 19:44:20] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:44:20] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:44:20] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 3 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 2 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:44:21] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:44:22] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 12/34 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/34 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 327/462 variables, 135/169 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:27] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 3 ms to minimize.
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 64 places in 155 ms of which 2 ms to minimize.
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:44:28] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-06-02 19:44:29] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:44:29] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 9/178 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:31] [INFO ] Deduced a trap composed of 51 places in 130 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/179 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:34] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:44:34] [INFO ] Deduced a trap composed of 32 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:44:34] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 2 ms to minimize.
[2024-06-02 19:44:35] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 4/183 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:40] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:44:40] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:44:40] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/463 variables, and 186 constraints, problems are : Problem set: 64 solved, 262 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 135/136 constraints, PredecessorRefiner: 326/326 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 64 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 41/51 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/51 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 327/462 variables, 135/186 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 261/447 constraints. Problems are: Problem set: 64 solved, 262 unsolved
[2024-06-02 19:44:51] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 2 ms to minimize.
[2024-06-02 19:44:53] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 2 ms to minimize.
[2024-06-02 19:44:53] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 3/450 constraints. Problems are: Problem set: 64 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/450 constraints. Problems are: Problem set: 64 solved, 262 unsolved
SMT process timed out in 61235ms, After SMT, problems are : Problem set: 64 solved, 262 unsolved
Search for dead transitions found 64 dead transitions in 61286ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/149 places, 263/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 136 /136 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62272 ms. Remains : 136/149 places, 263/340 transitions.
Support contains 90 out of 136 places after structural reductions.
[2024-06-02 19:45:12] [INFO ] Flatten gal took : 95 ms
[2024-06-02 19:45:12] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA MedleyA-PT-10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:45:12] [INFO ] Flatten gal took : 36 ms
[2024-06-02 19:45:12] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 84 out of 136 places (down from 90) after GAL structural reductions.
RANDOM walk for 40000 steps (1752 resets) in 2577 ms. (15 steps per ms) remains 37/65 properties
BEST_FIRST walk for 4003 steps (42 resets) in 44 ms. (88 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (42 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (45 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (45 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (46 resets) in 45 ms. (87 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (42 resets) in 42 ms. (93 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (44 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (44 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (37 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (38 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (42 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (38 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (41 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (41 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (42 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (41 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (41 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (39 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (44 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (42 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (40 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (51 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
// Phase 1: matrix 263 rows 136 cols
[2024-06-02 19:45:14] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/90 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 25/115 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 250/365 variables, 115/123 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/123 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 22/387 variables, 14/137 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 2/139 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 10/397 variables, 6/145 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 2/399 variables, 1/146 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/399 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 14 (OVERLAPS) 0/399 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 146 constraints, problems are : Problem set: 1 solved, 35 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 42/89 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-02 19:45:16] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
[2024-06-02 19:45:16] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-02 19:45:16] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 26/115 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 2 ms to minimize.
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 3 ms to minimize.
[2024-06-02 19:45:17] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 3 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 2 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 4 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:45:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 4 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 2 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-06-02 19:45:19] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
Problem AtomicPropp64 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 20/31 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 38 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 42 places in 151 ms of which 2 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 53 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:45:21] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:45:21] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:45:21] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 115/399 variables, and 41 constraints, problems are : Problem set: 2 solved, 34 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/6 constraints, State Equation: 0/136 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 33/33 constraints]
After SMT, in 7130ms problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 133 transition count 249
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 122 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 121 transition count 247
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 27 place count 121 transition count 243
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 35 place count 117 transition count 243
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 45 place count 107 transition count 227
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 107 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 55 place count 107 transition count 226
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 106 transition count 226
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
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 83 place count 93 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 93 transition count 212
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 91 transition count 210
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 91 transition count 210
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 86 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 4 with 38 rules applied. Total rules applied 136 place count 86 transition count 221
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 86 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 85 transition count 220
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 85 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 140 place count 84 transition count 222
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 141 place count 84 transition count 222
Applied a total of 141 rules in 279 ms. Remains 84 /136 variables (removed 52) and now considering 222/263 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 ms. Remains : 84/136 places, 222/263 transitions.
RANDOM walk for 40000 steps (5248 resets) in 1069 ms. (37 steps per ms) remains 15/34 properties
BEST_FIRST walk for 4003 steps (127 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (136 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (145 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (139 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (129 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (136 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (122 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (134 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (139 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (135 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (147 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (145 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (130 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (137 resets) in 13 ms. (286 steps per ms) remains 13/15 properties
BEST_FIRST walk for 4004 steps (136 resets) in 12 ms. (308 steps per ms) remains 13/13 properties
// Phase 1: matrix 222 rows 84 cols
[2024-06-02 19:45:22] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 19:45:22] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 25/82 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 221/303 variables, 82/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 65/158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 3/306 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 10/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/306 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 170 constraints, problems are : Problem set: 0 solved, 13 unsolved in 876 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 8/57 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 25/82 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:45:23] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 8 ms to minimize.
[2024-06-02 19:45:23] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 2 ms to minimize.
[2024-06-02 19:45:23] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 221/303 variables, 82/96 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 65/161 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 13/174 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:45:24] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 5/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 3/306 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 10/191 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:45:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/306 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/306 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:45:25] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/306 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/306 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 0/306 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 197 constraints, problems are : Problem set: 0 solved, 13 unsolved in 4406 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 14/14 constraints]
After SMT, in 5306ms problems are : Problem set: 0 solved, 13 unsolved
Finished Parikh walk after 12612 steps, including 846 resets, run visited all 13 properties in 283 ms. (steps per millisecond=44 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 13 properties in 3128 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:45:30] [INFO ] Flatten gal took : 23 ms
[2024-06-02 19:45:30] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:45:30] [INFO ] Input system was already deterministic with 263 transitions.
Computed a total of 13 stabilizing places and 15 stable transitions
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 132 transition count 244
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 38 place count 116 transition count 239
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 114 transition count 238
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 41 place count 114 transition count 235
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 111 transition count 235
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 71 place count 87 transition count 202
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 87 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 95 place count 87 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 85 transition count 200
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 79 transition count 183
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 79 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 77 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 77 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 76 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 76 transition count 176
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 143 place count 62 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 146 place count 59 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 149 place count 59 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 59 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 59 transition count 155
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 154 place count 58 transition count 155
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 3 with 4 rules applied. Total rules applied 158 place count 56 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 54 transition count 151
Applied a total of 160 rules in 65 ms. Remains 54 /136 variables (removed 82) and now considering 151/263 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 54/136 places, 151/263 transitions.
[2024-06-02 19:45:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:45:30] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:45:30] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 132 transition count 246
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 35 place count 118 transition count 240
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 115 transition count 239
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 39 place count 115 transition count 236
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 112 transition count 236
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 62 place count 95 transition count 213
Iterating global reduction 3 with 17 rules applied. Total rules applied 79 place count 95 transition count 213
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 82 place count 92 transition count 202
Iterating global reduction 3 with 3 rules applied. Total rules applied 85 place count 92 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 91 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 91 transition count 200
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 109 place count 80 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 80 transition count 188
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 78 transition count 186
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 78 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 118 place count 78 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 118 place count 78 transition count 180
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 122 place count 76 transition count 180
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 4 with 4 rules applied. Total rules applied 126 place count 74 transition count 178
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 72 transition count 176
Applied a total of 128 rules in 56 ms. Remains 72 /136 variables (removed 64) and now considering 176/263 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 72/136 places, 176/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 111 transition count 230
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 111 transition count 230
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 111 transition count 227
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 107 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 107 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 106 transition count 217
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 106 transition count 217
Applied a total of 63 rules in 14 ms. Remains 106 /136 variables (removed 30) and now considering 217/263 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 106/136 places, 217/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 102 transition count 221
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 102 transition count 221
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 102 transition count 219
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 95 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 95 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 93 transition count 197
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 93 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 91 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 91 transition count 191
Applied a total of 91 rules in 16 ms. Remains 91 /136 variables (removed 45) and now considering 191/263 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 91/136 places, 191/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 134 transition count 241
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 45 place count 114 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 45 place count 114 transition count 235
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 112 transition count 235
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 73 place count 88 transition count 202
Iterating global reduction 2 with 24 rules applied. Total rules applied 97 place count 88 transition count 202
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 97 place count 88 transition count 200
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 86 transition count 200
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 80 transition count 187
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 80 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 79 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 79 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 78 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 78 transition count 182
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 142 place count 65 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 65 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 63 transition count 165
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 63 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 151 place count 63 transition count 161
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 151 place count 63 transition count 159
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 155 place count 61 transition count 159
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 3 with 4 rules applied. Total rules applied 159 place count 59 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 57 transition count 155
Applied a total of 161 rules in 49 ms. Remains 57 /136 variables (removed 79) and now considering 155/263 (removed 108) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 57/136 places, 155/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 155 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 222
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 222
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 103 transition count 218
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 97 transition count 203
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 97 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 95 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 95 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 94 transition count 195
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 94 transition count 195
Applied a total of 87 rules in 10 ms. Remains 94 /136 variables (removed 42) and now considering 195/263 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 94/136 places, 195/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 195 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 223
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 103 transition count 219
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 96 transition count 203
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 96 transition count 203
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 95 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 95 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 94 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 94 transition count 198
Applied a total of 87 rules in 10 ms. Remains 94 /136 variables (removed 42) and now considering 198/263 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 94/136 places, 198/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 225
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 103 transition count 222
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 75 place count 96 transition count 204
Iterating global reduction 2 with 7 rules applied. Total rules applied 82 place count 96 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 84 place count 94 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 94 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 93 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 93 transition count 197
Applied a total of 88 rules in 10 ms. Remains 93 /136 variables (removed 43) and now considering 197/263 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 93/136 places, 197/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 223
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 103 transition count 221
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 98 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 98 transition count 213
Applied a total of 77 rules in 6 ms. Remains 98 /136 variables (removed 38) and now considering 213/263 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 98/136 places, 213/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 101 transition count 223
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 101 transition count 223
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 101 transition count 219
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 80 place count 94 transition count 201
Iterating global reduction 2 with 7 rules applied. Total rules applied 87 place count 94 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 91 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 91 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 89 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 89 transition count 188
Applied a total of 97 rules in 10 ms. Remains 89 /136 variables (removed 47) and now considering 188/263 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 89/136 places, 188/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Graph (complete) has 491 edges and 136 vertex of which 133 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 132 transition count 239
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 111 transition count 235
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 47 place count 111 transition count 233
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 109 transition count 233
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 75 place count 85 transition count 200
Iterating global reduction 2 with 24 rules applied. Total rules applied 99 place count 85 transition count 200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 99 place count 85 transition count 198
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 103 place count 83 transition count 198
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 111 place count 75 transition count 177
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 75 transition count 177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 121 place count 73 transition count 173
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 73 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 72 transition count 170
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 72 transition count 170
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 151 place count 58 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 58 transition count 157
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 156 place count 54 transition count 149
Iterating global reduction 3 with 4 rules applied. Total rules applied 160 place count 54 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 54 transition count 145
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 164 place count 54 transition count 143
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 52 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 172 place count 50 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 48 transition count 139
Applied a total of 174 rules in 42 ms. Remains 48 /136 variables (removed 88) and now considering 139/263 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 48/136 places, 139/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 139 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 105 transition count 225
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 105 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 65 place count 105 transition count 221
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 102 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 102 transition count 215
Applied a total of 71 rules in 6 ms. Remains 102 /136 variables (removed 34) and now considering 215/263 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 102/136 places, 215/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 263/263 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 33 place count 103 transition count 222
Iterating global reduction 1 with 32 rules applied. Total rules applied 65 place count 103 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 103 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 97 transition count 205
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 97 transition count 205
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 95 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 95 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 94 transition count 198
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 94 transition count 198
Applied a total of 86 rules in 10 ms. Remains 94 /136 variables (removed 42) and now considering 198/263 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 94/136 places, 198/263 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:45:31] [INFO ] Input system was already deterministic with 198 transitions.
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:45:31] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:45:31] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-02 19:45:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 263 transitions and 1181 arcs took 4 ms.
Total runtime 82382 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-10

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/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: 845
MODEL NAME: /home/mcc/execution/414/model
136 places, 263 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-10-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA MedleyA-PT-10-CTLCardinality-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717358661452

--------------------
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
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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

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