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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21: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 68K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717201239207

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:20:40] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 00:20:40] [INFO ] Transformed 157 places.
[2024-06-01 00:20:40] [INFO ] Transformed 327 transitions.
[2024-06-01 00:20:40] [INFO ] Found NUPN structural information;
[2024-06-01 00:20:40] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 84 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 120 transition count 233
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 120 transition count 233
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 118 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 118 transition count 229
Applied a total of 78 rules in 29 ms. Remains 118 /157 variables (removed 39) and now considering 229/301 (removed 72) transitions.
[2024-06-01 00:20:40] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
// Phase 1: matrix 223 rows 118 cols
[2024-06-01 00:20:40] [INFO ] Computed 12 invariants in 15 ms
[2024-06-01 00:20:40] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-01 00:20:40] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
[2024-06-01 00:20:40] [INFO ] Invariant cache hit.
[2024-06-01 00:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:20:40] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-01 00:20:40] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
[2024-06-01 00:20:40] [INFO ] Invariant cache hit.
[2024-06-01 00:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 9 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 2 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:20:42] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:20:43] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:44] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 2 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 4 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:20:45] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:20:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:46] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:20:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 222/340 variables, 118/175 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 3 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:20:48] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:49] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:20:50] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:51] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:20:51] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:20:51] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:52] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:52] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:20:52] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:20:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:20:53] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:53] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:20:55] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:56] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:20:56] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:20:57] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:20:58] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 19/231 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:21:00] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:21:01] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:21:02] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:21:03] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:21:03] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:21:03] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:21:03] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 14/265 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:21:04] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/340 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 20 (OVERLAPS) 1/341 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:08] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:08] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:21:08] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:21:08] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/341 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/341 variables, and 272 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 141/141 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 141/153 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:12] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:14] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:21:14] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:21:14] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:15] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:16] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:21:16] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:21:16] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:21:16] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:16] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:21:17] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:21:17] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 7/171 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:18] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:18] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:18] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:18] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:18] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 5/176 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:20] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:21:20] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:21] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:21:21] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:21:22] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:22] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/118 variables, 4/182 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:23] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:23] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:21:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/118 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:25] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/118 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-01 00:21:27] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:27] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/118 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/118 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 16 (OVERLAPS) 222/340 variables, 118/306 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/340 variables, 228/534 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/340 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 228 unsolved
SMT process timed out in 60185ms, After SMT, problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 118/157 places, 229/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60613 ms. Remains : 118/157 places, 229/301 transitions.
Support contains 84 out of 118 places after structural reductions.
[2024-06-01 00:21:41] [INFO ] Flatten gal took : 38 ms
[2024-06-01 00:21:41] [INFO ] Flatten gal took : 16 ms
[2024-06-01 00:21:41] [INFO ] Input system was already deterministic with 229 transitions.
RANDOM walk for 40000 steps (2388 resets) in 2415 ms. (16 steps per ms) remains 40/78 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (36 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 34 ms. (114 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (31 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 36/40 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (60 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (36 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (34 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (37 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (34 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (33 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
[2024-06-01 00:21:42] [INFO ] Flow matrix only has 223 transitions (discarded 6 similar events)
[2024-06-01 00:21:42] [INFO ] Invariant cache hit.
[2024-06-01 00:21:42] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 35/90 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 28/118 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:21:42] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 ms to minimize.
Problem AtomicPropp65 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 20/32 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:21:43] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp34 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 4/36 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 222/340 variables, 118/154 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/341 variables, 1/155 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 2/157 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/157 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:44] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/341 variables, 1/158 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 0/341 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 158 constraints, problems are : Problem set: 2 solved, 34 unsolved in 2931 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 2 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 37/89 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 12/16 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/20 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 29/118 variables, 8/28 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 15/43 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:45] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 16/59 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:21:46] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 2/61 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 222/340 variables, 118/179 constraints. Problems are: Problem set: 2 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 34/213 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 1/214 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/340 variables, 2/216 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:48] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/340 variables, 1/217 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/340 variables, 1/218 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:49] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/340 variables, 1/219 constraints. Problems are: Problem set: 2 solved, 34 unsolved
[2024-06-01 00:21:50] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:21:50] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/341 variables, and 221 constraints, problems are : Problem set: 2 solved, 34 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 118/118 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 34/36 constraints, Known Traps: 57/57 constraints]
After SMT, in 7956ms problems are : Problem set: 2 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 13 edges and 118 vertex of which 6 / 118 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 482 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 25 place count 91 transition count 170
Iterating global reduction 0 with 23 rules applied. Total rules applied 48 place count 91 transition count 170
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 90 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 90 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 90 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 90 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 55 place count 90 transition count 161
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 88 transition count 161
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 88 transition count 159
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 86 transition count 159
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 86 transition count 159
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 67 place count 86 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 84 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 84 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 83 transition count 154
Applied a total of 72 rules in 55 ms. Remains 83 /118 variables (removed 35) and now considering 154/229 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 83/118 places, 154/229 transitions.
RANDOM walk for 40000 steps (2749 resets) in 549 ms. (72 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (25 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (46 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (44 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (37 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (44 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (81 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (43 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (44 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (46 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (41 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (68 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (38 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (43 resets) in 7 ms. (500 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (46 resets) in 10 ms. (363 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (45 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (49 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (39 resets) in 8 ms. (444 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (47 resets) in 7 ms. (500 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (45 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 9 ms. (400 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (44 resets) in 7 ms. (500 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
Probabilistic random walk after 1000001 steps, saw 126201 distinct states, run finished after 1891 ms. (steps per millisecond=528 ) properties seen :31
[2024-06-01 00:21:52] [INFO ] Flow matrix only has 151 transitions (discarded 3 similar events)
// Phase 1: matrix 151 rows 83 cols
[2024-06-01 00:21:52] [INFO ] Computed 11 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 42/83 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 151/234 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 42/83 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 6 ms to minimize.
[2024-06-01 00:21:52] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 151/234 variables, 83/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/234 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 154/154 transitions.
Graph (trivial) has 96 edges and 83 vertex of which 4 / 83 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 352 edges and 81 vertex of which 63 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 63 transition count 90
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 62 place count 61 transition count 87
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 88 place count 35 transition count 61
Iterating global reduction 2 with 26 rules applied. Total rules applied 114 place count 35 transition count 61
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 114 place count 35 transition count 57
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 123 place count 30 transition count 57
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 30 transition count 55
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 18 edges and 28 vertex of which 3 / 28 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 26 transition count 55
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 134 place count 26 transition count 49
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 134 place count 26 transition count 45
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 142 place count 22 transition count 45
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 16 transition count 38
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 16 transition count 38
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 161 place count 16 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 163 place count 15 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 167 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 168 place count 14 transition count 24
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 14 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 172 place count 14 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 173 place count 14 transition count 20
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 8 with 2 rules applied. Total rules applied 175 place count 13 transition count 19
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 178 place count 13 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 179 place count 13 transition count 15
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 181 place count 12 transition count 14
Applied a total of 181 rules in 12 ms. Remains 12 /83 variables (removed 71) and now considering 14/154 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 12/83 places, 14/154 transitions.
RANDOM walk for 480 steps (20 resets) in 5 ms. (80 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 229 transitions.
Support contains 77 out of 118 places (down from 80) after GAL structural reductions.
Computed a total of 12 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 64 transition count 124
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 64 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 57 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 57 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 128 place count 57 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 55 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 55 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 135 place count 55 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 136 place count 54 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 140 place count 54 transition count 90
Applied a total of 140 rules in 7 ms. Remains 54 /118 variables (removed 64) and now considering 90/229 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 54/118 places, 90/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 71 transition count 138
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 71 transition count 138
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 99 place count 66 transition count 128
Iterating global reduction 0 with 5 rules applied. Total rules applied 104 place count 66 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 110 place count 66 transition count 122
Applied a total of 110 rules in 4 ms. Remains 66 /118 variables (removed 52) and now considering 122/229 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/118 places, 122/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 65 transition count 126
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 65 transition count 126
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 58 transition count 112
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 58 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 129 place count 58 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 57 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 57 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 56 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 56 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 135 place count 56 transition count 96
Applied a total of 135 rules in 6 ms. Remains 56 /118 variables (removed 62) and now considering 96/229 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/118 places, 96/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 141 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 61 transition count 124
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 61 transition count 124
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 110 place count 52 transition count 105
Iterating global reduction 0 with 9 rules applied. Total rules applied 119 place count 52 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 128 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 137 place count 49 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 47 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 47 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 147 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 47 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 46 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 44 transition count 69
Applied a total of 154 rules in 20 ms. Remains 44 /118 variables (removed 74) and now considering 69/229 (removed 160) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 44/118 places, 69/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 64 transition count 124
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 64 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 58 transition count 112
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 58 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 126 place count 58 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 57 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 57 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 56 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 56 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 56 transition count 98
Applied a total of 133 rules in 5 ms. Remains 56 /118 variables (removed 62) and now considering 98/229 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/118 places, 98/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 55 edges and 118 vertex of which 10 / 118 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 64 transition count 129
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 64 transition count 129
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 104 place count 57 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 111 place count 57 transition count 115
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 118 place count 57 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 57 transition count 105
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 1 with 2 rules applied. Total rules applied 123 place count 56 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 54 transition count 102
Applied a total of 125 rules in 20 ms. Remains 54 /118 variables (removed 64) and now considering 102/229 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 54/118 places, 102/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 63 transition count 122
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 63 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 118 place count 55 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 126 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 135 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 52 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 144 place count 52 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 50 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 50 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 153 place count 50 transition count 76
Applied a total of 153 rules in 3 ms. Remains 50 /118 variables (removed 68) and now considering 76/229 (removed 153) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 50/118 places, 76/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 67 transition count 130
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 67 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 61 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 61 transition count 118
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 123 place count 61 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 60 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 60 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 59 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 59 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 130 place count 59 transition count 101
Applied a total of 130 rules in 14 ms. Remains 59 /118 variables (removed 59) and now considering 101/229 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 59/118 places, 101/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 168 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 53 place count 59 transition count 121
Iterating global reduction 0 with 52 rules applied. Total rules applied 105 place count 59 transition count 121
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 114 place count 50 transition count 102
Iterating global reduction 0 with 9 rules applied. Total rules applied 123 place count 50 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 133 place count 50 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 48 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 140 place count 48 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 47 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 47 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 145 place count 47 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 47 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 46 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 44 transition count 73
Applied a total of 152 rules in 26 ms. Remains 44 /118 variables (removed 74) and now considering 73/229 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 44/118 places, 73/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 73 transitions.
RANDOM walk for 40000 steps (4059 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (611 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26509 steps, run visited all 1 properties in 35 ms. (steps per millisecond=757 )
Probabilistic random walk after 26509 steps, saw 5105 distinct states, run finished after 38 ms. (steps per millisecond=697 ) properties seen :1
FORMULA HealthRecord-PT-09-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 102 edges and 118 vertex of which 8 / 118 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 65 transition count 131
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 65 transition count 131
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 103 place count 59 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 109 place count 59 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 117 place count 59 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 57 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 57 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 57 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 56 transition count 100
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 56 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 56 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 56 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 55 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 55 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 54 transition count 94
Applied a total of 134 rules in 47 ms. Remains 54 /118 variables (removed 64) and now considering 94/229 (removed 135) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 54/118 places, 94/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 69 transition count 133
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 69 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 105 place count 62 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 112 place count 62 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 119 place count 62 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 60 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 60 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 58 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 58 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 132 place count 58 transition count 97
Applied a total of 132 rules in 4 ms. Remains 58 /118 variables (removed 60) and now considering 97/229 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/118 places, 97/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 146 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 54 place count 58 transition count 119
Iterating global reduction 0 with 53 rules applied. Total rules applied 107 place count 58 transition count 119
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 116 place count 49 transition count 100
Iterating global reduction 0 with 9 rules applied. Total rules applied 125 place count 49 transition count 100
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 135 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 138 place count 46 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 141 place count 46 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 144 place count 46 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 44 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 44 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 154 place count 44 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 157 place count 44 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 43 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 41 transition count 63
Applied a total of 161 rules in 18 ms. Remains 41 /118 variables (removed 77) and now considering 63/229 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 41/118 places, 63/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 63 transitions.
RANDOM walk for 1855 steps (188 resets) in 6 ms. (265 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-09-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 163 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 51 place count 61 transition count 125
Iterating global reduction 0 with 50 rules applied. Total rules applied 101 place count 61 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 108 place count 54 transition count 110
Iterating global reduction 0 with 7 rules applied. Total rules applied 115 place count 54 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 124 place count 54 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 52 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 52 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 131 place count 52 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 51 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 51 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 51 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 139 place count 51 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 50 transition count 84
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 48 transition count 82
Applied a total of 143 rules in 15 ms. Remains 48 /118 variables (removed 70) and now considering 82/229 (removed 147) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 48/118 places, 82/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 17 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 131 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 66 transition count 134
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 66 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 100 place count 59 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 107 place count 59 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 113 place count 59 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 57 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 57 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 55 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 127 place count 55 transition count 98
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 130 place count 55 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 134 place count 53 transition count 93
Applied a total of 134 rules in 19 ms. Remains 53 /118 variables (removed 65) and now considering 93/229 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 53/118 places, 93/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 67 transition count 130
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 67 transition count 130
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 61 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 61 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 61 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 60 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 60 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 59 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 59 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 59 transition count 106
Applied a total of 124 rules in 3 ms. Remains 59 /118 variables (removed 59) and now considering 106/229 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 59/118 places, 106/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 118/118 places, 229/229 transitions.
Graph (trivial) has 135 edges and 118 vertex of which 12 / 118 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 64 transition count 131
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 64 transition count 131
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 102 place count 57 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 109 place count 57 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 118 place count 57 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 56 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 56 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 55 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 55 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 124 place count 55 transition count 101
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 127 place count 55 transition count 98
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 129 place count 54 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 52 transition count 95
Applied a total of 131 rules in 23 ms. Remains 52 /118 variables (removed 66) and now considering 95/229 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 52/118 places, 95/229 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:21:53] [INFO ] Input system was already deterministic with 95 transitions.
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:21:53] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:21:54] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 19 ms.
[2024-06-01 00:21:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 118 places, 229 transitions and 644 arcs took 4 ms.
Total runtime 73752 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-09-CTLFireability-2024-00
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-09
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2023-13
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-09-CTLFireability-2023-15

BK_STOP 1717201314471

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-09-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1254/ctl_0_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1254/ctl_1_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1254/ctl_2_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1254/ctl_3_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1254/ctl_4_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1254/ctl_5_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1254/ctl_6_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1254/ctl_7_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1254/ctl_8_
ctl formula name HealthRecord-PT-09-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1254/ctl_9_
ctl formula name HealthRecord-PT-09-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1254/ctl_10_
ctl formula name HealthRecord-PT-09-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1254/ctl_11_
ctl formula name HealthRecord-PT-09-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1254/ctl_12_
ctl formula name HealthRecord-PT-09-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1254/ctl_13_
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-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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