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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 20:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 20:15 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 67K 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-07-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-07-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717201109223

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:18:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:18:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:18:30] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-01 00:18:30] [INFO ] Transformed 155 places.
[2024-06-01 00:18:30] [INFO ] Transformed 320 transitions.
[2024-06-01 00:18:30] [INFO ] Found NUPN structural information;
[2024-06-01 00:18:30] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Support contains 99 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 130 transition count 248
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 130 transition count 248
Applied a total of 50 rules in 24 ms. Remains 130 /155 variables (removed 25) and now considering 248/295 (removed 47) transitions.
[2024-06-01 00:18:30] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
// Phase 1: matrix 239 rows 130 cols
[2024-06-01 00:18:30] [INFO ] Computed 15 invariants in 23 ms
[2024-06-01 00:18:30] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-01 00:18:30] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-06-01 00:18:30] [INFO ] Invariant cache hit.
[2024-06-01 00:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:18:31] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-06-01 00:18:31] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-06-01 00:18:31] [INFO ] Invariant cache hit.
[2024-06-01 00:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 12 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:32] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 2 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:33] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:34] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (OVERLAPS) 238/368 variables, 130/162 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 1/369 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2024-06-01 00:18:38] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:41] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:41] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:42] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/369 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (OVERLAPS) 0/369 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 169 constraints, problems are : Problem set: 0 solved, 247 unsolved in 15224 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 23/38 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:47] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:18:47] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:47] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:18:47] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 0 ms to minimize.
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:48] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 2 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 0 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 0 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:18:49] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:18:50] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:50] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:51] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:18:51] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:18:51] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
[2024-06-01 00:18:51] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-06-01 00:18:51] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 10 ms to minimize.
[2024-06-01 00:18:52] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:18:53] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 0 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:18:54] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:18:55] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 12 (OVERLAPS) 238/368 variables, 130/229 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 247/476 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:18:57] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:18:57] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:18:58] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:19:00] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/368 variables, 12/488 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:19:02] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:19:08] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:08] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:19:10] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/368 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 247 unsolved
[2024-06-01 00:19:14] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 494 constraints, problems are : Problem set: 0 solved, 247 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 102/102 constraints]
After SMT, in 45430ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 45468ms
Starting structural reductions in LTL mode, iteration 1 : 130/155 places, 248/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45879 ms. Remains : 130/155 places, 248/295 transitions.
Support contains 99 out of 130 places after structural reductions.
[2024-06-01 00:19:16] [INFO ] Flatten gal took : 41 ms
[2024-06-01 00:19:16] [INFO ] Flatten gal took : 27 ms
[2024-06-01 00:19:16] [INFO ] Input system was already deterministic with 248 transitions.
Reduction of identical properties reduced properties to check from 99 to 98
RANDOM walk for 40000 steps (2130 resets) in 1580 ms. (25 steps per ms) remains 55/98 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (18 resets) in 20 ms. (190 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (35 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (29 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (30 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (31 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (30 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (30 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (29 resets) in 22 ms. (174 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (28 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (31 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (27 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (32 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (29 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (29 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (35 resets) in 32 ms. (121 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (31 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (30 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (29 resets) in 16 ms. (235 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4003 steps (28 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 51/52 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (31 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (29 resets) in 10 ms. (363 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (31 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (30 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (29 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (27 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (33 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (31 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (60 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (33 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (33 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (28 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (28 resets) in 23 ms. (166 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
[2024-06-01 00:19:17] [INFO ] Flow matrix only has 239 transitions (discarded 9 similar events)
[2024-06-01 00:19:17] [INFO ] Invariant cache hit.
[2024-06-01 00:19:17] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/96 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 50 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 50 unsolved
At refinement iteration 3 (OVERLAPS) 34/130 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 50 unsolved
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:18] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:19:19] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 0 ms to minimize.
[2024-06-01 00:19:19] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:19] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 36 places in 564 ms of which 25 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 3 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 20/35 constraints. Problems are: Problem set: 1 solved, 50 unsolved
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 3 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:19:20] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 0 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
Problem AtomicPropp41 is UNSAT
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 17/52 constraints. Problems are: Problem set: 2 solved, 49 unsolved
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:21] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 7/59 constraints. Problems are: Problem set: 2 solved, 49 unsolved
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 7/66 constraints. Problems are: Problem set: 2 solved, 49 unsolved
[2024-06-01 00:19:22] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 130/369 variables, and 67 constraints, problems are : Problem set: 2 solved, 49 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/130 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 2 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 36/94 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 49 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 5/12 constraints. Problems are: Problem set: 4 solved, 47 unsolved
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 0 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 8/20 constraints. Problems are: Problem set: 4 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 36/130 variables, 8/28 constraints. Problems are: Problem set: 4 solved, 47 unsolved
Problem AtomicPropp89 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 47/75 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:23] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 15/90 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:24] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:25] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 10/100 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 238/368 variables, 130/230 constraints. Problems are: Problem set: 5 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/368 variables, 46/276 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:19:26] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/368 variables, 2/278 constraints. Problems are: Problem set: 5 solved, 46 unsolved
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:19:27] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/368 variables, 2/280 constraints. Problems are: Problem set: 5 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/369 variables, and 280 constraints, problems are : Problem set: 5 solved, 46 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 46/51 constraints, Known Traps: 89/89 constraints]
After SMT, in 10051ms problems are : Problem set: 5 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 54 edges and 130 vertex of which 8 / 130 are part of one of the 4 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (complete) has 545 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 27 place count 99 transition count 180
Iterating global reduction 0 with 25 rules applied. Total rules applied 52 place count 99 transition count 180
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 95 transition count 172
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 95 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 95 transition count 168
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 1 with 4 rules applied. Total rules applied 68 place count 93 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 93 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 93 transition count 161
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 73 place count 93 transition count 157
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 89 transition count 157
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 83 place count 89 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 89 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 88 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 88 transition count 155
Applied a total of 86 rules in 62 ms. Remains 88 /130 variables (removed 42) and now considering 155/248 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 88/130 places, 155/248 transitions.
RANDOM walk for 40000 steps (3557 resets) in 382 ms. (104 steps per ms) remains 33/46 properties
BEST_FIRST walk for 4003 steps (66 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (71 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (67 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (66 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (66 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (65 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (66 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (67 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (65 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (69 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (61 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (61 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (62 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (66 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (62 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (71 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (66 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (65 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (66 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (69 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (71 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (62 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (62 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (64 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (63 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (63 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (61 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
// Phase 1: matrix 155 rows 88 cols
[2024-06-01 00:19:28] [INFO ] Computed 13 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 32/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 25/88 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 155/243 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:28] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:19:29] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 119 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 32/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 25/88 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:19:30] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 155/243 variables, 88/141 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 33/174 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:19:31] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:19:32] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:32] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/243 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/243 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 00:19:32] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:19:32] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:19:32] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/243 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/243 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 20 (OVERLAPS) 0/243 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 182 constraints, problems are : Problem set: 0 solved, 33 unsolved in 3898 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 48/48 constraints]
After SMT, in 5509ms problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 21 different solutions.
Parikh walk visited 26 properties in 3612 ms.
Support contains 7 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 155/155 transitions.
Graph (trivial) has 90 edges and 88 vertex of which 4 / 88 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 402 edges and 86 vertex of which 81 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 81 transition count 149
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 79 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 79 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 19 place count 72 transition count 143
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 42 place count 49 transition count 97
Iterating global reduction 2 with 23 rules applied. Total rules applied 65 place count 49 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 49 transition count 95
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 45 transition count 87
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 45 transition count 87
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 43 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 43 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 42 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 42 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 42 transition count 76
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 94 place count 37 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 37 transition count 94
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 37 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 35 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 102 place count 35 transition count 90
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 113 place count 35 transition count 90
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 123 place count 35 transition count 90
Applied a total of 123 rules in 29 ms. Remains 35 /88 variables (removed 53) and now considering 90/155 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 35/88 places, 90/155 transitions.
RANDOM walk for 40000 steps (6701 resets) in 984 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1866 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1812 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1804 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1929 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1844 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 53 ms. (740 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 5029 steps, run visited all 7 properties in 40 ms. (steps per millisecond=125 )
Probabilistic random walk after 5029 steps, saw 1455 distinct states, run finished after 43 ms. (steps per millisecond=116 ) properties seen :7
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 12 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 248 transitions.
Computed a total of 13 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 65 transition count 124
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 65 transition count 124
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 139 place count 56 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 148 place count 56 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 157 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 53 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 53 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 50 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 50 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 178 place count 50 transition count 73
Applied a total of 178 rules in 8 ms. Remains 50 /130 variables (removed 80) and now considering 73/248 (removed 175) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 50/130 places, 73/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 67 transition count 128
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 67 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 133 place count 60 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 140 place count 60 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 149 place count 60 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 58 transition count 99
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 58 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 56 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 56 transition count 95
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 162 place count 56 transition count 90
Applied a total of 162 rules in 8 ms. Remains 56 /130 variables (removed 74) and now considering 90/248 (removed 158) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 56/130 places, 90/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 76 transition count 145
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 76 transition count 145
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 115 place count 69 transition count 131
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 69 transition count 131
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 129 place count 69 transition count 124
Applied a total of 129 rules in 5 ms. Remains 69 /130 variables (removed 61) and now considering 124/248 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 69/130 places, 124/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 66 transition count 126
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 66 transition count 126
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 136 place count 58 transition count 110
Iterating global reduction 0 with 8 rules applied. Total rules applied 144 place count 58 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 153 place count 58 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 154 place count 57 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 155 place count 57 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 156 place count 56 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 157 place count 56 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 160 place count 56 transition count 93
Applied a total of 160 rules in 7 ms. Remains 56 /130 variables (removed 74) and now considering 93/248 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 56/130 places, 93/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 136
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 63 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 63 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 140 place count 63 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 62 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 62 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 61 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 61 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 147 place count 61 transition count 106
Applied a total of 147 rules in 6 ms. Remains 61 /130 variables (removed 69) and now considering 106/248 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 61/130 places, 106/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 66 transition count 126
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 66 transition count 126
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 137 place count 57 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 146 place count 57 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 155 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 158 place count 54 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 161 place count 54 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 164 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 167 place count 51 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 175 place count 51 transition count 76
Applied a total of 175 rules in 5 ms. Remains 51 /130 variables (removed 79) and now considering 76/248 (removed 172) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/130 places, 76/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 114 edges and 130 vertex of which 10 / 130 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 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 83 transition count 164
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 83 transition count 164
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 86 place count 80 transition count 158
Iterating global reduction 0 with 3 rules applied. Total rules applied 89 place count 80 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 91 place count 80 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 80 transition count 151
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 98 place count 79 transition count 150
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 76 transition count 147
Applied a total of 101 rules in 40 ms. Remains 76 /130 variables (removed 54) and now considering 147/248 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 76/130 places, 147/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 23 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 75 transition count 144
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 75 transition count 144
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 116 place count 69 transition count 132
Iterating global reduction 0 with 6 rules applied. Total rules applied 122 place count 69 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 127 place count 69 transition count 127
Applied a total of 127 rules in 4 ms. Remains 69 /130 variables (removed 61) and now considering 127/248 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 69/130 places, 127/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 62 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 62 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 145 place count 62 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 147 place count 60 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 149 place count 60 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 58 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 58 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 158 place count 58 transition count 93
Applied a total of 158 rules in 5 ms. Remains 58 /130 variables (removed 72) and now considering 93/248 (removed 155) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 58/130 places, 93/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 166 edges and 130 vertex of which 12 / 130 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 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 67 transition count 135
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 67 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 122 place count 58 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 131 place count 58 transition count 117
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 140 place count 58 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 56 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 56 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 54 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 54 transition count 98
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 153 place count 54 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 54 transition count 87
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 163 place count 52 transition count 85
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 48 transition count 81
Applied a total of 167 rules in 25 ms. Remains 48 /130 variables (removed 82) and now considering 81/248 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 48/130 places, 81/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 188 edges and 130 vertex of which 14 / 130 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 128
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 128
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 108
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 149 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 151 place count 51 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 153 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 155 place count 49 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 157 place count 49 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 163 place count 49 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 49 transition count 76
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 173 place count 47 transition count 74
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 177 place count 43 transition count 70
Applied a total of 177 rules in 15 ms. Remains 43 /130 variables (removed 87) and now considering 70/248 (removed 178) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 43/130 places, 70/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 70 transitions.
RANDOM walk for 40000 steps (4007 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (648 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13137 steps, run visited all 1 properties in 18 ms. (steps per millisecond=729 )
Probabilistic random walk after 13137 steps, saw 2768 distinct states, run finished after 19 ms. (steps per millisecond=691 ) properties seen :1
FORMULA HealthRecord-PT-07-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 97 edges and 130 vertex of which 14 / 130 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 60 place count 63 transition count 128
Iterating global reduction 0 with 59 rules applied. Total rules applied 119 place count 63 transition count 128
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 129 place count 53 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 139 place count 53 transition count 108
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 149 place count 53 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 50 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 50 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 48 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 165 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 171 place count 48 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 175 place count 46 transition count 71
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 179 place count 42 transition count 67
Applied a total of 179 rules in 12 ms. Remains 42 /130 variables (removed 88) and now considering 67/248 (removed 181) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 42/130 places, 67/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 64 transition count 122
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 64 transition count 122
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 141 place count 55 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 150 place count 55 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 159 place count 55 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 52 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 52 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 49 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 49 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 180 place count 49 transition count 71
Applied a total of 180 rules in 7 ms. Remains 49 /130 variables (removed 81) and now considering 71/248 (removed 177) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 49/130 places, 71/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Graph (trivial) has 184 edges and 130 vertex of which 14 / 130 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 65 transition count 132
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 65 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 125 place count 55 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 135 place count 55 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 144 place count 55 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 54 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 54 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 53 transition count 98
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 53 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 151 place count 53 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 53 transition count 89
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 161 place count 51 transition count 87
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 47 transition count 83
Applied a total of 165 rules in 30 ms. Remains 47 /130 variables (removed 83) and now considering 83/248 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 47/130 places, 83/248 transitions.
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:19:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:38] [INFO ] Input system was already deterministic with 83 transitions.
RANDOM walk for 40000 steps (4026 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (658 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16446 steps, run visited all 1 properties in 18 ms. (steps per millisecond=913 )
Probabilistic random walk after 16446 steps, saw 3273 distinct states, run finished after 18 ms. (steps per millisecond=913 ) properties seen :1
FORMULA HealthRecord-PT-07-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 65 transition count 124
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 65 transition count 124
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 57 transition count 108
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 57 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 152 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 54 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 51 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 173 place count 51 transition count 78
Applied a total of 173 rules in 3 ms. Remains 51 /130 variables (removed 79) and now considering 78/248 (removed 170) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/130 places, 78/248 transitions.
[2024-06-01 00:19:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:19:39] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 248/248 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 135
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 135
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 125 place count 64 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 132 place count 64 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 141 place count 64 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 62 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 62 transition count 106
Applied a total of 145 rules in 5 ms. Remains 62 /130 variables (removed 68) and now considering 106/248 (removed 142) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 62/130 places, 106/248 transitions.
[2024-06-01 00:19:39] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:19:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:19:39] [INFO ] Input system was already deterministic with 106 transitions.
[2024-06-01 00:19:39] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:19:39] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:19:39] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2024-06-01 00:19:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 130 places, 248 transitions and 689 arcs took 4 ms.
Total runtime 68741 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-07-CTLFireability-2024-00
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-09
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-07-CTLFireability-2023-15

BK_STOP 1717201179543

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

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