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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K Apr 12 19:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 19:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 19:54 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 51K 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-05-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2023-12
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2023-13
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2023-14
FORMULA_NAME HealthRecord-PT-05-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717200971252

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-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:16:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 00:16:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:16:12] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-06-01 00:16:12] [INFO ] Transformed 125 places.
[2024-06-01 00:16:12] [INFO ] Transformed 246 transitions.
[2024-06-01 00:16:12] [INFO ] Found NUPN structural information;
[2024-06-01 00:16:12] [INFO ] Parsed PT model containing 125 places and 246 transitions and 637 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Support contains 83 out of 125 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 125/125 places, 237/237 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 103 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 103 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 102 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 102 transition count 193
Applied a total of 46 rules in 21 ms. Remains 102 /125 variables (removed 23) and now considering 193/237 (removed 44) transitions.
[2024-06-01 00:16:12] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
// Phase 1: matrix 187 rows 102 cols
[2024-06-01 00:16:12] [INFO ] Computed 12 invariants in 16 ms
[2024-06-01 00:16:12] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-06-01 00:16:12] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2024-06-01 00:16:12] [INFO ] Invariant cache hit.
[2024-06-01 00:16:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:16:13] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2024-06-01 00:16:13] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2024-06-01 00:16:13] [INFO ] Invariant cache hit.
[2024-06-01 00:16:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 11 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 2 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:16:14] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:16:15] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-01 00:16:16] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:16:17] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:16:17] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:17] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:16:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:18] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:16:18] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:16:18] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:16:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:20] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:21] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 12 (OVERLAPS) 186/288 variables, 102/174 constraints. Problems are: Problem set: 0 solved, 192 unsolved
[2024-06-01 00:16:22] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:23] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 15 (OVERLAPS) 1/289 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 17 (OVERLAPS) 0/289 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 177 constraints, problems are : Problem set: 0 solved, 192 unsolved in 13954 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 186/288 variables, 102/176 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 192/368 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 1/289 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 10 (OVERLAPS) 0/289 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 369 constraints, problems are : Problem set: 0 solved, 192 unsolved in 11072 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 62/62 constraints]
After SMT, in 25134ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 25157ms
Starting structural reductions in LTL mode, iteration 1 : 102/125 places, 193/237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25537 ms. Remains : 102/125 places, 193/237 transitions.
Support contains 83 out of 102 places after structural reductions.
[2024-06-01 00:16:38] [INFO ] Flatten gal took : 34 ms
[2024-06-01 00:16:38] [INFO ] Flatten gal took : 13 ms
[2024-06-01 00:16:38] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 80 out of 102 places (down from 83) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 74 to 72
RANDOM walk for 40000 steps (3698 resets) in 2392 ms. (16 steps per ms) remains 28/72 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (44 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (46 resets) in 44 ms. (88 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (50 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (50 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (47 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (48 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (31 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (47 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (48 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (50 resets) in 10 ms. (363 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (47 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (49 resets) in 9 ms. (400 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (48 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (46 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (51 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
[2024-06-01 00:16:39] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2024-06-01 00:16:39] [INFO ] Invariant cache hit.
[2024-06-01 00:16:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/76 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 24 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 3 (OVERLAPS) 26/102 variables, 6/12 constraints. Problems are: Problem set: 5 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/12 constraints. Problems are: Problem set: 5 solved, 23 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 5 (OVERLAPS) 186/288 variables, 102/114 constraints. Problems are: Problem set: 6 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1/289 variables, 1/115 constraints. Problems are: Problem set: 6 solved, 22 unsolved
[2024-06-01 00:16:39] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:16:40] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:16:40] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:16:40] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 4/119 constraints. Problems are: Problem set: 7 solved, 21 unsolved
[2024-06-01 00:16:40] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2024-06-01 00:16:40] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 2/121 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/289 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 121 constraints, problems are : Problem set: 7 solved, 21 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 7 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 21 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 41/73 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 18 unsolved
[2024-06-01 00:16:40] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 9/15 constraints. Problems are: Problem set: 10 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/15 constraints. Problems are: Problem set: 10 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 29/102 variables, 6/21 constraints. Problems are: Problem set: 10 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 6/27 constraints. Problems are: Problem set: 10 solved, 18 unsolved
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
Problem AtomicPropp7 is UNSAT
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 5/32 constraints. Problems are: Problem set: 11 solved, 17 unsolved
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:16:41] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/34 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/34 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 186/288 variables, 102/136 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 17/153 constraints. Problems are: Problem set: 11 solved, 17 unsolved
[2024-06-01 00:16:42] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 1/154 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/154 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1/289 variables, 1/155 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/155 constraints. Problems are: Problem set: 11 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 0/289 variables, 0/155 constraints. Problems are: Problem set: 11 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 155 constraints, problems are : Problem set: 11 solved, 17 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/28 constraints, Known Traps: 23/23 constraints]
After SMT, in 3214ms problems are : Problem set: 11 solved, 17 unsolved
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 16 properties in 848 ms.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 193/193 transitions.
Graph (trivial) has 139 edges and 102 vertex of which 4 / 102 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 374 edges and 100 vertex of which 94 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 94 transition count 180
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 92 transition count 176
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 13 place count 90 transition count 175
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 53 place count 50 transition count 95
Iterating global reduction 3 with 40 rules applied. Total rules applied 93 place count 50 transition count 95
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 101 place count 42 transition count 79
Iterating global reduction 3 with 8 rules applied. Total rules applied 109 place count 42 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 113 place count 42 transition count 75
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 116 place count 39 transition count 66
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 39 transition count 66
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 36 transition count 60
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 36 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 36 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 138 place count 31 transition count 80
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 141 place count 31 transition count 77
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 144 place count 28 transition count 77
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 147 place count 28 transition count 138
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 152 place count 25 transition count 136
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 153 place count 24 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 154 place count 24 transition count 102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 155 place count 23 transition count 100
Iterating global reduction 7 with 1 rules applied. Total rules applied 156 place count 23 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 160 place count 23 transition count 96
Applied a total of 160 rules in 51 ms. Remains 23 /102 variables (removed 79) and now considering 96/193 (removed 97) transitions.
Running 80 sub problems to find dead transitions.
[2024-06-01 00:16:43] [INFO ] Flow matrix only has 70 transitions (discarded 26 similar events)
// Phase 1: matrix 70 rows 23 cols
[2024-06-01 00:16:43] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 00:16:43] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 3 (OVERLAPS) 70/93 variables, 23/29 constraints. Problems are: Problem set: 8 solved, 72 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 12/41 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 0/93 variables, 0/41 constraints. Problems are: Problem set: 10 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 41 constraints, problems are : Problem set: 10 solved, 70 unsolved in 734 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 6/6 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 70/93 variables, 23/29 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 12/41 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 70/111 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 0/111 constraints. Problems are: Problem set: 10 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/93 variables, 0/111 constraints. Problems are: Problem set: 10 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 111 constraints, problems are : Problem set: 10 solved, 70 unsolved in 1127 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 70/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 1946ms problems are : Problem set: 10 solved, 70 unsolved
Search for dead transitions found 10 dead transitions in 1948ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/102 places, 86/193 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 86
Applied a total of 1 rules in 9 ms. Remains 23 /23 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2011 ms. Remains : 23/102 places, 86/193 transitions.
RANDOM walk for 3456 steps (531 resets) in 80 ms. (42 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-05-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:16:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 11 ms
FORMULA HealthRecord-PT-05-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-05-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 193 transitions.
Support contains 59 out of 102 places (down from 60) after GAL structural reductions.
Computed a total of 9 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 60 transition count 114
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 60 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 90 place count 54 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 96 place count 54 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 99 place count 54 transition count 99
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 53 transition count 96
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 53 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 52 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 52 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 52 transition count 93
Applied a total of 104 rules in 7 ms. Remains 52 /102 variables (removed 50) and now considering 93/193 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 52/102 places, 93/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 5 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 64 transition count 121
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 64 transition count 121
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 59 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 59 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 59 transition count 109
Applied a total of 88 rules in 5 ms. Remains 59 /102 variables (removed 43) and now considering 109/193 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 59/102 places, 109/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 57 transition count 108
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 57 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 50 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 50 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 47 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 47 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 44 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 44 transition count 73
Applied a total of 122 rules in 7 ms. Remains 44 /102 variables (removed 58) and now considering 73/193 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 44/102 places, 73/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Graph (trivial) has 124 edges and 102 vertex of which 6 / 102 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 56 transition count 109
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 56 transition count 109
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 94 place count 47 transition count 91
Iterating global reduction 0 with 9 rules applied. Total rules applied 103 place count 47 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 108 place count 47 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 45 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 45 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 44 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 44 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 44 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 42 transition count 73
Applied a total of 121 rules in 19 ms. Remains 42 /102 variables (removed 60) and now considering 73/193 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 42/102 places, 73/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 57 transition count 108
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 57 transition count 108
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 51 transition count 96
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 51 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 104 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 48 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 48 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 45 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 45 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 119 place count 45 transition count 76
Applied a total of 119 rules in 7 ms. Remains 45 /102 variables (removed 57) and now considering 76/193 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 45/102 places, 76/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 59 transition count 112
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 54 transition count 102
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 54 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 98 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 51 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 51 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 48 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 48 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 48 transition count 82
Applied a total of 113 rules in 6 ms. Remains 48 /102 variables (removed 54) and now considering 82/193 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 48/102 places, 82/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 56 transition count 105
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 56 transition count 105
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 48 transition count 89
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 48 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 112 place count 48 transition count 85
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 115 place count 45 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 118 place count 45 transition count 76
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 121 place count 42 transition count 70
Iterating global reduction 1 with 3 rules applied. Total rules applied 124 place count 42 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 127 place count 42 transition count 67
Applied a total of 127 rules in 5 ms. Remains 42 /102 variables (removed 60) and now considering 67/193 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/102 places, 67/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 59 transition count 112
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 59 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 92 place count 53 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 98 place count 53 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 101 place count 53 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 51 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 51 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 49 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 49 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 49 transition count 85
Applied a total of 111 rules in 4 ms. Remains 49 /102 variables (removed 53) and now considering 85/193 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/102 places, 85/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 55 transition count 104
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 55 transition count 104
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 102 place count 47 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 47 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 114 place count 47 transition count 84
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 44 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 44 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 42 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 42 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 126 place count 42 transition count 69
Applied a total of 126 rules in 3 ms. Remains 42 /102 variables (removed 60) and now considering 69/193 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/102 places, 69/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 57 transition count 108
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 57 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 98 place count 49 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 106 place count 49 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 47 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 47 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 45 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 45 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 45 transition count 76
Applied a total of 120 rules in 4 ms. Remains 45 /102 variables (removed 57) and now considering 76/193 (removed 117) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 45/102 places, 76/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 56 transition count 106
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 56 transition count 106
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 50 transition count 94
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 50 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 107 place count 50 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 47 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 47 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 44 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 44 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 122 place count 44 transition count 73
Applied a total of 122 rules in 4 ms. Remains 44 /102 variables (removed 58) and now considering 73/193 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 44/102 places, 73/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 59 transition count 112
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 59 transition count 112
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 51 transition count 96
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 51 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 105 place count 51 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 49 transition count 87
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 49 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 47 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 47 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 115 place count 47 transition count 81
Applied a total of 115 rules in 3 ms. Remains 47 /102 variables (removed 55) and now considering 81/193 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 47/102 places, 81/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 193/193 transitions.
Graph (trivial) has 97 edges and 102 vertex of which 6 / 102 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 56 transition count 110
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 56 transition count 110
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 92 place count 49 transition count 96
Iterating global reduction 0 with 7 rules applied. Total rules applied 99 place count 49 transition count 96
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 104 place count 49 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 48 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 48 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 47 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 47 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 47 transition count 85
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 45 transition count 81
Applied a total of 115 rules in 15 ms. Remains 45 /102 variables (removed 57) and now considering 81/193 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 45/102 places, 81/193 transitions.
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:16:45] [INFO ] Input system was already deterministic with 81 transitions.
[2024-06-01 00:16:46] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:16:46] [INFO ] Flatten gal took : 8 ms
[2024-06-01 00:16:46] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 00:16:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 193 transitions and 525 arcs took 2 ms.
Total runtime 33610 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-05-CTLFireability-2024-00
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-01
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-02
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-03
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-04
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-05
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-06
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-07
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-08
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-10
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2024-11
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2023-14
Could not compute solution for formula : HealthRecord-PT-05-CTLFireability-2023-15

BK_STOP 1717201006419

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

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