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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Apr 12 20:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 20:11 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 49K 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-03-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-03-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717200807300

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:13:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:13:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:13:28] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-01 00:13:28] [INFO ] Transformed 121 places.
[2024-06-01 00:13:28] [INFO ] Transformed 232 transitions.
[2024-06-01 00:13:28] [INFO ] Found NUPN structural information;
[2024-06-01 00:13:28] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
Support contains 66 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 225/225 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 97 transition count 184
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 97 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 96 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 96 transition count 182
Applied a total of 50 rules in 22 ms. Remains 96 /121 variables (removed 25) and now considering 182/225 (removed 43) transitions.
[2024-06-01 00:13:28] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
// Phase 1: matrix 181 rows 96 cols
[2024-06-01 00:13:28] [INFO ] Computed 7 invariants in 8 ms
[2024-06-01 00:13:28] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 00:13:28] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
[2024-06-01 00:13:28] [INFO ] Invariant cache hit.
[2024-06-01 00:13:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:13:29] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-06-01 00:13:29] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
[2024-06-01 00:13:29] [INFO ] Invariant cache hit.
[2024-06-01 00:13:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 10 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:13:30] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:13:31] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:32] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:13:32] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:13:32] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:13:32] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:13:32] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 4 ms to minimize.
[2024-06-01 00:13:32] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:33] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:33] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:13:33] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:33] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-06-01 00:13:33] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:34] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:13:35] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 180/276 variables, 96/152 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 1/277 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (OVERLAPS) 0/277 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 153 constraints, problems are : Problem set: 0 solved, 181 unsolved in 10830 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 49/56 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:41] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:42] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:13:42] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:13:42] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:42] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:13:43] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:13:45] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:45] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:13:45] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:13:45] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:46] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 180/276 variables, 96/177 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 181/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 1/277 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-01 00:13:55] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 15 (OVERLAPS) 0/277 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 360 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24690 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 75/75 constraints]
After SMT, in 35630ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 35652ms
Starting structural reductions in LTL mode, iteration 1 : 96/121 places, 182/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36170 ms. Remains : 96/121 places, 182/225 transitions.
Support contains 66 out of 96 places after structural reductions.
[2024-06-01 00:14:05] [INFO ] Flatten gal took : 44 ms
[2024-06-01 00:14:05] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:14:05] [INFO ] Input system was already deterministic with 182 transitions.
Support contains 61 out of 96 places (down from 66) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 68 to 67
RANDOM walk for 40000 steps (2675 resets) in 2050 ms. (19 steps per ms) remains 23/67 properties
BEST_FIRST walk for 4004 steps (38 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (38 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (38 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (39 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (36 resets) in 10 ms. (364 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (42 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (39 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (39 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (34 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (38 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (36 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (43 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (26 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
[2024-06-01 00:14:06] [INFO ] Flow matrix only has 181 transitions (discarded 1 similar events)
[2024-06-01 00:14:06] [INFO ] Invariant cache hit.
[2024-06-01 00:14:06] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/86 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 10/96 variables, 2/7 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 5 (OVERLAPS) 180/276 variables, 96/103 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/103 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/277 variables, 1/104 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 104 constraints, problems are : Problem set: 4 solved, 18 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 62/86 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 18 unsolved
[2024-06-01 00:14:06] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:14:06] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:14:06] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:14:06] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:14:06] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:14:06] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
Problem AtomicPropp50 is UNSAT
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 19/24 constraints. Problems are: Problem set: 6 solved, 16 unsolved
[2024-06-01 00:14:07] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 1/25 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 10/96 variables, 2/27 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 180/276 variables, 96/123 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 16/139 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/139 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/277 variables, 1/140 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/277 variables, 0/140 constraints. Problems are: Problem set: 6 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/277 variables, 0/140 constraints. Problems are: Problem set: 6 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 140 constraints, problems are : Problem set: 6 solved, 16 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/22 constraints, Known Traps: 20/20 constraints]
After SMT, in 2634ms problems are : Problem set: 6 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 15 properties in 248 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 135 edges and 96 vertex of which 10 / 96 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 310 edges and 91 vertex of which 73 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Drop transitions (Empty/Sink Transition effects.) removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 73 transition count 90
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 105 place count 37 transition count 54
Iterating global reduction 1 with 36 rules applied. Total rules applied 141 place count 37 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 141 place count 37 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 151 place count 32 transition count 49
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 162 place count 21 transition count 34
Iterating global reduction 1 with 11 rules applied. Total rules applied 173 place count 21 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 177 place count 21 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 180 place count 18 transition count 24
Iterating global reduction 2 with 3 rules applied. Total rules applied 183 place count 18 transition count 24
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 186 place count 15 transition count 21
Iterating global reduction 2 with 3 rules applied. Total rules applied 189 place count 15 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 192 place count 15 transition count 18
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 3 with 2 rules applied. Total rules applied 194 place count 14 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 195 place count 13 transition count 16
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 200 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 205 place count 8 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 205 place count 8 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 7 transition count 10
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 208 place count 7 transition count 9
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 5 with 2 rules applied. Total rules applied 210 place count 6 transition count 8
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 211 place count 6 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 216 place count 4 transition count 4
Applied a total of 216 rules in 36 ms. Remains 4 /96 variables (removed 92) and now considering 4/182 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 4/96 places, 4/182 transitions.
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-06-01 00:14:08] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:14:08] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:14:08] [INFO ] Input system was already deterministic with 182 transitions.
Computed a total of 10 stabilizing places and 18 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 112 edges and 96 vertex of which 10 / 96 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 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 35 place count 56 transition count 108
Iterating global reduction 0 with 34 rules applied. Total rules applied 69 place count 56 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 77 place count 48 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 85 place count 48 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 88 place count 48 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 46 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 44 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 44 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 44 transition count 78
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 102 place count 44 transition count 73
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 106 place count 42 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 40 transition count 69
Applied a total of 108 rules in 26 ms. Remains 40 /96 variables (removed 56) and now considering 69/182 (removed 113) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 40/96 places, 69/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 65 transition count 120
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 65 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 69 place count 58 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 76 place count 58 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 58 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 56 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 54 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 54 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 88 place count 54 transition count 92
Applied a total of 88 rules in 7 ms. Remains 54 /96 variables (removed 42) and now considering 92/182 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 54/96 places, 92/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 103 edges and 96 vertex of which 10 / 96 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 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 60 transition count 115
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 60 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 69 place count 54 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 75 place count 54 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 76 place count 54 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 53 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 53 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 83 place count 53 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 91 place count 49 transition count 90
Applied a total of 91 rules in 16 ms. Remains 49 /96 variables (removed 47) and now considering 90/182 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 49/96 places, 90/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 60 transition count 110
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 60 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 80 place count 52 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 88 place count 52 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 50 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 50 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 49 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 49 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 49 transition count 81
Applied a total of 99 rules in 6 ms. Remains 49 /96 variables (removed 47) and now considering 81/182 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 49/96 places, 81/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 64 transition count 118
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 64 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 58 transition count 106
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 58 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 58 transition count 104
Applied a total of 78 rules in 5 ms. Remains 58 /96 variables (removed 38) and now considering 104/182 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/96 places, 104/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 135 edges and 96 vertex of which 10 / 96 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 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 53 transition count 102
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 53 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 84 place count 44 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 93 place count 44 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 97 place count 44 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 42 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 42 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 40 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 40 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 40 transition count 68
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 112 place count 40 transition count 63
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 116 place count 38 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 36 transition count 59
Applied a total of 118 rules in 17 ms. Remains 36 /96 variables (removed 60) and now considering 59/182 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 36/96 places, 59/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 59 transitions.
RANDOM walk for 28658 steps (2915 resets) in 103 ms. (275 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 109 edges and 96 vertex of which 10 / 96 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 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 55 transition count 105
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 55 transition count 105
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 81 place count 47 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 89 place count 47 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 93 place count 47 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 45 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 43 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 43 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 103 place count 43 transition count 73
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 108 place count 43 transition count 68
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 114 place count 40 transition count 65
Applied a total of 114 rules in 24 ms. Remains 40 /96 variables (removed 56) and now considering 65/182 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 40/96 places, 65/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 56 transition count 102
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 56 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 89 place count 47 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 98 place count 47 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 47 transition count 80
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 44 transition count 71
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 44 transition count 71
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 42 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 42 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 114 place count 42 transition count 65
Applied a total of 114 rules in 5 ms. Remains 42 /96 variables (removed 54) and now considering 65/182 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/96 places, 65/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 59 transition count 108
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 59 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 51 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 51 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 51 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 50 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 50 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 49 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 49 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 49 transition count 82
Applied a total of 99 rules in 5 ms. Remains 49 /96 variables (removed 47) and now considering 82/182 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/96 places, 82/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 123 edges and 96 vertex of which 10 / 96 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 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 53 transition count 102
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 53 transition count 102
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 83 place count 45 transition count 86
Iterating global reduction 0 with 8 rules applied. Total rules applied 91 place count 45 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 45 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 43 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 43 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 41 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 41 transition count 70
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 110 place count 41 transition count 65
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 114 place count 39 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 37 transition count 61
Applied a total of 116 rules in 16 ms. Remains 37 /96 variables (removed 59) and now considering 61/182 (removed 121) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 37/96 places, 61/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 61 transitions.
RANDOM walk for 40000 steps (4064 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (612 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4213 steps, run visited all 1 properties in 13 ms. (steps per millisecond=324 )
Probabilistic random walk after 4213 steps, saw 1031 distinct states, run finished after 17 ms. (steps per millisecond=247 ) properties seen :1
FORMULA HealthRecord-PT-03-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 128 edges and 96 vertex of which 8 / 96 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 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 56 transition count 107
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 56 transition count 107
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 79 place count 48 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 87 place count 48 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 90 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 45 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 45 transition count 79
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 42 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 42 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 42 transition count 70
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 109 place count 42 transition count 66
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 113 place count 40 transition count 64
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 39 transition count 63
Applied a total of 114 rules in 11 ms. Remains 39 /96 variables (removed 57) and now considering 63/182 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 39/96 places, 63/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 60 transition count 110
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 60 transition count 110
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 78 place count 54 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 84 place count 54 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 85 place count 54 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 51 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 48 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 48 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 100 place count 48 transition count 79
Applied a total of 100 rules in 3 ms. Remains 48 /96 variables (removed 48) and now considering 79/182 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/96 places, 79/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 57 transition count 104
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 57 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 84 place count 51 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 90 place count 51 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 51 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 49 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 49 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 47 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 47 transition count 80
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 47 transition count 78
Applied a total of 102 rules in 3 ms. Remains 47 /96 variables (removed 49) and now considering 78/182 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 47/96 places, 78/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 135 edges and 96 vertex of which 10 / 96 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 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 54 transition count 104
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 54 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 81 place count 46 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 89 place count 46 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 93 place count 46 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 44 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 44 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 42 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 42 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 103 place count 42 transition count 72
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 108 place count 42 transition count 67
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 112 place count 40 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 38 transition count 63
Applied a total of 114 rules in 9 ms. Remains 38 /96 variables (removed 58) and now considering 63/182 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 38/96 places, 63/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 40000 steps (4044 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (584 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4224 steps, run visited all 1 properties in 10 ms. (steps per millisecond=422 )
Probabilistic random walk after 4224 steps, saw 1036 distinct states, run finished after 10 ms. (steps per millisecond=422 ) properties seen :1
FORMULA HealthRecord-PT-03-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Graph (trivial) has 133 edges and 96 vertex of which 10 / 96 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 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 54 transition count 104
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 54 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 82 place count 45 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 91 place count 45 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 95 place count 45 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 43 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 43 transition count 76
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 41 transition count 72
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 41 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 41 transition count 70
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 109 place count 41 transition count 66
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 111 place count 40 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 38 transition count 63
Applied a total of 113 rules in 24 ms. Remains 38 /96 variables (removed 58) and now considering 63/182 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 38/96 places, 63/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 182/182 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 59 transition count 108
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 59 transition count 108
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 50 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 50 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 96 place count 50 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 47 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 47 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 45 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 45 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 45 transition count 71
Applied a total of 108 rules in 2 ms. Remains 45 /96 variables (removed 51) and now considering 71/182 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/96 places, 71/182 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:14:09] [INFO ] Input system was already deterministic with 71 transitions.
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:14:09] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:14:09] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:14:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 182 transitions and 477 arcs took 2 ms.
Total runtime 41248 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-03-CTLFireability-2024-00
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-03-CTLFireability-2023-15

BK_STOP 1717200850103

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-03-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/812/ctl_0_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/812/ctl_1_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/812/ctl_2_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/812/ctl_3_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/812/ctl_4_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/812/ctl_5_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/812/ctl_6_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/812/ctl_7_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/812/ctl_8_
ctl formula name HealthRecord-PT-03-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/812/ctl_9_
ctl formula name HealthRecord-PT-03-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/812/ctl_10_
ctl formula name HealthRecord-PT-03-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/812/ctl_11_
ctl formula name HealthRecord-PT-03-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/812/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-03"
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-03, 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-171640604000714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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