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-171640604100754.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-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604100754
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 20:17 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 68K 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-08-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-08-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717201181120

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:19:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:19:42] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-06-01 00:19:42] [INFO ] Transformed 156 places.
[2024-06-01 00:19:42] [INFO ] Transformed 326 transitions.
[2024-06-01 00:19:42] [INFO ] Found NUPN structural information;
[2024-06-01 00:19:42] [INFO ] Parsed PT model containing 156 places and 326 transitions and 855 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 69 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 300/300 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 112 transition count 217
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 112 transition count 217
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 90 place count 110 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 92 place count 110 transition count 213
Applied a total of 92 rules in 24 ms. Remains 110 /156 variables (removed 46) and now considering 213/300 (removed 87) transitions.
[2024-06-01 00:19:42] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
// Phase 1: matrix 206 rows 110 cols
[2024-06-01 00:19:42] [INFO ] Computed 13 invariants in 13 ms
[2024-06-01 00:19:42] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 00:19:42] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-06-01 00:19:42] [INFO ] Invariant cache hit.
[2024-06-01 00:19:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:19:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-01 00:19:42] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-06-01 00:19:42] [INFO ] Invariant cache hit.
[2024-06-01 00:19:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 10 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:19:44] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:45] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:19:46] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 1 ms to minimize.
[2024-06-01 00:19:46] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:19:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:46] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:47] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:47] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:19:47] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 205/315 variables, 110/144 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:49] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:19:49] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/316 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 147 constraints, problems are : Problem set: 0 solved, 212 unsolved in 11375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 23/36 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:55] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:56] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 205/315 variables, 110/152 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 212/364 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:19:57] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:19:59] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 4 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:00] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 6/372 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (OVERLAPS) 1/316 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:06] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (OVERLAPS) 0/316 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 375 constraints, problems are : Problem set: 0 solved, 212 unsolved in 20266 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 39/39 constraints]
After SMT, in 31814ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 31830ms
Starting structural reductions in LTL mode, iteration 1 : 110/156 places, 213/300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32268 ms. Remains : 110/156 places, 213/300 transitions.
Support contains 69 out of 110 places after structural reductions.
[2024-06-01 00:20:15] [INFO ] Flatten gal took : 69 ms
[2024-06-01 00:20:15] [INFO ] Flatten gal took : 28 ms
[2024-06-01 00:20:15] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 64 out of 110 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (2227 resets) in 1628 ms. (24 steps per ms) remains 20/58 properties
BEST_FIRST walk for 4004 steps (28 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (32 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 62 ms. (63 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (28 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (25 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (27 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (28 resets) in 8 ms. (444 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 7 ms. (500 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
[2024-06-01 00:20:16] [INFO ] Flow matrix only has 206 transitions (discarded 7 similar events)
[2024-06-01 00:20:16] [INFO ] Invariant cache hit.
[2024-06-01 00:20:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/71 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 3 (OVERLAPS) 39/110 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:20:16] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 9/23 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 205/315 variables, 110/133 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:17] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 2/135 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/316 variables, 1/136 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/316 variables, 0/136 constraints. Problems are: Problem set: 2 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 136 constraints, problems are : Problem set: 2 solved, 18 unsolved in 2622 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 2 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 43/70 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 5/10 constraints. Problems are: Problem set: 2 solved, 18 unsolved
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:20:18] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
Problem AtomicPropp16 is UNSAT
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 5/15 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 40/110 variables, 8/23 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 7/30 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:19] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 2 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 11/41 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:20:20] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 6/47 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 3/50 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 1/51 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 5/56 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 2/58 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:20:21] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 2/60 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 205/315 variables, 110/171 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 17/188 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 0/188 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 1/316 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/316 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/316 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 17 unsolved
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:20:22] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 22 (OVERLAPS) 0/316 variables, 2/192 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/316 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 0/316 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 192 constraints, problems are : Problem set: 3 solved, 17 unsolved in 4603 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 110/110 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/20 constraints, Known Traps: 51/51 constraints]
After SMT, in 7235ms problems are : Problem set: 3 solved, 17 unsolved
Parikh walk visited 16 properties in 1489 ms.
Support contains 1 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 152 edges and 110 vertex of which 10 / 110 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 452 edges and 105 vertex of which 100 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 100 transition count 190
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 12 rules applied. Total rules applied 19 place count 95 transition count 183
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 93 transition count 182
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 22 place count 93 transition count 179
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 30 place count 88 transition count 179
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 69 place count 49 transition count 101
Iterating global reduction 3 with 39 rules applied. Total rules applied 108 place count 49 transition count 101
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 117 place count 40 transition count 81
Iterating global reduction 3 with 9 rules applied. Total rules applied 126 place count 40 transition count 81
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 135 place count 40 transition count 72
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 138 place count 37 transition count 65
Iterating global reduction 4 with 3 rules applied. Total rules applied 141 place count 37 transition count 65
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 147 place count 37 transition count 59
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 148 place count 36 transition count 57
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 36 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 152 place count 36 transition count 54
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 6 with 2 rules applied. Total rules applied 154 place count 35 transition count 53
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 164 place count 30 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 30 transition count 84
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 167 place count 30 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 169 place count 28 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 171 place count 28 transition count 80
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 28 transition count 129
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 174 place count 27 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 177 place count 27 transition count 125
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 178 place count 26 transition count 98
Iterating global reduction 8 with 1 rules applied. Total rules applied 179 place count 26 transition count 98
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 180 place count 25 transition count 95
Iterating global reduction 8 with 1 rules applied. Total rules applied 181 place count 25 transition count 95
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 191 place count 25 transition count 85
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 200 place count 25 transition count 85
Applied a total of 200 rules in 92 ms. Remains 25 /110 variables (removed 85) and now considering 85/213 (removed 128) transitions.
Running 69 sub problems to find dead transitions.
[2024-06-01 00:20:25] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 25 cols
[2024-06-01 00:20:25] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 00:20:25] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD84 is UNSAT
At refinement iteration 3 (OVERLAPS) 73/98 variables, 25/31 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/51 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 0/98 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 51 constraints, problems are : Problem set: 2 solved, 67 unsolved in 761 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 2/25 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 67 unsolved
At refinement iteration 3 (OVERLAPS) 73/98 variables, 25/31 constraints. Problems are: Problem set: 2 solved, 67 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/51 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 64/115 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/115 constraints. Problems are: Problem set: 5 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 115 constraints, problems are : Problem set: 5 solved, 64 unsolved in 1162 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 64/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 1994ms problems are : Problem set: 5 solved, 64 unsolved
Search for dead transitions found 5 dead transitions in 1997ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/110 places, 80/213 transitions.
Graph (complete) has 93 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 24 transition count 80
Applied a total of 8 rules in 13 ms. Remains 24 /25 variables (removed 1) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2104 ms. Remains : 24/110 places, 80/213 transitions.
RANDOM walk for 40000 steps (9264 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1201 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 631 steps, run visited all 1 properties in 13 ms. (steps per millisecond=48 )
Probabilistic random walk after 631 steps, saw 255 distinct states, run finished after 20 ms. (steps per millisecond=31 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 21 ms
[2024-06-01 00:20:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-08-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 213 transitions.
Support contains 58 out of 110 places (down from 59) after GAL structural reductions.
Computed a total of 7 stabilizing places and 11 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 153 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 60 transition count 124
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 60 transition count 124
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 50 transition count 102
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 117 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 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 129 place count 47 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 46 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 46 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 46 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 44 transition count 67
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 41 transition count 64
Applied a total of 146 rules in 21 ms. Remains 41 /110 variables (removed 69) and now considering 64/213 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 41/110 places, 64/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (3677 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (490 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28686 steps, run visited all 1 properties in 79 ms. (steps per millisecond=363 )
Probabilistic random walk after 28686 steps, saw 5042 distinct states, run finished after 79 ms. (steps per millisecond=363 ) properties seen :1
FORMULA HealthRecord-PT-08-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 63 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 63 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 55 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 55 transition count 105
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 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 52 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 52 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 52 transition count 83
Applied a total of 131 rules in 5 ms. Remains 52 /110 variables (removed 58) and now considering 83/213 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 52/110 places, 83/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 73 transition count 143
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 73 transition count 143
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 66 transition count 129
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 66 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 96 place count 66 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 65 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 65 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 64 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 64 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 64 transition count 114
Applied a total of 102 rules in 5 ms. Remains 64 /110 variables (removed 46) and now considering 114/213 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 64/110 places, 114/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 151 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 61 transition count 126
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 61 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 94 place count 52 transition count 107
Iterating global reduction 0 with 9 rules applied. Total rules applied 103 place count 52 transition count 107
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 113 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 50 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 50 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 49 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 49 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 49 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 49 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 47 transition count 77
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 137 place count 44 transition count 74
Applied a total of 137 rules in 18 ms. Remains 44 /110 variables (removed 66) and now considering 74/213 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 44/110 places, 74/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 62 transition count 121
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 62 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 54 transition count 104
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 54 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 121 place count 54 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 52 transition count 90
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 52 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 128 place count 52 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 51 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 51 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 133 place count 51 transition count 82
Applied a total of 133 rules in 4 ms. Remains 51 /110 variables (removed 59) and now considering 82/213 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 51/110 places, 82/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 153 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 60 transition count 124
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 60 transition count 124
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 50 transition count 102
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 117 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 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 129 place count 47 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 47 transition count 74
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 138 place count 45 transition count 72
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 42 transition count 69
Applied a total of 141 rules in 13 ms. Remains 42 /110 variables (removed 68) and now considering 69/213 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 42/110 places, 69/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 3877 steps (350 resets) in 13 ms. (276 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 70 transition count 137
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 70 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 66 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 66 transition count 129
Applied a total of 88 rules in 2 ms. Remains 66 /110 variables (removed 44) and now considering 129/213 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/110 places, 129/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 65 transition count 126
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 65 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 57 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 57 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 115 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 56 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 56 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 56 transition count 95
Applied a total of 120 rules in 3 ms. Remains 56 /110 variables (removed 54) and now considering 95/213 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 56/110 places, 95/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 133 edges and 110 vertex of which 10 / 110 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.
Reduce places removed 1 places and 1 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 64 transition count 130
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 64 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 90 place count 55 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 99 place count 55 transition count 111
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 106 place count 55 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 54 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 54 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 54 transition count 99
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 115 place count 54 transition count 95
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 119 place count 52 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 50 transition count 91
Applied a total of 121 rules in 13 ms. Remains 50 /110 variables (removed 60) and now considering 91/213 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 50/110 places, 91/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 63 transition count 123
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 63 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 54 transition count 103
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 54 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 51 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 51 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 133 place count 50 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 134 place count 50 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 50 transition count 77
Applied a total of 137 rules in 3 ms. Remains 50 /110 variables (removed 60) and now considering 77/213 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/110 places, 77/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Graph (trivial) has 153 edges and 110 vertex of which 12 / 110 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 60 transition count 124
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 60 transition count 124
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 50 transition count 102
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 117 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 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 129 place count 47 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 130 place count 46 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 46 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 134 place count 46 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 139 place count 46 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 44 transition count 67
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 41 transition count 64
Applied a total of 146 rules in 10 ms. Remains 41 /110 variables (removed 69) and now considering 64/213 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 41/110 places, 64/213 transitions.
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:20:27] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:20:27] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (3679 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (492 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 28686 steps, run visited all 1 properties in 35 ms. (steps per millisecond=819 )
Probabilistic random walk after 28686 steps, saw 5042 distinct states, run finished after 35 ms. (steps per millisecond=819 ) properties seen :1
FORMULA HealthRecord-PT-08-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 64 transition count 125
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 64 transition count 125
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 56 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 56 transition count 108
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 115 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 54 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 53 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 53 transition count 88
Applied a total of 127 rules in 2 ms. Remains 53 /110 variables (removed 57) and now considering 88/213 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 53/110 places, 88/213 transitions.
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:20:28] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 68 transition count 133
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 68 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 62 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 62 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 61 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 61 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 60 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 60 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 109 place count 60 transition count 106
Applied a total of 109 rules in 2 ms. Remains 60 /110 variables (removed 50) and now considering 106/213 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 60/110 places, 106/213 transitions.
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:28] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 213/213 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 65 transition count 127
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 65 transition count 127
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 58 transition count 112
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 56 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 56 transition count 96
Applied a total of 119 rules in 2 ms. Remains 56 /110 variables (removed 54) and now considering 96/213 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 56/110 places, 96/213 transitions.
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:20:28] [INFO ] Input system was already deterministic with 96 transitions.
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:20:28] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:20:28] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:20:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 110 places, 213 transitions and 610 arcs took 2 ms.
Total runtime 45871 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 : HealthRecord-PT-08-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2023-13
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-08-CTLFireability-2023-15

BK_STOP 1717201228480

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/803/ctl_0_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/803/ctl_1_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/803/ctl_2_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/803/ctl_3_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/803/ctl_4_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/803/ctl_5_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/803/ctl_6_
ctl formula name HealthRecord-PT-08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/803/ctl_7_
ctl formula name HealthRecord-PT-08-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/803/ctl_8_
ctl formula name HealthRecord-PT-08-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/803/ctl_9_
ctl formula name HealthRecord-PT-08-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/803/ctl_10_
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-08"
export BK_EXAMINATION="CTLFireability"
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-08, examination is CTLFireability"
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-171640604100754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;