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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K 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 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 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 71K 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-13-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-13-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717201524225

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-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:25:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:25:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:25:25] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 00:25:25] [INFO ] Transformed 161 places.
[2024-06-01 00:25:25] [INFO ] Transformed 341 transitions.
[2024-06-01 00:25:25] [INFO ] Found NUPN structural information;
[2024-06-01 00:25:25] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 71 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 109 transition count 215
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 109 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 108 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 108 transition count 213
Applied a total of 106 rules in 27 ms. Remains 108 /161 variables (removed 53) and now considering 213/313 (removed 100) transitions.
[2024-06-01 00:25:25] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
// Phase 1: matrix 207 rows 108 cols
[2024-06-01 00:25:25] [INFO ] Computed 12 invariants in 13 ms
[2024-06-01 00:25:25] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-06-01 00:25:25] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2024-06-01 00:25:25] [INFO ] Invariant cache hit.
[2024-06-01 00:25:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:25:26] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-01 00:25:26] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2024-06-01 00:25:26] [INFO ] Invariant cache hit.
[2024-06-01 00:25:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:27] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 14 ms to minimize.
[2024-06-01 00:25:27] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 2 ms to minimize.
[2024-06-01 00:25:27] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 3 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 14 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 0 ms to minimize.
[2024-06-01 00:25:28] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:25:29] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 28 ms to minimize.
[2024-06-01 00:25:29] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 13 ms to minimize.
[2024-06-01 00:25:29] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:30] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:30] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:25:30] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:25:30] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:25:31] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 4 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:25:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:33] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:25:34] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:25:36] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/108 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:37] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:25:38] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/108 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:39] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:25:39] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/108 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:39] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/108 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:40] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:25:40] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:25:40] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/108 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-06-01 00:25:41] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/108 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/108 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 18 (OVERLAPS) 206/314 variables, 108/209 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/314 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 20 (OVERLAPS) 1/315 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/315 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 22 (OVERLAPS) 0/315 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 210 constraints, problems are : Problem set: 0 solved, 212 unsolved in 21637 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 89/101 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:25:48] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:25:49] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:50] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:25:50] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:50] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:51] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-06-01 00:25:51] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (OVERLAPS) 206/314 variables, 108/232 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 212/444 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-01 00:25:53] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:25:53] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-06-01 00:25:53] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:25:55] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 13 (OVERLAPS) 1/315 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (OVERLAPS) 0/315 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 449 constraints, problems are : Problem set: 0 solved, 212 unsolved in 24142 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 116/116 constraints]
After SMT, in 45946ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 45968ms
Starting structural reductions in LTL mode, iteration 1 : 108/161 places, 213/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46381 ms. Remains : 108/161 places, 213/313 transitions.
Support contains 71 out of 108 places after structural reductions.
[2024-06-01 00:26:12] [INFO ] Flatten gal took : 58 ms
[2024-06-01 00:26:12] [INFO ] Flatten gal took : 20 ms
[2024-06-01 00:26:12] [INFO ] Input system was already deterministic with 213 transitions.
RANDOM walk for 40000 steps (3152 resets) in 1079 ms. (37 steps per ms) remains 35/60 properties
BEST_FIRST walk for 4002 steps (40 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (39 resets) in 23 ms. (166 steps per ms) remains 33/35 properties
BEST_FIRST walk for 4004 steps (42 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (45 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (39 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (39 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (46 resets) in 7 ms. (500 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (37 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (43 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 7 ms. (500 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (41 resets) in 7 ms. (500 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (43 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (40 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (38 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (41 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (40 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (38 resets) in 7 ms. (500 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (42 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (44 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (43 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
[2024-06-01 00:26:13] [INFO ] Flow matrix only has 207 transitions (discarded 6 similar events)
[2024-06-01 00:26:13] [INFO ] Invariant cache hit.
[2024-06-01 00:26:13] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 1 (OVERLAPS) 35/79 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 3 (OVERLAPS) 29/108 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 2 ms to minimize.
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 9/21 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:13] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/24 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 4/28 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/28 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 206/314 variables, 108/136 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:26:14] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 8/144 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 3 ms to minimize.
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 5/149 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 0/149 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 1/315 variables, 1/150 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/315 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 0/315 variables, 0/150 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 150 constraints, problems are : Problem set: 2 solved, 31 unsolved in 2793 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 2 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 38/79 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:15] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 3/13 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 29/108 variables, 8/21 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 23/44 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 3/47 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 0 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 4/51 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:26:16] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 7/58 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/108 variables, 0/58 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 206/314 variables, 108/166 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 31/197 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:26:17] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 3/200 constraints. Problems are: Problem set: 2 solved, 31 unsolved
[2024-06-01 00:26:18] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 1/201 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 16 (OVERLAPS) 1/315 variables, 1/202 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 0/202 constraints. Problems are: Problem set: 2 solved, 31 unsolved
At refinement iteration 18 (OVERLAPS) 0/315 variables, 0/202 constraints. Problems are: Problem set: 2 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 202 constraints, problems are : Problem set: 2 solved, 31 unsolved in 4046 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/33 constraints, Known Traps: 50/50 constraints]
After SMT, in 6858ms problems are : Problem set: 2 solved, 31 unsolved
Fused 31 Parikh solutions to 29 different solutions.
Parikh walk visited 23 properties in 2933 ms.
Support contains 17 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 64 edges and 108 vertex of which 6 / 108 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 458 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 45 place count 61 transition count 115
Iterating global reduction 0 with 43 rules applied. Total rules applied 88 place count 61 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 89 place count 61 transition count 114
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 54 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 54 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 54 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 115 place count 51 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 118 place count 51 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 123 place count 51 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 50 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 50 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 128 place count 50 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 130 place count 49 transition count 71
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 135 place count 49 transition count 66
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 140 place count 44 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 44 transition count 65
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 142 place count 44 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 143 place count 43 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 43 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 145 place count 42 transition count 82
Iterating global reduction 6 with 1 rules applied. Total rules applied 146 place count 42 transition count 82
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 147 place count 41 transition count 80
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 41 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 154 place count 41 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 41 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 156 place count 40 transition count 73
Applied a total of 156 rules in 43 ms. Remains 40 /108 variables (removed 68) and now considering 73/213 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 40/108 places, 73/213 transitions.
RANDOM walk for 40000 steps (3929 resets) in 378 ms. (105 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (592 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (583 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (589 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (584 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
[2024-06-01 00:26:23] [INFO ] Flow matrix only has 57 transitions (discarded 16 similar events)
// Phase 1: matrix 57 rows 40 cols
[2024-06-01 00:26:23] [INFO ] Computed 11 invariants in 1 ms
[2024-06-01 00:26:23] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:26:23] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/40 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:26:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 57/97 variables, 40/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 55 constraints, problems are : Problem set: 0 solved, 4 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 14/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/40 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 00:26:23] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 57/97 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/97 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/97 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 60 constraints, problems are : Problem set: 0 solved, 4 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 73/73 transitions.
Graph (complete) has 150 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 38 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 37 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 36 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 36 transition count 72
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 36 transition count 66
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 21 place count 30 transition count 66
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 30 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 29 transition count 65
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 30 place count 29 transition count 65
Applied a total of 30 rules in 15 ms. Remains 29 /40 variables (removed 11) and now considering 65/73 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 29/40 places, 65/73 transitions.
RANDOM walk for 30664 steps (3939 resets) in 204 ms. (149 steps per ms) remains 0/4 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 00:26:23] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:26:23] [INFO ] Flatten gal took : 11 ms
[2024-06-01 00:26:23] [INFO ] Input system was already deterministic with 213 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 145 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 117
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 50 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 50 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 48 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 47 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 47 transition count 80
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 4 with 2 rules applied. Total rules applied 132 place count 46 transition count 79
Applied a total of 132 rules in 23 ms. Remains 46 /108 variables (removed 62) and now considering 79/213 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 46/108 places, 79/213 transitions.
[2024-06-01 00:26:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:23] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:23] [INFO ] Input system was already deterministic with 79 transitions.
RANDOM walk for 40000 steps (4065 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (521 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 643948 steps, run visited all 1 properties in 509 ms. (steps per millisecond=1265 )
Probabilistic random walk after 643948 steps, saw 81994 distinct states, run finished after 512 ms. (steps per millisecond=1257 ) properties seen :1
FORMULA HealthRecord-PT-13-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 125 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 49 place count 55 transition count 115
Iterating global reduction 0 with 48 rules applied. Total rules applied 97 place count 55 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 98 place count 55 transition count 114
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 105 place count 48 transition count 98
Iterating global reduction 1 with 7 rules applied. Total rules applied 112 place count 48 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 121 place count 48 transition count 89
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 124 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 127 place count 45 transition count 82
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 133 place count 45 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 44 transition count 74
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 44 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 44 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 44 transition count 70
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 4 with 2 rules applied. Total rules applied 141 place count 43 transition count 69
Applied a total of 141 rules in 21 ms. Remains 43 /108 variables (removed 65) and now considering 69/213 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 43/108 places, 69/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 12748 steps (1295 resets) in 17 ms. (708 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-13-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 60 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 60 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 53 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 53 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 119 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 50 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 131 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 49 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 49 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 49 transition count 77
Applied a total of 136 rules in 9 ms. Remains 49 /108 variables (removed 59) and now considering 77/213 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 49/108 places, 77/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 67 transition count 133
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 67 transition count 133
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 61 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 61 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 61 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 60 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 60 transition count 108
Applied a total of 105 rules in 7 ms. Remains 60 /108 variables (removed 48) and now considering 108/213 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 60/108 places, 108/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 146 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 116
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 115
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 49 transition count 99
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 49 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 119 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 46 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 46 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 46 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 45 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 45 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 45 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 45 transition count 71
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 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 70
Applied a total of 139 rules in 21 ms. Remains 44 /108 variables (removed 64) and now considering 70/213 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 44/108 places, 70/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 70 transitions.
RANDOM walk for 40000 steps (4070 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (533 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1702 steps, run visited all 1 properties in 4 ms. (steps per millisecond=425 )
Probabilistic random walk after 1702 steps, saw 643 distinct states, run finished after 5 ms. (steps per millisecond=340 ) properties seen :1
FORMULA HealthRecord-PT-13-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 131 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 117
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 116
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 50 transition count 103
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 50 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 48 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 48 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 124 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 47 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 47 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 47 transition count 80
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 4 with 2 rules applied. Total rules applied 132 place count 46 transition count 79
Applied a total of 132 rules in 35 ms. Remains 46 /108 variables (removed 62) and now considering 79/213 (removed 134) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 46/108 places, 79/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 64 transition count 128
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 64 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 94 place count 58 transition count 115
Iterating global reduction 0 with 6 rules applied. Total rules applied 100 place count 58 transition count 115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 58 transition count 106
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 57 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 57 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 56 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 56 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 56 transition count 99
Applied a total of 115 rules in 13 ms. Remains 56 /108 variables (removed 52) and now considering 99/213 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 56/108 places, 99/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 68 transition count 136
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 68 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 64 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 64 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 91 place count 64 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 63 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 63 transition count 122
Applied a total of 93 rules in 10 ms. Remains 63 /108 variables (removed 45) and now considering 122/213 (removed 91) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 63/108 places, 122/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 70 transition count 140
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 70 transition count 140
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 66 transition count 130
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 66 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 66 transition count 127
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 64 transition count 123
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 64 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 96 place count 64 transition count 118
Applied a total of 96 rules in 5 ms. Remains 64 /108 variables (removed 44) and now considering 118/213 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 64/108 places, 118/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Graph (trivial) has 145 edges and 108 vertex of which 8 / 108 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 56 transition count 117
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 56 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 96 place count 56 transition count 116
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 49 transition count 100
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 49 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 119 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 46 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 46 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 46 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 45 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 45 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 45 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 45 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 44 transition count 71
Applied a total of 139 rules in 18 ms. Remains 44 /108 variables (removed 64) and now considering 71/213 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 44/108 places, 71/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 60 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 60 transition count 120
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 54 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 54 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 117 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 52 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 52 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 124 place count 52 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 51 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 51 transition count 85
Applied a total of 129 rules in 5 ms. Remains 51 /108 variables (removed 57) and now considering 85/213 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 51/108 places, 85/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 63 transition count 125
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 63 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 56 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 56 transition count 109
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 112 place count 56 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 53 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 53 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 124 place count 53 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 52 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 52 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 52 transition count 83
Applied a total of 129 rules in 10 ms. Remains 52 /108 variables (removed 56) and now considering 83/213 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 52/108 places, 83/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 66 transition count 132
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 66 transition count 132
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 91 place count 59 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 98 place count 59 transition count 116
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 106 place count 59 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 56 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 56 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 117 place count 56 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 118 place count 55 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 55 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 122 place count 55 transition count 91
Applied a total of 122 rules in 6 ms. Remains 55 /108 variables (removed 53) and now considering 91/213 (removed 122) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 55/108 places, 91/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 69 transition count 138
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 69 transition count 138
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 81 place count 66 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 84 place count 66 transition count 132
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 90 place count 66 transition count 126
Applied a total of 90 rules in 3 ms. Remains 66 /108 variables (removed 42) and now considering 126/213 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/108 places, 126/213 transitions.
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:24] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:26:24] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 60 transition count 120
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 60 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 53 transition count 104
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 53 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 119 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 50 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 131 place count 50 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 132 place count 49 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 133 place count 49 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 136 place count 49 transition count 77
Applied a total of 136 rules in 13 ms. Remains 49 /108 variables (removed 59) and now considering 77/213 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 49/108 places, 77/213 transitions.
[2024-06-01 00:26:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:25] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:26:25] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 213/213 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 69 transition count 138
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 69 transition count 138
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 65 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 65 transition count 129
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 92 place count 65 transition count 123
Applied a total of 92 rules in 4 ms. Remains 65 /108 variables (removed 43) and now considering 123/213 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 65/108 places, 123/213 transitions.
[2024-06-01 00:26:25] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:25] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:26:25] [INFO ] Input system was already deterministic with 123 transitions.
[2024-06-01 00:26:25] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:26:25] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:26:25] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:26:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 213 transitions and 624 arcs took 3 ms.
Total runtime 59734 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-13-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-09
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2023-12
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2023-13
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-13-CTLFireability-2023-15

BK_STOP 1717201585495

--------------------
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-13-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1042/ctl_0_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1042/ctl_1_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1042/ctl_2_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1042/ctl_3_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1042/ctl_4_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1042/ctl_5_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1042/ctl_6_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1042/ctl_7_
ctl formula name HealthRecord-PT-13-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1042/ctl_8_
ctl formula name HealthRecord-PT-13-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1042/ctl_9_
ctl formula name HealthRecord-PT-13-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1042/ctl_10_
ctl formula name HealthRecord-PT-13-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1042/ctl_11_
ctl formula name HealthRecord-PT-13-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1042/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-13"
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-13, 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-171640604200794"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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