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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:30 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 73K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-15-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717201669063

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:27:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:27:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:27:50] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 00:27:50] [INFO ] Transformed 163 places.
[2024-06-01 00:27:50] [INFO ] Transformed 348 transitions.
[2024-06-01 00:27:50] [INFO ] Found NUPN structural information;
[2024-06-01 00:27:50] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 126 transition count 248
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 126 transition count 248
Applied a total of 74 rules in 23 ms. Remains 126 /163 variables (removed 37) and now considering 248/319 (removed 71) transitions.
[2024-06-01 00:27:50] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
// Phase 1: matrix 239 rows 126 cols
[2024-06-01 00:27:50] [INFO ] Computed 15 invariants in 20 ms
[2024-06-01 00:27:50] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 00:27:50] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-06-01 00:27:50] [INFO ] Invariant cache hit.
[2024-06-01 00:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:27:50] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-06-01 00:27:50] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-06-01 00:27:50] [INFO ] Invariant cache hit.
[2024-06-01 00:27:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 13 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:52] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 2 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:27:53] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 5 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:54] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 2 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 3 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:27:55] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 8 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:27:56] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:27:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:27:58] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 0 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:27:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 4 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:00] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 6/121 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:28:01] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:28:02] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:03] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:03] [INFO ] Deduced a trap composed of 51 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:28:04] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:28:05] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:05] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:28:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:06] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:28:06] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:28:06] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:07] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:07] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:07] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:08] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:08] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:08] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/126 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/126 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 16 (OVERLAPS) 238/364 variables, 126/272 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 0 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:28:11] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:12] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/364 variables, 9/281 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/364 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 19 (OVERLAPS) 1/365 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:15] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/365 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 365/365 variables, and 283 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 141/156 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 238/364 variables, 126/282 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 247/529 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:24] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:28:24] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:28:30] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 10 (OVERLAPS) 1/365 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 534 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 145/145 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 126/163 places, 248/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 126/163 places, 248/319 transitions.
Support contains 87 out of 126 places after structural reductions.
[2024-06-01 00:28:51] [INFO ] Flatten gal took : 48 ms
[2024-06-01 00:28:51] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:28:51] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 77 out of 126 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (3677 resets) in 1294 ms. (30 steps per ms) remains 25/55 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (49 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (47 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (49 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (46 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (46 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (45 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (46 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 9 ms. (400 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (48 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (47 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (47 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (48 resets) in 10 ms. (364 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (47 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (45 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (44 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
[2024-06-01 00:28:52] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-06-01 00:28:52] [INFO ] Invariant cache hit.
[2024-06-01 00:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 47/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 44/126 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 00:28:52] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 238/364 variables, 126/142 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/365 variables, 1/143 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 143 constraints, problems are : Problem set: 1 solved, 24 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 48/82 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 1 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:53] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 37 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 2 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 14/21 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 44/126 variables, 8/32 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:28:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 20/53 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:28:55] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 20/73 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 8/81 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:56] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 6/87 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 238/364 variables, 126/213 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/364 variables, 24/237 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:28:57] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:28:58] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:28:58] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 9/246 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/364 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 1/365 variables, 1/247 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 247 constraints, problems are : Problem set: 1 solved, 24 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 81/81 constraints]
After SMT, in 6365ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 109 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 541 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 32 place count 91 transition count 175
Iterating global reduction 0 with 30 rules applied. Total rules applied 62 place count 91 transition count 175
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 86 transition count 165
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 86 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 86 transition count 160
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 93 place count 78 transition count 206
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 97 place count 78 transition count 202
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 78 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 77 transition count 201
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 119 place count 77 transition count 201
Applied a total of 119 rules in 62 ms. Remains 77 /126 variables (removed 49) and now considering 201/248 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 77/126 places, 201/248 transitions.
RANDOM walk for 40000 steps (6438 resets) in 581 ms. (68 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (81 resets) in 8 ms. (444 steps per ms) remains 17/22 properties
BEST_FIRST walk for 4004 steps (84 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (90 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (81 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (75 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (83 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (81 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (83 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (86 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (82 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (83 resets) in 6 ms. (572 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (76 resets) in 6 ms. (572 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (81 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (86 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (76 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (82 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (79 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
[2024-06-01 00:28:58] [INFO ] Flow matrix only has 180 transitions (discarded 21 similar events)
// Phase 1: matrix 180 rows 77 cols
[2024-06-01 00:28:58] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 00:28:58] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 34/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 19/77 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 180/257 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 23/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 112 constraints, problems are : Problem set: 0 solved, 17 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 34/58 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 19/77 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:28:59] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 180/257 variables, 77/113 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 23/136 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 17/153 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:29:00] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 00:29:01] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/257 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/257 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 155 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 26/26 constraints]
After SMT, in 2847ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 15 properties in 1166 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 201/201 transitions.
Graph (complete) has 431 edges and 77 vertex of which 73 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 72 transition count 200
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 22 place count 53 transition count 162
Iterating global reduction 2 with 19 rules applied. Total rules applied 41 place count 53 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 45 place count 49 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 49 place count 49 transition count 153
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 51 place count 48 transition count 152
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
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 57 place count 45 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 44 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 44 transition count 165
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 44 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 42 transition count 143
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 42 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 71 place count 40 transition count 139
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 40 transition count 139
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 85 place count 40 transition count 127
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 87 place count 40 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 89 place count 38 transition count 125
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 38 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 37 transition count 124
Applied a total of 91 rules in 44 ms. Remains 37 /77 variables (removed 40) and now considering 124/201 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 37/77 places, 124/201 transitions.
RANDOM walk for 40000 steps (8809 resets) in 540 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1095 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1106 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1979 steps, run visited all 2 properties in 14 ms. (steps per millisecond=141 )
Probabilistic random walk after 1979 steps, saw 665 distinct states, run finished after 17 ms. (steps per millisecond=116 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-06-01 00:29:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 12 ms
FORMULA HealthRecord-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 248 transitions.
Support contains 65 out of 126 places (down from 69) after GAL structural reductions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 111 edges and 126 vertex of which 4 / 126 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 79 transition count 162
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 79 transition count 162
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 95 place count 75 transition count 154
Iterating global reduction 0 with 4 rules applied. Total rules applied 99 place count 75 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 102 place count 75 transition count 151
Applied a total of 102 rules in 12 ms. Remains 75 /126 variables (removed 51) and now considering 151/248 (removed 97) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 75/126 places, 151/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 132
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 132 place count 55 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 142 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 151 place count 55 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 154 place count 52 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 157 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 172 place count 49 transition count 79
Applied a total of 172 rules in 6 ms. Remains 49 /126 variables (removed 77) and now considering 79/248 (removed 169) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/126 places, 79/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 138 place count 60 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 59 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 59 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 58 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 58 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 145 place count 58 transition count 108
Applied a total of 145 rules in 5 ms. Remains 58 /126 variables (removed 68) and now considering 108/248 (removed 140) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 58/126 places, 108/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 65 transition count 132
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 65 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 56 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 56 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 146 place count 56 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 54 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 52 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 52 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 160 place count 52 transition count 92
Applied a total of 160 rules in 4 ms. Remains 52 /126 variables (removed 74) and now considering 92/248 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 52/126 places, 92/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 177 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 131
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 111
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 148 place count 53 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 151 place count 50 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 154 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 47 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 47 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 169 place count 47 transition count 78
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 172 place count 47 transition count 75
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 176 place count 45 transition count 73
Applied a total of 176 rules in 14 ms. Remains 45 /126 variables (removed 81) and now considering 73/248 (removed 175) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 45/126 places, 73/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 67 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 67 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 58 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 58 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 54 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 159 place count 54 transition count 92
Applied a total of 159 rules in 4 ms. Remains 54 /126 variables (removed 72) and now considering 92/248 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/126 places, 92/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 122 place count 61 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 130 place count 61 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 61 transition count 115
Applied a total of 139 rules in 2 ms. Remains 61 /126 variables (removed 65) and now considering 115/248 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 61/126 places, 115/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 68 transition count 138
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 68 transition count 138
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 126 place count 58 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 136 place count 58 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 144 place count 58 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 56 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 56 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 55 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 153 place count 55 transition count 99
Applied a total of 153 rules in 2 ms. Remains 55 /126 variables (removed 71) and now considering 99/248 (removed 149) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/126 places, 99/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 59 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 59 transition count 110
Applied a total of 143 rules in 3 ms. Remains 59 /126 variables (removed 67) and now considering 110/248 (removed 138) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/126 places, 110/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Graph (trivial) has 170 edges and 126 vertex of which 6 / 126 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 65 transition count 136
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 65 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 124 place count 56 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 133 place count 56 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 139 place count 56 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 53 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 50 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 50 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 160 place count 50 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 162 place count 50 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 49 transition count 85
Applied a total of 164 rules in 12 ms. Remains 49 /126 variables (removed 77) and now considering 85/248 (removed 163) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 49/126 places, 85/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 69 transition count 140
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 69 transition count 140
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 60 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 60 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 137 place count 60 transition count 117
Applied a total of 137 rules in 3 ms. Remains 60 /126 variables (removed 66) and now considering 117/248 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 60/126 places, 117/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 74 transition count 148
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 74 transition count 148
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 66 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 66 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 66 transition count 130
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 64 transition count 124
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 64 transition count 124
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 62 transition count 120
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 62 transition count 120
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 135 place count 62 transition count 115
Applied a total of 135 rules in 3 ms. Remains 62 /126 variables (removed 64) and now considering 115/248 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 62/126 places, 115/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 248/248 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 70 transition count 142
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 70 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 121 place count 61 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 130 place count 61 transition count 124
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 139 place count 61 transition count 115
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 59 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 59 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 57 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 57 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 153 place count 57 transition count 99
Applied a total of 153 rules in 3 ms. Remains 57 /126 variables (removed 69) and now considering 99/248 (removed 149) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/126 places, 99/248 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:29:03] [INFO ] Input system was already deterministic with 99 transitions.
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:29:03] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:29:03] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 00:29:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 126 places, 248 transitions and 712 arcs took 2 ms.
Total runtime 73379 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-15-CTLCardinality-2024-00
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-01
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-04
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-05
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-07
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-08
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-09
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-10
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2024-11
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2023-12
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2023-13
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2023-14
Could not compute solution for formula : HealthRecord-PT-15-CTLCardinality-2023-15

BK_STOP 1717201743882

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1291/ctl_0_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1291/ctl_1_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1291/ctl_2_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1291/ctl_3_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1291/ctl_4_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1291/ctl_5_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1291/ctl_6_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1291/ctl_7_
ctl formula name HealthRecord-PT-15-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/1291/ctl_8_
ctl formula name HealthRecord-PT-15-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1291/ctl_9_
ctl formula name HealthRecord-PT-15-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1291/ctl_10_
ctl formula name HealthRecord-PT-15-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1291/ctl_11_
ctl formula name HealthRecord-PT-15-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1291/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-15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604200809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-15.tgz
mv HealthRecord-PT-15 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;