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.r480-tall-171624189700657.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 ltsminxred
Input is DES-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189700657
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 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 DES-PT-05b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-05b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-05b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717192566924

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:56:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:56:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:56:08] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-31 21:56:08] [INFO ] Transformed 300 places.
[2024-05-31 21:56:08] [INFO ] Transformed 251 transitions.
[2024-05-31 21:56:08] [INFO ] Found NUPN structural information;
[2024-05-31 21:56:08] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA DES-PT-05b-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 97 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 251
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 290 transition count 243
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 290 transition count 243
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 288 transition count 241
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 288 transition count 241
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 288 transition count 239
Applied a total of 24 rules in 73 ms. Remains 288 /300 variables (removed 12) and now considering 239/251 (removed 12) transitions.
// Phase 1: matrix 239 rows 288 cols
[2024-05-31 21:56:08] [INFO ] Computed 63 invariants in 24 ms
[2024-05-31 21:56:09] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-31 21:56:09] [INFO ] Invariant cache hit.
[2024-05-31 21:56:09] [INFO ] Implicit Places using invariants and state equation in 325 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 698 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 287/300 places, 239/251 transitions.
Applied a total of 0 rules in 16 ms. Remains 287 /287 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 805 ms. Remains : 287/300 places, 239/251 transitions.
Support contains 97 out of 287 places after structural reductions.
[2024-05-31 21:56:09] [INFO ] Flatten gal took : 45 ms
[2024-05-31 21:56:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-05b-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:56:09] [INFO ] Flatten gal took : 20 ms
[2024-05-31 21:56:09] [INFO ] Input system was already deterministic with 239 transitions.
Support contains 82 out of 287 places (down from 97) after GAL structural reductions.
FORMULA DES-PT-05b-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (340 resets) in 2733 ms. (14 steps per ms) remains 4/50 properties
BEST_FIRST walk for 40004 steps (44 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (49 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (45 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (46 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
// Phase 1: matrix 239 rows 287 cols
[2024-05-31 21:56:11] [INFO ] Computed 62 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/182 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 92/274 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 5/279 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 232/511 variables, 279/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/511 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 7/518 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 4/522 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/522 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/524 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/524 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/526 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/526 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 349 constraints, problems are : Problem set: 0 solved, 4 unsolved in 505 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 125/182 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 92/274 variables, 26/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 3 ms to minimize.
[2024-05-31 21:56:11] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 5/279 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 232/511 variables, 279/346 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/511 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 2 ms to minimize.
[2024-05-31 21:56:12] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/511 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 7/518 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/518 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:56:13] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/518 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 19 (OVERLAPS) 4/522 variables, 2/368 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/522 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/524 variables, 1/369 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/524 variables, 0/369 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/526 variables, 1/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/526 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/526 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 526/526 variables, and 370 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 2907ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 838 ms.
Support contains 4 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 282 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 22 rules applied. Total rules applied 23 place count 282 transition count 213
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 262 transition count 213
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 43 place count 262 transition count 204
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 61 place count 253 transition count 204
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 76 place count 238 transition count 189
Iterating global reduction 2 with 15 rules applied. Total rules applied 91 place count 238 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 238 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 238 transition count 185
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 96 place count 237 transition count 185
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 105 place count 228 transition count 176
Iterating global reduction 3 with 9 rules applied. Total rules applied 114 place count 228 transition count 176
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 121 place count 228 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 121 place count 228 transition count 166
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 127 place count 225 transition count 166
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 281 place count 148 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 147 transition count 89
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 147 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 146 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 146 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 287 place count 146 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 288 place count 145 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 289 place count 144 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 143 transition count 85
Applied a total of 290 rules in 85 ms. Remains 143 /287 variables (removed 144) and now considering 85/239 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 143/287 places, 85/239 transitions.
RANDOM walk for 40000 steps (1647 resets) in 478 ms. (83 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (309 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (311 resets) in 111 ms. (357 steps per ms) remains 1/3 properties
// Phase 1: matrix 85 rows 143 cols
[2024-05-31 21:56:15] [INFO ] Computed 62 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/93 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/124 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/226 variables, 10/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/226 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/228 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 205 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/93 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 31/124 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/131 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 81/212 variables, 131/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/226 variables, 10/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/226 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:56:15] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/226 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/228 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/228 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/228 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/228 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 207 constraints, problems are : Problem set: 0 solved, 1 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 97 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 85/85 transitions.
Graph (complete) has 432 edges and 143 vertex of which 140 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 139 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 138 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 138 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 138 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 8 place count 137 transition count 83
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 137 transition count 83
Applied a total of 9 rules in 16 ms. Remains 137 /143 variables (removed 6) and now considering 83/85 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 137/143 places, 83/85 transitions.
RANDOM walk for 40000 steps (1919 resets) in 220 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (360 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1784821 steps, run timeout after 3001 ms. (steps per millisecond=594 ) properties seen :0 out of 1
Probabilistic random walk after 1784821 steps, saw 254815 distinct states, run finished after 3004 ms. (steps per millisecond=594 ) properties seen :0
// Phase 1: matrix 83 rows 137 cols
[2024-05-31 21:56:18] [INFO ] Computed 60 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/88 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/113 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/120 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/194 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/207 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/209 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/209 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/216 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/216 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/220 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/220 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/220 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/88 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/113 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/120 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/194 variables, 120/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:56:18] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/207 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/207 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/207 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/209 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/209 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/209 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 7/216 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/216 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/216 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/220 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/220 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/220 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 199 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 1 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 137/137 places, 83/83 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 83/83 transitions.
Applied a total of 0 rules in 4 ms. Remains 137 /137 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-05-31 21:56:19] [INFO ] Invariant cache hit.
[2024-05-31 21:56:19] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 21:56:19] [INFO ] Invariant cache hit.
[2024-05-31 21:56:19] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-31 21:56:19] [INFO ] Redundant transitions in 3 ms returned []
Running 80 sub problems to find dead transitions.
[2024-05-31 21:56:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 83/219 variables, 136/196 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-31 21:56:20] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 21:56:21] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (OVERLAPS) 0/220 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 204 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3907 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 6/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 2/136 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 83/219 variables, 136/203 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/219 variables, 80/283 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 1/220 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-05-31 21:56:26] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/220 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 13 (OVERLAPS) 0/220 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 285 constraints, problems are : Problem set: 0 solved, 80 unsolved in 8665 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 8/8 constraints]
After SMT, in 12603ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 12606ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12857 ms. Remains : 137/137 places, 83/83 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 83
Applied a total of 1 rules in 10 ms. Remains 137 /137 variables (removed 0) and now considering 83/83 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 137 cols
[2024-05-31 21:56:31] [INFO ] Computed 60 invariants in 4 ms
[2024-05-31 21:56:31] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-31 21:56:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 21:56:31] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:56:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-31 21:56:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-31 21:56:32] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:56:32] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:56:32] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 198 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 24 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 239 transitions.
Computed a total of 83 stabilizing places and 76 stable transitions
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 267 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 267 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 267 transition count 217
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 53 place count 256 transition count 206
Iterating global reduction 2 with 11 rules applied. Total rules applied 64 place count 256 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 71 place count 256 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 255 transition count 198
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 255 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 255 transition count 197
Applied a total of 74 rules in 20 ms. Remains 255 /287 variables (removed 32) and now considering 197/239 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 255/287 places, 197/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 197 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 268 transition count 221
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 268 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 268 transition count 218
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 50 place count 258 transition count 208
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 258 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 258 transition count 201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 257 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 257 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 257 transition count 199
Applied a total of 70 rules in 26 ms. Remains 257 /287 variables (removed 30) and now considering 199/239 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 257/287 places, 199/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 215
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 260 transition count 206
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 251 transition count 206
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 236 transition count 191
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 236 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 236 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 236 transition count 187
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 90 place count 235 transition count 187
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 100 place count 225 transition count 177
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 225 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 120 place count 225 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 223 transition count 166
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 123 place count 223 transition count 163
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 220 transition count 163
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 269 place count 150 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 148 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 272 place count 147 transition count 91
Applied a total of 272 rules in 56 ms. Remains 147 /287 variables (removed 140) and now considering 91/239 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 147/287 places, 91/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 91 transitions.
RANDOM walk for 7728 steps (236 resets) in 39 ms. (193 steps per ms) remains 0/1 properties
FORMULA DES-PT-05b-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 215
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 260 transition count 206
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 251 transition count 206
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 69 place count 237 transition count 192
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 237 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 86 place count 237 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 237 transition count 188
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 88 place count 236 transition count 188
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 97 place count 227 transition count 179
Iterating global reduction 3 with 9 rules applied. Total rules applied 106 place count 227 transition count 179
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 115 place count 227 transition count 170
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 225 transition count 169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 118 place count 225 transition count 166
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 124 place count 222 transition count 166
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 266 place count 151 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 149 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 269 place count 148 transition count 93
Applied a total of 269 rules in 50 ms. Remains 148 /287 variables (removed 139) and now considering 93/239 (removed 146) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 148/287 places, 93/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 266 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 266 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 266 transition count 216
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 55 place count 255 transition count 205
Iterating global reduction 2 with 11 rules applied. Total rules applied 66 place count 255 transition count 205
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 73 place count 255 transition count 198
Applied a total of 73 rules in 19 ms. Remains 255 /287 variables (removed 32) and now considering 198/239 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 255/287 places, 198/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 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 17 rules applied. Total rules applied 18 place count 278 transition count 216
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 261 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 37 place count 260 transition count 207
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 252 transition count 207
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 66 place count 239 transition count 194
Iterating global reduction 3 with 13 rules applied. Total rules applied 79 place count 239 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 239 transition count 192
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 91 place count 229 transition count 182
Iterating global reduction 4 with 10 rules applied. Total rules applied 101 place count 229 transition count 182
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 111 place count 229 transition count 172
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 114 place count 227 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 114 place count 227 transition count 169
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 118 place count 225 transition count 169
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 252 place count 158 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 254 place count 156 transition count 100
Applied a total of 254 rules in 45 ms. Remains 156 /287 variables (removed 131) and now considering 100/239 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 156/287 places, 100/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 266 transition count 219
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 266 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 266 transition count 216
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 56 place count 254 transition count 204
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 254 transition count 204
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 76 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 253 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 253 transition count 194
Applied a total of 79 rules in 25 ms. Remains 253 /287 variables (removed 34) and now considering 194/239 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 253/287 places, 194/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 194 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 270 transition count 223
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 270 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 260 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 260 transition count 210
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 63 place count 260 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 259 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 259 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 259 transition count 201
Applied a total of 66 rules in 24 ms. Remains 259 /287 variables (removed 28) and now considering 201/239 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 259/287 places, 201/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 267 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 267 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 267 transition count 217
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 53 place count 256 transition count 206
Iterating global reduction 2 with 11 rules applied. Total rules applied 64 place count 256 transition count 206
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 71 place count 256 transition count 199
Applied a total of 71 rules in 17 ms. Remains 256 /287 variables (removed 31) and now considering 199/239 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 256/287 places, 199/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 17 place count 270 transition count 223
Iterating global reduction 1 with 16 rules applied. Total rules applied 33 place count 270 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 270 transition count 220
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 44 place count 262 transition count 212
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 262 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 57 place count 262 transition count 207
Applied a total of 57 rules in 18 ms. Remains 262 /287 variables (removed 25) and now considering 207/239 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 262/287 places, 207/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 286 transition count 239
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 267 transition count 220
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 267 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 42 place count 267 transition count 217
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 52 place count 257 transition count 207
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 257 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 69 place count 257 transition count 200
Applied a total of 69 rules in 18 ms. Remains 257 /287 variables (removed 30) and now considering 200/239 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 257/287 places, 200/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Graph (complete) has 535 edges and 287 vertex of which 279 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 278 transition count 215
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 260 transition count 215
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 37 place count 260 transition count 206
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 55 place count 251 transition count 206
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 70 place count 236 transition count 191
Iterating global reduction 2 with 15 rules applied. Total rules applied 85 place count 236 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 236 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 236 transition count 187
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 90 place count 235 transition count 187
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 100 place count 225 transition count 177
Iterating global reduction 3 with 10 rules applied. Total rules applied 110 place count 225 transition count 177
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 120 place count 225 transition count 167
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 223 transition count 166
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 123 place count 223 transition count 163
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 220 transition count 163
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 271 place count 149 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 147 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 146 transition count 90
Applied a total of 274 rules in 36 ms. Remains 146 /287 variables (removed 141) and now considering 90/239 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 146/287 places, 90/239 transitions.
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:56:32] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:56:32] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 273 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 273 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 273 transition count 223
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 38 place count 265 transition count 215
Iterating global reduction 1 with 8 rules applied. Total rules applied 46 place count 265 transition count 215
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 265 transition count 210
Applied a total of 51 rules in 16 ms. Remains 265 /287 variables (removed 22) and now considering 210/239 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 265/287 places, 210/239 transitions.
[2024-05-31 21:56:33] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:33] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:56:33] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-31 21:56:33] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:56:33] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:56:33] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 21:56:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 287 places, 239 transitions and 715 arcs took 2 ms.
Total runtime 24761 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-00
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-01
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-03
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-05
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-06
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-07
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-08
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-10
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2024-11
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2023-13
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2023-14
Could not compute solution for formula : DES-PT-05b-CTLCardinality-2023-15

BK_STOP 1717192593480

--------------------
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
mcc2024
ctl formula name DES-PT-05b-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/633/ctl_0_
ctl formula name DES-PT-05b-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/633/ctl_1_
ctl formula name DES-PT-05b-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/633/ctl_2_
ctl formula name DES-PT-05b-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/633/ctl_3_
ctl formula name DES-PT-05b-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/633/ctl_4_
ctl formula name DES-PT-05b-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/633/ctl_5_
ctl formula name DES-PT-05b-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/633/ctl_6_
ctl formula name DES-PT-05b-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/633/ctl_7_
ctl formula name DES-PT-05b-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/633/ctl_8_
ctl formula name DES-PT-05b-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/633/ctl_9_
ctl formula name DES-PT-05b-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/633/ctl_10_
ctl formula name DES-PT-05b-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/633/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="DES-PT-05b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-05b, 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 r480-tall-171624189700657"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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