About the Execution of LTSMin+red for HealthRecord-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 422.468 | 46486.00 | 70558.00 | 181.40 | ?T?????T??????T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640604100769.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 HealthRecord-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100769
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 20:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K 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 HealthRecord-PT-10-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-10-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717201305218
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:21:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:21:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:21:46] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 00:21:46] [INFO ] Transformed 158 places.
[2024-06-01 00:21:46] [INFO ] Transformed 333 transitions.
[2024-06-01 00:21:46] [INFO ] Found NUPN structural information;
[2024-06-01 00:21:46] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 113 transition count 220
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 113 transition count 220
Applied a total of 90 rules in 21 ms. Remains 113 /158 variables (removed 45) and now considering 220/306 (removed 86) transitions.
[2024-06-01 00:21:46] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 113 cols
[2024-06-01 00:21:46] [INFO ] Computed 14 invariants in 15 ms
[2024-06-01 00:21:46] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-06-01 00:21:46] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-06-01 00:21:46] [INFO ] Invariant cache hit.
[2024-06-01 00:21:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:21:46] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-06-01 00:21:46] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-06-01 00:21:46] [INFO ] Invariant cache hit.
[2024-06-01 00:21:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 11 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 211/324 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:21:50] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/325 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 149 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9210 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:21:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:57] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:57] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 211/324 variables, 113/151 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 219/370 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:21:58] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:58] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:58] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:59] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:22:00] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 5/375 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:22:01] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 1/325 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:22:08] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-06-01 00:22:11] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/325 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (OVERLAPS) 0/325 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 379 constraints, problems are : Problem set: 0 solved, 219 unsolved in 25358 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 32/32 constraints]
After SMT, in 34706ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 34723ms
Starting structural reductions in LTL mode, iteration 1 : 113/158 places, 220/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35117 ms. Remains : 113/158 places, 220/306 transitions.
Support contains 75 out of 113 places after structural reductions.
[2024-06-01 00:22:21] [INFO ] Flatten gal took : 38 ms
[2024-06-01 00:22:21] [INFO ] Flatten gal took : 15 ms
[2024-06-01 00:22:21] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 66 out of 113 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (2536 resets) in 1597 ms. (25 steps per ms) remains 20/42 properties
BEST_FIRST walk for 4002 steps (31 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (38 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (31 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (33 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (30 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
[2024-06-01 00:22:22] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2024-06-01 00:22:22] [INFO ] Invariant cache hit.
[2024-06-01 00:22:22] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/76 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 37/113 variables, 8/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:22] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:22:22] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:22:22] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 4 ms to minimize.
[2024-06-01 00:22:22] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:22:22] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 11/25 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 14/39 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:23] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 8/47 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 11/58 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:24] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 3/61 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 3/64 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 5/69 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 211/324 variables, 113/182 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:22:25] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 1/325 variables, 1/185 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 1/186 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/187 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 0/325 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 187 constraints, problems are : Problem set: 1 solved, 19 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 44/75 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 19 unsolved
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 5 (OVERLAPS) 38/113 variables, 8/22 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 55/77 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:26] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/79 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 2/81 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 1/82 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 1/83 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 3/86 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/87 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 3/90 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:27] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/113 variables, 1/91 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/113 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 211/324 variables, 113/204 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 17/221 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/324 variables, 0/221 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 1/325 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:22:28] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/325 variables, 1/223 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/325 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/325 variables, 0/223 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 223 constraints, problems are : Problem set: 3 solved, 17 unsolved in 2460 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/20 constraints, Known Traps: 78/78 constraints]
After SMT, in 6502ms problems are : Problem set: 3 solved, 17 unsolved
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 13 properties in 1292 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 150 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 484 edges and 110 vertex of which 105 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output 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 3 place count 105 transition count 204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 104 transition count 203
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 104 transition count 201
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 101 transition count 201
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 51 place count 60 transition count 119
Iterating global reduction 2 with 41 rules applied. Total rules applied 92 place count 60 transition count 119
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 102 place count 50 transition count 99
Iterating global reduction 2 with 10 rules applied. Total rules applied 112 place count 50 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 50 transition count 90
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 124 place count 47 transition count 81
Iterating global reduction 3 with 3 rules applied. Total rules applied 127 place count 47 transition count 81
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 44 transition count 75
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 44 transition count 75
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 142 place count 44 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 148 place count 41 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 41 transition count 62
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 159 place count 36 transition count 93
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 160 place count 36 transition count 92
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 163 place count 36 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 166 place count 33 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 168 place count 33 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 33 transition count 148
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 171 place count 32 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 174 place count 32 transition count 144
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 175 place count 31 transition count 111
Iterating global reduction 7 with 1 rules applied. Total rules applied 176 place count 31 transition count 111
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 177 place count 30 transition count 109
Iterating global reduction 7 with 1 rules applied. Total rules applied 178 place count 30 transition count 109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 188 place count 30 transition count 99
Applied a total of 188 rules in 66 ms. Remains 30 /113 variables (removed 83) and now considering 99/220 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 30/113 places, 99/220 transitions.
RANDOM walk for 40000 steps (7401 resets) in 403 ms. (99 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (987 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (982 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
[2024-06-01 00:22:30] [INFO ] Flow matrix only has 81 transitions (discarded 18 similar events)
// Phase 1: matrix 81 rows 30 cols
[2024-06-01 00:22:30] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 00:22:30] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 00:22:30] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:22:30] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/30 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/111 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 59 constraints, problems are : Problem set: 0 solved, 2 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 14/30 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/111 variables, 30/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 61 constraints, problems are : Problem set: 0 solved, 2 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 99/99 transitions.
Graph (trivial) has 11 edges and 30 vertex of which 2 / 30 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 134 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 28 transition count 96
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 27 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 27 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 26 transition count 95
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 9 place count 26 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 26 transition count 93
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 18 place count 26 transition count 93
Applied a total of 18 rules in 19 ms. Remains 26 /30 variables (removed 4) and now considering 93/99 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 26/30 places, 93/99 transitions.
RANDOM walk for 40000 steps (22 resets) in 201 ms. (198 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (17 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (19 resets) in 354 ms. (112 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 389 steps, run visited all 2 properties in 9 ms. (steps per millisecond=43 )
Probabilistic random walk after 389 steps, saw 169 distinct states, run finished after 12 ms. (steps per millisecond=32 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-10-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 48 out of 113 places (down from 49) after GAL structural reductions.
Computed a total of 8 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 58 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 55 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 55 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 124 place count 52 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 127 place count 52 transition count 95
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 136 place count 52 transition count 86
Applied a total of 136 rules in 6 ms. Remains 52 /113 variables (removed 61) and now considering 86/220 (removed 134) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 52/113 places, 86/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 58 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 119 place count 58 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 55 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 52 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 52 transition count 91
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 140 place count 52 transition count 82
Applied a total of 140 rules in 6 ms. Remains 52 /113 variables (removed 61) and now considering 82/220 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 52/113 places, 82/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 70 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 70 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 62 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 111 place count 62 transition count 114
Applied a total of 111 rules in 4 ms. Remains 62 /113 variables (removed 51) and now considering 114/220 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 62/113 places, 114/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 64 transition count 127
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 64 transition count 127
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 54 transition count 107
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 54 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 54 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 130 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 133 place count 51 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 49 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 49 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 143 place count 49 transition count 79
Applied a total of 143 rules in 5 ms. Remains 49 /113 variables (removed 64) and now considering 79/220 (removed 141) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/113 places, 79/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 70 transition count 139
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 70 transition count 139
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 62 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 62 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 108 place count 62 transition count 117
Applied a total of 108 rules in 4 ms. Remains 62 /113 variables (removed 51) and now considering 117/220 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 62/113 places, 117/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 141 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 63 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 63 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 54 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 54 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 118 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 48 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 138 place count 48 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 142 place count 48 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 45 transition count 73
Applied a total of 148 rules in 17 ms. Remains 45 /113 variables (removed 68) and now considering 73/220 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 45/113 places, 73/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 147 edges and 113 vertex of which 10 / 113 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 65 transition count 135
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 65 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 94 place count 56 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 103 place count 56 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 112 place count 56 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 54 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 118 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 120 place count 52 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 125 place count 52 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 52 transition count 89
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 2 with 4 rules applied. Total rules applied 133 place count 50 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 49 transition count 86
Applied a total of 134 rules in 18 ms. Remains 49 /113 variables (removed 64) and now considering 86/220 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 49/113 places, 86/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 150 edges and 113 vertex of which 6 / 113 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 64 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 64 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 101 place count 54 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 111 place count 54 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 120 place count 54 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 51 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 48 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 48 transition count 86
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 141 place count 48 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 48 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 47 transition count 75
Applied a total of 144 rules in 11 ms. Remains 47 /113 variables (removed 66) and now considering 75/220 (removed 145) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 47/113 places, 75/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 65 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 65 transition count 129
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 106 place count 55 transition count 109
Iterating global reduction 0 with 10 rules applied. Total rules applied 116 place count 55 transition count 109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 124 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 53 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 51 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 51 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 138 place count 51 transition count 85
Applied a total of 138 rules in 3 ms. Remains 51 /113 variables (removed 62) and now considering 85/220 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/113 places, 85/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 64 transition count 127
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 64 transition count 127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 107 place count 55 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 116 place count 55 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 122 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 143 place count 49 transition count 79
Applied a total of 143 rules in 3 ms. Remains 49 /113 variables (removed 64) and now considering 79/220 (removed 141) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/113 places, 79/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 67 transition count 133
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 67 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 101 place count 58 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 58 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 55 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 94
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 136 place count 52 transition count 86
Applied a total of 136 rules in 2 ms. Remains 52 /113 variables (removed 61) and now considering 86/220 (removed 134) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 52/113 places, 86/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 66 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 66 transition count 131
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 58 transition count 115
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 58 transition count 115
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 116 place count 58 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 55 transition count 100
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 55 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 94
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 137 place count 52 transition count 85
Applied a total of 137 rules in 3 ms. Remains 52 /113 variables (removed 61) and now considering 85/220 (removed 135) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 52/113 places, 85/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 220/220 transitions.
Graph (trivial) has 149 edges and 113 vertex of which 8 / 113 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 63 transition count 130
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 63 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 100 place count 54 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 109 place count 54 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 118 place count 54 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 52 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 50 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 50 transition count 93
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 131 place count 50 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 50 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 49 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 48 transition count 84
Applied a total of 136 rules in 15 ms. Remains 48 /113 variables (removed 65) and now considering 84/220 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 48/113 places, 84/220 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:22:31] [INFO ] Input system was already deterministic with 84 transitions.
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:22:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:22:31] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:22:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 220 transitions and 639 arcs took 2 ms.
Total runtime 45114 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-00
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-02
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-03
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-04
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-05
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-06
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-08
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-09
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-10
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2024-11
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2023-12
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2023-13
Could not compute solution for formula : HealthRecord-PT-10-CTLCardinality-2023-15
BK_STOP 1717201351704
--------------------
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 HealthRecord-PT-10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/863/ctl_0_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/863/ctl_1_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/863/ctl_2_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/863/ctl_3_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/863/ctl_4_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/863/ctl_5_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/863/ctl_6_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/863/ctl_7_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/863/ctl_8_
ctl formula name HealthRecord-PT-10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/863/ctl_9_
ctl formula name HealthRecord-PT-10-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/863/ctl_10_
ctl formula name HealthRecord-PT-10-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/863/ctl_11_
ctl formula name HealthRecord-PT-10-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/863/ctl_12_
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="HealthRecord-PT-10"
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 HealthRecord-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 r496-tall-171640604100769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-10.tgz
mv HealthRecord-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 '
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 ;