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.r579-smll-171734921100018.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 MedleyA-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 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 MedleyA-PT-03-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-03-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717351751120

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:09:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:09:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:09:13] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-06-02 18:09:14] [INFO ] Transformed 108 places.
[2024-06-02 18:09:14] [INFO ] Transformed 100 transitions.
[2024-06-02 18:09:14] [INFO ] Found NUPN structural information;
[2024-06-02 18:09:14] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Support contains 75 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 100/100 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 106 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 106 transition count 99
Applied a total of 3 rules in 62 ms. Remains 106 /108 variables (removed 2) and now considering 99/100 (removed 1) transitions.
// Phase 1: matrix 99 rows 106 cols
[2024-06-02 18:09:14] [INFO ] Computed 8 invariants in 31 ms
[2024-06-02 18:09:14] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-02 18:09:14] [INFO ] Invariant cache hit.
[2024-06-02 18:09:15] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2024-06-02 18:09:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:16] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 28 ms to minimize.
[2024-06-02 18:09:16] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:09:16] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:09:16] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:09:16] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:09:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 2 ms to minimize.
[2024-06-02 18:09:18] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 9/34 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:19] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:09:20] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:21] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 4 ms to minimize.
[2024-06-02 18:09:21] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:09:21] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:09:21] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:22] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:09:22] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 99/205 variables, 106/154 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:23] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:25] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/205 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:27] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-02 18:09:27] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/205 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 16 (OVERLAPS) 0/205 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 159 constraints, problems are : Problem set: 0 solved, 98 unsolved in 14610 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:30] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-06-02 18:09:31] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:09:31] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/205 variables, 106/162 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 98/260 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:32] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:36] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/205 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:42] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/205 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:45] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2024-06-02 18:09:45] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:09:45] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
[2024-06-02 18:09:46] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:09:46] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 4 ms to minimize.
[2024-06-02 18:09:46] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:09:53] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/205 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/205 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 205/205 variables, and 270 constraints, problems are : Problem set: 0 solved, 98 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 58/58 constraints]
After SMT, in 44765ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 44794ms
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 99/100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45725 ms. Remains : 106/108 places, 99/100 transitions.
Support contains 75 out of 106 places after structural reductions.
[2024-06-02 18:10:00] [INFO ] Flatten gal took : 60 ms
[2024-06-02 18:10:00] [INFO ] Flatten gal took : 24 ms
[2024-06-02 18:10:00] [INFO ] Input system was already deterministic with 99 transitions.
Support contains 73 out of 106 places (down from 75) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 73 to 70
RANDOM walk for 40000 steps (669 resets) in 2477 ms. (16 steps per ms) remains 9/70 properties
BEST_FIRST walk for 40001 steps (197 resets) in 414 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (201 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (176 resets) in 164 ms. (242 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (198 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (190 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (168 resets) in 239 ms. (166 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (177 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (187 resets) in 83 ms. (476 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (184 resets) in 234 ms. (170 steps per ms) remains 8/8 properties
[2024-06-02 18:10:02] [INFO ] Invariant cache hit.
Problem AtomicPropp51 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 76/91 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 99/190 variables, 91/99 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/100 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/100 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/205 variables, 15/115 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 115 constraints, problems are : Problem set: 3 solved, 5 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/32 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 59/91 variables, 6/8 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/9 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 3 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 3/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 99/190 variables, 91/103 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-02 18:10:02] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/104 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 15/205 variables, 15/119 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 4/123 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/205 variables, 0/123 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 123 constraints, problems are : Problem set: 4 solved, 4 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 1015ms problems are : Problem set: 4 solved, 4 unsolved
Parikh walk visited 0 properties in 2849 ms.
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 99/99 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 106 transition count 78
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 85 transition count 78
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 42 place count 85 transition count 71
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 78 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 72 transition count 65
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 72 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 110 place count 51 transition count 44
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 51 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 50 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 49 transition count 42
Applied a total of 113 rules in 42 ms. Remains 49 /106 variables (removed 57) and now considering 42/99 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 49/106 places, 42/99 transitions.
RANDOM walk for 40000 steps (1753 resets) in 353 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (587 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (648 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (660 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (681 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
Probably explored full state space saw : 213087 states, properties seen :3
Probabilistic random walk after 744896 steps, saw 213087 distinct states, run finished after 941 ms. (steps per millisecond=791 ) properties seen :3
Explored full state space saw : 213087 states, properties seen :0
Exhaustive walk after 744896 steps, saw 213087 distinct states, run finished after 568 ms. (steps per millisecond=1311 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-02 18:10:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:10:07] [INFO ] Flatten gal took : 11 ms
FORMULA MedleyA-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:10:07] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:10:07] [INFO ] Input system was already deterministic with 99 transitions.
Computed a total of 106 stabilizing places and 99 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 transition count 99
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA MedleyA-PT-03-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 93 transition count 86
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 92 transition count 85
Applied a total of 28 rules in 17 ms. Remains 92 /106 variables (removed 14) and now considering 85/99 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 92/106 places, 85/99 transitions.
[2024-06-02 18:10:07] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:07] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:07] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Applied a total of 24 rules in 11 ms. Remains 94 /106 variables (removed 12) and now considering 87/99 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 94/106 places, 87/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 9 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 93/106 places, 86/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 105 transition count 76
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 83 transition count 76
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 44 place count 83 transition count 70
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 77 transition count 70
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 71 transition count 64
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 71 transition count 64
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 68 place count 71 transition count 63
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 70 transition count 63
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 98 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 48
Applied a total of 99 rules in 19 ms. Remains 55 /106 variables (removed 51) and now considering 48/99 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 55/106 places, 48/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 105 transition count 77
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 84 transition count 77
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 42 place count 84 transition count 70
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 56 place count 77 transition count 70
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 69 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 69 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 72 place count 69 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 68 transition count 61
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 98 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 55 transition count 48
Applied a total of 99 rules in 16 ms. Remains 55 /106 variables (removed 51) and now considering 48/99 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 55/106 places, 48/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 30 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-03-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Applied a total of 22 rules in 3 ms. Remains 95 /106 variables (removed 11) and now considering 88/99 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 95/106 places, 88/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 89
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 89
Applied a total of 20 rules in 3 ms. Remains 96 /106 variables (removed 10) and now considering 89/99 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/106 places, 89/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 105 transition count 82
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 89 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 88 transition count 81
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 88 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 82 transition count 75
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 78 transition count 71
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 78 transition count 71
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 78 place count 66 transition count 59
Applied a total of 78 rules in 13 ms. Remains 66 /106 variables (removed 40) and now considering 59/99 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 66/106 places, 59/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 59 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 93 transition count 86
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 92 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 92 transition count 85
Applied a total of 28 rules in 4 ms. Remains 92 /106 variables (removed 14) and now considering 85/99 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 92/106 places, 85/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 87
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 93 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 93 transition count 86
Applied a total of 26 rules in 4 ms. Remains 93 /106 variables (removed 13) and now considering 86/99 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 93/106 places, 86/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 105 transition count 87
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 93 transition count 86
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 24 place count 93 transition count 79
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 38 place count 86 transition count 79
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 45 place count 79 transition count 72
Iterating global reduction 3 with 7 rules applied. Total rules applied 52 place count 79 transition count 72
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 70 place count 70 transition count 63
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 70 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 69 transition count 62
Applied a total of 72 rules in 18 ms. Remains 69 /106 variables (removed 37) and now considering 62/99 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 69/106 places, 62/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 91
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 97 transition count 90
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 97 transition count 90
Applied a total of 18 rules in 3 ms. Remains 97 /106 variables (removed 9) and now considering 90/99 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/106 places, 90/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 105 transition count 80
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 87 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 86 transition count 79
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 38 place count 86 transition count 71
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 54 place count 78 transition count 71
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 61 place count 71 transition count 64
Iterating global reduction 3 with 7 rules applied. Total rules applied 68 place count 71 transition count 64
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 94 place count 58 transition count 51
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 57 transition count 50
Applied a total of 96 rules in 16 ms. Remains 57 /106 variables (removed 49) and now considering 50/99 (removed 49) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 57/106 places, 50/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 3 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 95 transition count 88
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 95 transition count 88
Applied a total of 22 rules in 3 ms. Remains 95 /106 variables (removed 11) and now considering 88/99 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 95/106 places, 88/99 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 6 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:10:08] [INFO ] Input system was already deterministic with 88 transitions.
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:10:08] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:10:08] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-02 18:10:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 99 transitions and 269 arcs took 2 ms.
Total runtime 54893 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 : MedleyA-PT-03-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-03-CTLFireability-2024-15

BK_STOP 1717351808908

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

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