About the Execution of LTSMin+red for HealthRecord-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
361.487 | 34238.00 | 55006.00 | 133.50 | ????F??????????? | normal |
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-171640604000705.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640604000705
=====================================================================
--------------------
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 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 20:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 20:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 47K 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-02-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-02-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717200729220
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:12:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:12:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:12:10] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-06-01 00:12:10] [INFO ] Transformed 119 places.
[2024-06-01 00:12:10] [INFO ] Transformed 225 transitions.
[2024-06-01 00:12:10] [INFO ] Found NUPN structural information;
[2024-06-01 00:12:10] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA HealthRecord-PT-02-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 219/219 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 94 transition count 175
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 94 transition count 175
Applied a total of 50 rules in 20 ms. Remains 94 /119 variables (removed 25) and now considering 175/219 (removed 44) transitions.
[2024-06-01 00:12:10] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
// Phase 1: matrix 173 rows 94 cols
[2024-06-01 00:12:10] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 00:12:10] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-06-01 00:12:10] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2024-06-01 00:12:10] [INFO ] Invariant cache hit.
[2024-06-01 00:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 00:12:10] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-01 00:12:11] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2024-06-01 00:12:11] [INFO ] Invariant cache hit.
[2024-06-01 00:12:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 10 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 39 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-06-01 00:12:12] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 2 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
[2024-06-01 00:12:13] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 2 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:14] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:12:15] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:15] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 172/266 variables, 94/131 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 1/267 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:18] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:12:18] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-06-01 00:12:18] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:12:18] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:19] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:20] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/267 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:22] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/267 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/267 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 18 (OVERLAPS) 0/267 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 139 constraints, problems are : Problem set: 0 solved, 174 unsolved in 13949 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:25] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:12:25] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 41 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:26] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-06-01 00:12:27] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-01 00:12:27] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:12:27] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 172/266 variables, 94/151 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 174/325 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (OVERLAPS) 1/267 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/267 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (OVERLAPS) 0/267 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 326 constraints, problems are : Problem set: 0 solved, 174 unsolved in 13263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 49/49 constraints]
After SMT, in 27313ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 27326ms
Starting structural reductions in LTL mode, iteration 1 : 94/119 places, 175/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27715 ms. Remains : 94/119 places, 175/219 transitions.
Support contains 64 out of 94 places after structural reductions.
[2024-06-01 00:12:38] [INFO ] Flatten gal took : 34 ms
[2024-06-01 00:12:38] [INFO ] Flatten gal took : 14 ms
[2024-06-01 00:12:38] [INFO ] Input system was already deterministic with 175 transitions.
Support contains 61 out of 94 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (2339 resets) in 1451 ms. (27 steps per ms) remains 12/47 properties
BEST_FIRST walk for 40003 steps (367 resets) in 165 ms. (240 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (363 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (365 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (365 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (365 resets) in 69 ms. (571 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (359 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (414 resets) in 61 ms. (645 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (364 resets) in 91 ms. (434 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (357 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (348 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (354 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
[2024-06-01 00:12:39] [INFO ] Flow matrix only has 173 transitions (discarded 2 similar events)
[2024-06-01 00:12:39] [INFO ] Invariant cache hit.
[2024-06-01 00:12:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 47/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 38 places in 27 ms of which 0 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 1 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 8 ms to minimize.
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 4 (OVERLAPS) 29/94 variables, 6/17 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:39] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 2/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 172/266 variables, 94/116 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/267 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 117 constraints, problems are : Problem set: 1 solved, 10 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 48/64 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 9/11 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 39 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 30/94 variables, 6/20 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 172/266 variables, 94/119 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 10/129 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 00:12:40] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:12:41] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/266 variables, 3/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 00:12:41] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/266 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/267 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/267 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/267 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 134 constraints, problems are : Problem set: 1 solved, 10 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 21/21 constraints]
After SMT, in 1879ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 9 properties in 132 ms.
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 130 edges and 94 vertex of which 12 / 94 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 301 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 86 transition count 156
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 82 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 81 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 80 transition count 149
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 19 place count 80 transition count 146
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 27 place count 75 transition count 146
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 59 place count 43 transition count 82
Iterating global reduction 4 with 32 rules applied. Total rules applied 91 place count 43 transition count 82
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 101 place count 33 transition count 62
Iterating global reduction 4 with 10 rules applied. Total rules applied 111 place count 33 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 115 place count 33 transition count 58
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 118 place count 30 transition count 49
Iterating global reduction 5 with 3 rules applied. Total rules applied 121 place count 30 transition count 49
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 124 place count 27 transition count 43
Iterating global reduction 5 with 3 rules applied. Total rules applied 127 place count 27 transition count 43
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 130 place count 27 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 140 place count 22 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 142 place count 22 transition count 63
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 151 place count 22 transition count 63
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 159 place count 22 transition count 63
Applied a total of 159 rules in 40 ms. Remains 22 /94 variables (removed 72) and now considering 63/175 (removed 112) transitions.
Running 47 sub problems to find dead transitions.
[2024-06-01 00:12:41] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 22 cols
[2024-06-01 00:12:41] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 00:12:41] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 3 (OVERLAPS) 59/81 variables, 22/26 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 11/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/81 variables, 0/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 37 constraints, problems are : Problem set: 9 solved, 38 unsolved in 369 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 59/81 variables, 22/26 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 11/37 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 38/75 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/75 constraints. Problems are: Problem set: 9 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/75 constraints. Problems are: Problem set: 9 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 75 constraints, problems are : Problem set: 9 solved, 38 unsolved in 490 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 22/22 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 38/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 905ms problems are : Problem set: 9 solved, 38 unsolved
Search for dead transitions found 9 dead transitions in 906ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 22/94 places, 54/175 transitions.
Graph (complete) has 66 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 21 transition count 54
Applied a total of 3 rules in 10 ms. Remains 21 /22 variables (removed 1) and now considering 54/54 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 960 ms. Remains : 21/94 places, 54/175 transitions.
RANDOM walk for 40000 steps (13304 resets) in 400 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1644 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 162 steps, run visited all 1 properties in 6 ms. (steps per millisecond=27 )
Probabilistic random walk after 162 steps, saw 86 distinct states, run finished after 9 ms. (steps per millisecond=18 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 9 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 10 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 175 transitions.
Computed a total of 9 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 59 transition count 106
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 59 transition count 106
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 52 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 52 transition count 92
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 52 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 51 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 51 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 50 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 50 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 92 place count 50 transition count 83
Applied a total of 92 rules in 5 ms. Remains 50 /94 variables (removed 44) and now considering 83/175 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 50/94 places, 83/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 105 edges and 94 vertex of which 10 / 94 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 57 transition count 108
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 57 transition count 108
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 72 place count 48 transition count 90
Iterating global reduction 0 with 9 rules applied. Total rules applied 81 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 84 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 47 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 46 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 46 transition count 81
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 46 transition count 77
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 97 place count 44 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 43 transition count 74
Applied a total of 98 rules in 17 ms. Remains 43 /94 variables (removed 51) and now considering 74/175 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 43/94 places, 74/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 59 transition count 106
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 59 transition count 106
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 79 place count 50 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 88 place count 50 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 92 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 94 place count 48 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 96 place count 48 transition count 78
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 98 place count 46 transition count 74
Iterating global reduction 1 with 2 rules applied. Total rules applied 100 place count 46 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 46 transition count 72
Applied a total of 102 rules in 5 ms. Remains 46 /94 variables (removed 48) and now considering 72/175 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 46/94 places, 72/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 72 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 60 transition count 108
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 60 transition count 108
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 53 transition count 94
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 53 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 84 place count 53 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 50 transition count 83
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 50 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 47 transition count 77
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 47 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 47 transition count 74
Applied a total of 99 rules in 5 ms. Remains 47 /94 variables (removed 47) and now considering 74/175 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 47/94 places, 74/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 74 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 119 edges and 94 vertex of which 8 / 94 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 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 57 transition count 107
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 57 transition count 107
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 72 place count 50 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 79 place count 50 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 81 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 48 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 87 place count 46 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 46 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 91 place count 46 transition count 79
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 93 place count 46 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 44 transition count 75
Applied a total of 95 rules in 14 ms. Remains 44 /94 variables (removed 50) and now considering 75/175 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 44/94 places, 75/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 127 edges and 94 vertex of which 10 / 94 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 55 transition count 104
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 55 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 76 place count 46 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 85 place count 46 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 89 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 43 transition count 73
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 43 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 41 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 41 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 41 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 41 transition count 62
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 110 place count 39 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 37 transition count 58
Applied a total of 112 rules in 13 ms. Remains 37 /94 variables (removed 57) and now considering 58/175 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 37/94 places, 58/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 57 transition count 102
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 57 transition count 102
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 48 transition count 84
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 48 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 95 place count 48 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 45 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 45 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 42 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 42 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 42 transition count 63
Applied a total of 110 rules in 4 ms. Remains 42 /94 variables (removed 52) and now considering 63/175 (removed 112) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 42/94 places, 63/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 126 edges and 94 vertex of which 12 / 94 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 56 transition count 107
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 56 transition count 107
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 73 place count 46 transition count 87
Iterating global reduction 0 with 10 rules applied. Total rules applied 83 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 87 place count 46 transition count 83
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 43 transition count 74
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 43 transition count 74
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 41 transition count 70
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 41 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 41 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 41 transition count 63
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 108 place count 39 transition count 61
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 37 transition count 59
Applied a total of 110 rules in 12 ms. Remains 37 /94 variables (removed 57) and now considering 59/175 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 37/94 places, 59/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 61 transition count 110
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 61 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 53 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 53 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 86 place count 53 transition count 90
Applied a total of 86 rules in 2 ms. Remains 53 /94 variables (removed 41) and now considering 90/175 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 53/94 places, 90/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 7 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 62 transition count 112
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 62 transition count 112
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 56 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 56 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 80 place count 56 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 55 transition count 93
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 55 transition count 93
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 54 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 54 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 54 transition count 90
Applied a total of 85 rules in 3 ms. Remains 54 /94 variables (removed 40) and now considering 90/175 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/94 places, 90/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 4 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 61 transition count 110
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 61 transition count 110
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 53 transition count 94
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 53 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 85 place count 53 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 88 place count 50 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 91 place count 50 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 47 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 47 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 100 place count 47 transition count 73
Applied a total of 100 rules in 2 ms. Remains 47 /94 variables (removed 47) and now considering 73/175 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 47/94 places, 73/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 66 transition count 120
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 66 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 59 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 59 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 72 place count 59 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 57 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 57 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 55 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 55 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 55 transition count 92
Applied a total of 82 rules in 2 ms. Remains 55 /94 variables (removed 39) and now considering 92/175 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 55/94 places, 92/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 60 transition count 108
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 60 transition count 108
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 76 place count 52 transition count 92
Iterating global reduction 0 with 8 rules applied. Total rules applied 84 place count 52 transition count 92
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 52 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 50 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 49 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 49 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 94 place count 49 transition count 80
Applied a total of 94 rules in 2 ms. Remains 49 /94 variables (removed 45) and now considering 80/175 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 49/94 places, 80/175 transitions.
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:42] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Graph (trivial) has 113 edges and 94 vertex of which 12 / 94 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 30 place count 58 transition count 111
Iterating global reduction 0 with 29 rules applied. Total rules applied 59 place count 58 transition count 111
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 68 place count 49 transition count 93
Iterating global reduction 0 with 9 rules applied. Total rules applied 77 place count 49 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 80 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 46 transition count 81
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 46 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 89 place count 43 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 92 place count 43 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 43 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 43 transition count 68
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 103 place count 41 transition count 66
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 39 transition count 64
Applied a total of 105 rules in 10 ms. Remains 39 /94 variables (removed 55) and now considering 64/175 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 39/94 places, 64/175 transitions.
[2024-06-01 00:12:43] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:12:43] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:12:43] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 175/175 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 58 transition count 104
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 58 transition count 104
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 81 place count 49 transition count 86
Iterating global reduction 0 with 9 rules applied. Total rules applied 90 place count 49 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 94 place count 49 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 47 transition count 76
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 46 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 46 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 46 transition count 73
Applied a total of 101 rules in 2 ms. Remains 46 /94 variables (removed 48) and now considering 73/175 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/94 places, 73/175 transitions.
[2024-06-01 00:12:43] [INFO ] Flatten gal took : 2 ms
[2024-06-01 00:12:43] [INFO ] Flatten gal took : 3 ms
[2024-06-01 00:12:43] [INFO ] Input system was already deterministic with 73 transitions.
[2024-06-01 00:12:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:12:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 00:12:43] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 00:12:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 94 places, 175 transitions and 462 arcs took 2 ms.
Total runtime 32702 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-00
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-01
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-02
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-03
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-05
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-06
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-07
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-08
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-09
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-10
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2024-11
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2023-12
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2023-13
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2023-14
Could not compute solution for formula : HealthRecord-PT-02-CTLCardinality-2023-15
BK_STOP 1717200763458
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/738/ctl_0_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/738/ctl_1_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/738/ctl_2_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/738/ctl_3_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/738/ctl_4_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/738/ctl_5_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/738/ctl_6_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/738/ctl_7_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/738/ctl_8_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/738/ctl_9_
ctl formula name HealthRecord-PT-02-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/738/ctl_10_
ctl formula name HealthRecord-PT-02-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/738/ctl_11_
ctl formula name HealthRecord-PT-02-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/738/ctl_12_
ctl formula name HealthRecord-PT-02-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/738/ctl_13_
ctl formula name HealthRecord-PT-02-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/738/ctl_14_
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-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HealthRecord-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640604000705"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-02.tgz
mv HealthRecord-PT-02 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;