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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 20:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 20:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:07 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 50K 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-04-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717200895183

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:14:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:14:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:14:56] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 00:14:56] [INFO ] Transformed 123 places.
[2024-06-01 00:14:56] [INFO ] Transformed 239 transitions.
[2024-06-01 00:14:56] [INFO ] Found NUPN structural information;
[2024-06-01 00:14:56] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
Support contains 79 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 231/231 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 203
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 203
Applied a total of 32 rules in 21 ms. Remains 107 /123 variables (removed 16) and now considering 203/231 (removed 28) transitions.
[2024-06-01 00:14:56] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
// Phase 1: matrix 199 rows 107 cols
[2024-06-01 00:14:56] [INFO ] Computed 10 invariants in 9 ms
[2024-06-01 00:14:56] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 00:14:56] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
[2024-06-01 00:14:56] [INFO ] Invariant cache hit.
[2024-06-01 00:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:14:56] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2024-06-01 00:14:56] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
[2024-06-01 00:14:56] [INFO ] Invariant cache hit.
[2024-06-01 00:14:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:14:58] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 11 ms to minimize.
[2024-06-01 00:14:58] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-06-01 00:14:59] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 7 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 2 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 5 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:15:01] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:15:02] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:15:03] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:15:03] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:03] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:15:03] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 2 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 6 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:15:04] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 14/78 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:05] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 198/305 variables, 107/186 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (OVERLAPS) 1/306 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:08] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:15:08] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:15:10] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:15:10] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 192 constraints, problems are : Problem set: 0 solved, 202 unsolved in 16718 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 74/84 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:14] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:15:14] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (OVERLAPS) 198/305 variables, 107/193 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 202/395 constraints. Problems are: Problem set: 0 solved, 202 unsolved
[2024-06-01 00:15:17] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:15:17] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (OVERLAPS) 1/306 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 12 (OVERLAPS) 0/306 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 398 constraints, problems are : Problem set: 0 solved, 202 unsolved in 18239 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 78/78 constraints]
After SMT, in 35083ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 35111ms
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 203/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35494 ms. Remains : 107/123 places, 203/231 transitions.
Support contains 79 out of 107 places after structural reductions.
[2024-06-01 00:15:32] [INFO ] Flatten gal took : 35 ms
[2024-06-01 00:15:32] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:15:32] [INFO ] Input system was already deterministic with 203 transitions.
Support contains 78 out of 107 places (down from 79) after GAL structural reductions.
RANDOM walk for 40000 steps (3142 resets) in 1871 ms. (21 steps per ms) remains 29/68 properties
BEST_FIRST walk for 4003 steps (46 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (43 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (45 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (45 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (44 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (45 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (41 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (44 resets) in 15 ms. (250 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4004 steps (41 resets) in 12 ms. (308 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (41 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (46 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (43 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (44 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (44 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (45 resets) in 13 ms. (285 steps per ms) remains 24/26 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
[2024-06-01 00:15:33] [INFO ] Flow matrix only has 199 transitions (discarded 4 similar events)
[2024-06-01 00:15:33] [INFO ] Invariant cache hit.
[2024-06-01 00:15:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 41/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 3 (OVERLAPS) 28/107 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 198/305 variables, 107/117 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/306 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 118 constraints, problems are : Problem set: 1 solved, 23 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 42/79 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-01 00:15:33] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:15:33] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 22 unsolved
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/17 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 5 (OVERLAPS) 28/107 variables, 6/23 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:15:34] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
Problem AtomicPropp45 is UNSAT
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 11/34 constraints. Problems are: Problem set: 4 solved, 20 unsolved
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 2/36 constraints. Problems are: Problem set: 4 solved, 20 unsolved
[2024-06-01 00:15:35] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 1/37 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/37 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 198/305 variables, 107/144 constraints. Problems are: Problem set: 4 solved, 20 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 20/164 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/164 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 1/306 variables, 1/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/165 constraints. Problems are: Problem set: 5 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 165 constraints, problems are : Problem set: 5 solved, 19 unsolved in 2677 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/24 constraints, Known Traps: 27/27 constraints]
After SMT, in 3348ms problems are : Problem set: 5 solved, 19 unsolved
Parikh walk visited 18 properties in 615 ms.
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 151 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 373 edges and 104 vertex of which 100 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 100 transition count 189
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 8 rules applied. Total rules applied 13 place count 97 transition count 184
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 16 place count 95 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 95 transition count 182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 94 transition count 182
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 62 place count 50 transition count 94
Iterating global reduction 3 with 44 rules applied. Total rules applied 106 place count 50 transition count 94
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 116 place count 40 transition count 74
Iterating global reduction 3 with 10 rules applied. Total rules applied 126 place count 40 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 130 place count 40 transition count 70
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 133 place count 37 transition count 61
Iterating global reduction 4 with 3 rules applied. Total rules applied 136 place count 37 transition count 61
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 139 place count 34 transition count 55
Iterating global reduction 4 with 3 rules applied. Total rules applied 142 place count 34 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 145 place count 34 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 155 place count 29 transition count 75
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 29 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 28 transition count 74
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 160 place count 28 transition count 129
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 165 place count 25 transition count 127
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 166 place count 24 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 24 transition count 96
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 168 place count 23 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 23 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 173 place count 23 transition count 90
Applied a total of 173 rules in 54 ms. Remains 23 /107 variables (removed 84) and now considering 90/203 (removed 113) transitions.
Running 74 sub problems to find dead transitions.
[2024-06-01 00:15:37] [INFO ] Flow matrix only has 70 transitions (discarded 20 similar events)
// Phase 1: matrix 70 rows 23 cols
[2024-06-01 00:15:37] [INFO ] Computed 6 invariants in 5 ms
[2024-06-01 00:15:37] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
At refinement iteration 3 (OVERLAPS) 70/93 variables, 23/29 constraints. Problems are: Problem set: 8 solved, 66 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 12/41 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 41 constraints, problems are : Problem set: 10 solved, 64 unsolved in 670 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 70/93 variables, 23/29 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 12/41 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 64/105 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/105 constraints. Problems are: Problem set: 10 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/105 constraints. Problems are: Problem set: 10 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 105 constraints, problems are : Problem set: 10 solved, 64 unsolved in 981 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 64/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 1757ms problems are : Problem set: 10 solved, 64 unsolved
Search for dead transitions found 10 dead transitions in 1758ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/107 places, 80/203 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 80
Applied a total of 1 rules in 10 ms. Remains 23 /23 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1825 ms. Remains : 23/107 places, 80/203 transitions.
RANDOM walk for 1111 steps (180 resets) in 10 ms. (101 steps per ms) remains 0/1 properties
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-01 00:15:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 00:15:38] [INFO ] Flatten gal took : 11 ms
FORMULA HealthRecord-PT-04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 203 transitions.
Computed a total of 11 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 64 transition count 119
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 64 transition count 119
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 57 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 57 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 102 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 55 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 55 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 53 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 53 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 111 place count 53 transition count 92
Applied a total of 111 rules in 8 ms. Remains 53 /107 variables (removed 54) and now considering 92/203 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 53/107 places, 92/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 117
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 117
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 55 transition count 101
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 53 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 53 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 52 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 52 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 114 place count 52 transition count 89
Applied a total of 114 rules in 7 ms. Remains 52 /107 variables (removed 55) and now considering 89/203 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 52/107 places, 89/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 143 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 44 place count 61 transition count 117
Iterating global reduction 0 with 43 rules applied. Total rules applied 87 place count 61 transition count 117
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 97 place count 51 transition count 97
Iterating global reduction 0 with 10 rules applied. Total rules applied 107 place count 51 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 111 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 49 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 47 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 47 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 121 place count 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 47 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 2 with 4 rules applied. Total rules applied 127 place count 45 transition count 77
Applied a total of 127 rules in 19 ms. Remains 45 /107 variables (removed 62) and now considering 77/203 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 45/107 places, 77/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 63 transition count 118
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 63 transition count 118
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 96 place count 55 transition count 102
Iterating global reduction 0 with 8 rules applied. Total rules applied 104 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 55 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 50 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 50 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 50 transition count 84
Applied a total of 119 rules in 6 ms. Remains 50 /107 variables (removed 57) and now considering 84/203 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 50/107 places, 84/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 60 transition count 112
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 60 transition count 112
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 51 transition count 94
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 51 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 114 place count 51 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 48 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 48 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 45 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 45 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 129 place count 45 transition count 74
Applied a total of 129 rules in 8 ms. Remains 45 /107 variables (removed 62) and now considering 74/203 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 45/107 places, 74/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 117 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 58 transition count 112
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 58 transition count 112
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 101 place count 48 transition count 92
Iterating global reduction 0 with 10 rules applied. Total rules applied 111 place count 48 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 116 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 47 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 46 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 46 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 121 place count 46 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 123 place count 46 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 2 with 4 rules applied. Total rules applied 127 place count 44 transition count 77
Applied a total of 127 rules in 16 ms. Remains 44 /107 variables (removed 63) and now considering 77/203 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 44/107 places, 77/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 58 transition count 108
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 58 transition count 108
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 48 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 48 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 122 place count 48 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 46 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 46 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 44 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 44 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 132 place count 44 transition count 72
Applied a total of 132 rules in 5 ms. Remains 44 /107 variables (removed 63) and now considering 72/203 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 44/107 places, 72/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 58 transition count 108
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 58 transition count 108
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 48 transition count 88
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 48 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 122 place count 48 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 45 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 45 transition count 75
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 42 transition count 69
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 42 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 137 place count 42 transition count 66
Applied a total of 137 rules in 4 ms. Remains 42 /107 variables (removed 65) and now considering 66/203 (removed 137) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/107 places, 66/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 59 transition count 110
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 59 transition count 110
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 105 place count 50 transition count 92
Iterating global reduction 0 with 9 rules applied. Total rules applied 114 place count 50 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 117 place count 50 transition count 89
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 47 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 47 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 45 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 45 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 129 place count 45 transition count 74
Applied a total of 129 rules in 3 ms. Remains 45 /107 variables (removed 62) and now considering 74/203 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/107 places, 74/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 62 transition count 116
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 62 transition count 116
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 54 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 54 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 107 place count 54 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 51 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 51 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 49 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 49 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 119 place count 49 transition count 84
Applied a total of 119 rules in 4 ms. Remains 49 /107 variables (removed 58) and now considering 84/203 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/107 places, 84/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 148 edges and 107 vertex of which 8 / 107 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 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 58 transition count 113
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 58 transition count 113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 49 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 49 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 111 place count 49 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 48 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 48 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 47 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 47 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 116 place count 47 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 47 transition count 82
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 2 with 4 rules applied. Total rules applied 123 place count 45 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 44 transition count 79
Applied a total of 124 rules in 15 ms. Remains 44 /107 variables (removed 63) and now considering 79/203 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 44/107 places, 79/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Graph (trivial) has 147 edges and 107 vertex of which 8 / 107 are part of one of the 4 SCC in 1 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 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 58 transition count 113
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 58 transition count 113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 98 place count 49 transition count 95
Iterating global reduction 0 with 9 rules applied. Total rules applied 107 place count 49 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 110 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 47 transition count 86
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 45 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 45 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 45 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 123 place count 45 transition count 77
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 127 place count 43 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 42 transition count 74
Applied a total of 128 rules in 14 ms. Remains 42 /107 variables (removed 65) and now considering 74/203 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 42/107 places, 74/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 62 transition count 116
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 62 transition count 116
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 99 place count 53 transition count 98
Iterating global reduction 0 with 9 rules applied. Total rules applied 108 place count 53 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 111 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 50 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 50 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 49 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 120 place count 49 transition count 83
Applied a total of 120 rules in 3 ms. Remains 49 /107 variables (removed 58) and now considering 83/203 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/107 places, 83/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 57 transition count 106
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 57 transition count 106
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 110 place count 47 transition count 86
Iterating global reduction 0 with 10 rules applied. Total rules applied 120 place count 47 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 124 place count 47 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 44 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 44 transition count 73
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 133 place count 41 transition count 67
Iterating global reduction 1 with 3 rules applied. Total rules applied 136 place count 41 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 139 place count 41 transition count 64
Applied a total of 139 rules in 3 ms. Remains 41 /107 variables (removed 66) and now considering 64/203 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 41/107 places, 64/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 203/203 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 64 transition count 120
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 64 transition count 120
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 55 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 55 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 55 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 53 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 52 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 52 transition count 92
Applied a total of 112 rules in 3 ms. Remains 52 /107 variables (removed 55) and now considering 92/203 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 52/107 places, 92/203 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:15:39] [INFO ] Input system was already deterministic with 92 transitions.
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:15:39] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:15:39] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:15:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 203 transitions and 536 arcs took 2 ms.
Total runtime 43118 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-04-CTLFireability-2024-00
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-09
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2023-13
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-04-CTLFireability-2023-15

BK_STOP 1717200939884

--------------------
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-04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/839/ctl_0_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/839/ctl_1_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/839/ctl_2_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/839/ctl_3_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/839/ctl_4_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/839/ctl_5_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/839/ctl_6_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/839/ctl_7_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/839/ctl_8_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/839/ctl_9_
ctl formula name HealthRecord-PT-04-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/839/ctl_10_
ctl formula name HealthRecord-PT-04-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/839/ctl_11_
ctl formula name HealthRecord-PT-04-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/839/ctl_12_
ctl formula name HealthRecord-PT-04-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/839/ctl_13_
ctl formula name HealthRecord-PT-04-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/839/ctl_14_
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-04"
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-04, 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-171640604000722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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