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-171734921100033.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-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K 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 75K 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-05-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-05-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717352315339

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:18:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:18:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:18:37] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-02 18:18:37] [INFO ] Transformed 115 places.
[2024-06-02 18:18:37] [INFO ] Transformed 257 transitions.
[2024-06-02 18:18:37] [INFO ] Found NUPN structural information;
[2024-06-02 18:18:37] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA MedleyA-PT-05-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 77 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 113 transition count 250
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 250
Applied a total of 4 rules in 48 ms. Remains 113 /115 variables (removed 2) and now considering 250/254 (removed 4) transitions.
[2024-06-02 18:18:37] [INFO ] Flow matrix only has 249 transitions (discarded 1 similar events)
// Phase 1: matrix 249 rows 113 cols
[2024-06-02 18:18:37] [INFO ] Computed 20 invariants in 25 ms
[2024-06-02 18:18:38] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-06-02 18:18:38] [INFO ] Flow matrix only has 249 transitions (discarded 1 similar events)
[2024-06-02 18:18:38] [INFO ] Invariant cache hit.
[2024-06-02 18:18:38] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 18:18:38] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-06-02 18:18:38] [INFO ] Flow matrix only has 249 transitions (discarded 1 similar events)
[2024-06-02 18:18:38] [INFO ] Invariant cache hit.
[2024-06-02 18:18:38] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 21 ms to minimize.
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 4 ms to minimize.
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:18:42] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-02 18:18:43] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:18:45] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:18:45] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:18:46] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-06-02 18:18:46] [INFO ] Deduced a trap composed of 40 places in 83 ms of which 2 ms to minimize.
[2024-06-02 18:18:46] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:18:47] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:18:47] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 248/361 variables, 113/155 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 93/248 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (OVERLAPS) 1/362 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 12 (OVERLAPS) 0/362 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 249 constraints, problems are : Problem set: 0 solved, 249 unsolved in 22782 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 22/42 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:19:03] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:19:03] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:19:03] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:19:03] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:19:04] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:19:05] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 248/361 variables, 113/162 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 93/255 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 249/504 constraints. Problems are: Problem set: 0 solved, 249 unsolved
[2024-06-02 18:19:10] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/361 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 13 (OVERLAPS) 1/362 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 15 (OVERLAPS) 0/362 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 506 constraints, problems are : Problem set: 0 solved, 249 unsolved in 29560 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 30/30 constraints]
After SMT, in 52951ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 52986ms
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 250/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54016 ms. Remains : 113/115 places, 250/254 transitions.
Support contains 77 out of 113 places after structural reductions.
[2024-06-02 18:19:31] [INFO ] Flatten gal took : 72 ms
[2024-06-02 18:19:32] [INFO ] Flatten gal took : 31 ms
[2024-06-02 18:19:32] [INFO ] Input system was already deterministic with 250 transitions.
Support contains 76 out of 113 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (2987 resets) in 2340 ms. (17 steps per ms) remains 23/72 properties
BEST_FIRST walk for 4002 steps (42 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (47 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (45 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (42 resets) in 34 ms. (114 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (47 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (45 resets) in 25 ms. (153 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (49 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (47 resets) in 21 ms. (182 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (46 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (53 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (50 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (44 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (44 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (45 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (43 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
[2024-06-02 18:19:33] [INFO ] Flow matrix only has 249 transitions (discarded 1 similar events)
[2024-06-02 18:19:33] [INFO ] Invariant cache hit.
[2024-06-02 18:19:33] [INFO ] State equation strengthened by 94 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 68/99 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 4/103 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 9/112 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 248/360 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 93/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 1/361 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 1/362 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/362 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 227 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 68/99 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:19:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:19:35] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:19:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 4/103 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 9/112 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:19:35] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:19:35] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:19:35] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 248/360 variables, 112/138 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 93/231 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 16/247 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-06-02 18:19:36] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 1/361 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/361 variables, 6/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/361 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 1/362 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/362 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 0/362 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 256 constraints, problems are : Problem set: 0 solved, 22 unsolved in 4069 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 113/113 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 7/7 constraints]
After SMT, in 5657ms problems are : Problem set: 0 solved, 22 unsolved
Fused 22 Parikh solutions to 20 different solutions.
Parikh walk visited 21 properties in 2304 ms.
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 250/250 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 112 transition count 247
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 19 place count 97 transition count 217
Iterating global reduction 2 with 15 rules applied. Total rules applied 34 place count 97 transition count 217
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 56 place count 86 transition count 302
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 86 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 99 place count 86 transition count 259
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 3 with 18 rules applied. Total rules applied 117 place count 86 transition count 391
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 3 with 56 rules applied. Total rules applied 173 place count 68 transition count 353
Applied a total of 173 rules in 149 ms. Remains 68 /113 variables (removed 45) and now considering 353/250 (removed -103) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 68/113 places, 353/250 transitions.
RANDOM walk for 40000 steps (4754 resets) in 1917 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (139 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1455027 steps, run timeout after 3001 ms. (steps per millisecond=484 ) properties seen :0 out of 1
Probabilistic random walk after 1455027 steps, saw 233653 distinct states, run finished after 3006 ms. (steps per millisecond=484 ) properties seen :0
// Phase 1: matrix 353 rows 68 cols
[2024-06-02 18:19:44] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 18:19:44] [INFO ] State equation strengthened by 194 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/57 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/67 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 353/420 variables, 67/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 194/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/421 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/421 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 282 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/57 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:19:45] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/67 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 353/420 variables, 67/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 194/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/421 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/421 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 421/421 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 766ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 353/353 transitions.
Applied a total of 0 rules in 30 ms. Remains 68 /68 variables (removed 0) and now considering 353/353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 68/68 places, 353/353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 353/353 transitions.
Applied a total of 0 rules in 26 ms. Remains 68 /68 variables (removed 0) and now considering 353/353 (removed 0) transitions.
[2024-06-02 18:19:45] [INFO ] Invariant cache hit.
[2024-06-02 18:19:45] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-02 18:19:45] [INFO ] Invariant cache hit.
[2024-06-02 18:19:46] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-06-02 18:19:46] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-06-02 18:19:46] [INFO ] Redundant transitions in 37 ms returned []
Running 351 sub problems to find dead transitions.
[2024-06-02 18:19:46] [INFO ] Invariant cache hit.
[2024-06-02 18:19:46] [INFO ] State equation strengthened by 194 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 353/421 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 194/282 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (OVERLAPS) 0/421 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 351 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 282 constraints, problems are : Problem set: 0 solved, 351 unsolved in 16085 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 4 (OVERLAPS) 353/421 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 194/282 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 351/633 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 351 unsolved
[2024-06-02 18:20:24] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/421 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 634 constraints, problems are : Problem set: 0 solved, 351 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 351/351 constraints, Known Traps: 1/1 constraints]
After SMT, in 47290ms problems are : Problem set: 0 solved, 351 unsolved
Search for dead transitions found 0 dead transitions in 47298ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48049 ms. Remains : 68/68 places, 353/353 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 35 edges and 68 vertex of which 6 / 68 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 377 edges and 64 vertex of which 55 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 36 place count 55 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 52 place count 55 transition count 293
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 55 transition count 291
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 92 place count 53 transition count 255
Free-agglomeration rule (complex) applied 5 times with reduction of 26 identical transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 53 transition count 273
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 118 place count 48 transition count 257
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 133 place count 48 transition count 257
Applied a total of 133 rules in 64 ms. Remains 48 /68 variables (removed 20) and now considering 257/353 (removed 96) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 257 rows 48 cols
[2024-06-02 18:20:33] [INFO ] Computed 14 invariants in 4 ms
[2024-06-02 18:20:33] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 18:20:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 18:20:33] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-02 18:20:33] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 18:20:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 18:20:33] [INFO ] After 25ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-02 18:20:34] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-02 18:20:34] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 317 ms.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 250 transitions.
Computed a total of 14 stabilizing places and 88 stable transitions
Graph (complete) has 554 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Graph (complete) has 554 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 110 transition count 247
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 19 place count 94 transition count 215
Iterating global reduction 2 with 16 rules applied. Total rules applied 35 place count 94 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 94 transition count 212
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 44 place count 91 transition count 209
Applied a total of 44 rules in 34 ms. Remains 91 /113 variables (removed 22) and now considering 209/250 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 91/113 places, 209/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 209 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 111 transition count 248
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 17 place count 96 transition count 218
Iterating global reduction 2 with 15 rules applied. Total rules applied 32 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 96 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 93 transition count 212
Applied a total of 41 rules in 30 ms. Remains 93 /113 variables (removed 20) and now considering 212/250 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 93/113 places, 212/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 99 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 99 transition count 222
Applied a total of 28 rules in 5 ms. Remains 99 /113 variables (removed 14) and now considering 222/250 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 99/113 places, 222/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 16 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 97 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 97 transition count 218
Applied a total of 32 rules in 5 ms. Remains 97 /113 variables (removed 16) and now considering 218/250 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 97/113 places, 218/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 101 transition count 226
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 101 transition count 226
Applied a total of 24 rules in 5 ms. Remains 101 /113 variables (removed 12) and now considering 226/250 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 101/113 places, 226/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 99 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 99 transition count 222
Applied a total of 28 rules in 4 ms. Remains 99 /113 variables (removed 14) and now considering 222/250 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/113 places, 222/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Graph (complete) has 554 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 110 transition count 247
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 18 place count 95 transition count 217
Iterating global reduction 2 with 15 rules applied. Total rules applied 33 place count 95 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 95 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 92 transition count 211
Applied a total of 42 rules in 30 ms. Remains 92 /113 variables (removed 21) and now considering 211/250 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 92/113 places, 211/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 98 transition count 220
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 98 transition count 220
Applied a total of 30 rules in 3 ms. Remains 98 /113 variables (removed 15) and now considering 220/250 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/113 places, 220/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 102 transition count 228
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 102 transition count 228
Applied a total of 22 rules in 3 ms. Remains 102 /113 variables (removed 11) and now considering 228/250 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 102/113 places, 228/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 99 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 99 transition count 222
Applied a total of 28 rules in 3 ms. Remains 99 /113 variables (removed 14) and now considering 222/250 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/113 places, 222/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:34] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Graph (complete) has 554 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 110 transition count 247
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 17 place count 96 transition count 219
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 96 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 96 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 93 transition count 213
Applied a total of 40 rules in 26 ms. Remains 93 /113 variables (removed 20) and now considering 213/250 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 93/113 places, 213/250 transitions.
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:20:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:35] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 98 transition count 220
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 98 transition count 220
Applied a total of 30 rules in 3 ms. Remains 98 /113 variables (removed 15) and now considering 220/250 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 98/113 places, 220/250 transitions.
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:35] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Graph (complete) has 554 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 110 transition count 247
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 17 place count 96 transition count 219
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 96 transition count 219
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 96 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 93 transition count 213
Applied a total of 40 rules in 24 ms. Remains 93 /113 variables (removed 20) and now considering 213/250 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 93/113 places, 213/250 transitions.
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:20:35] [INFO ] Input system was already deterministic with 213 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 99 transition count 222
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 99 transition count 222
Applied a total of 28 rules in 3 ms. Remains 99 /113 variables (removed 14) and now considering 222/250 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/113 places, 222/250 transitions.
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:20:35] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 250/250 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 97 transition count 218
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 97 transition count 218
Applied a total of 32 rules in 3 ms. Remains 97 /113 variables (removed 16) and now considering 218/250 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/113 places, 218/250 transitions.
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:35] [INFO ] Input system was already deterministic with 218 transitions.
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:20:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:20:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-02 18:20:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 250 transitions and 1143 arcs took 4 ms.
Total runtime 118224 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-05-CTLCardinality-2024-00
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-02
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-03
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-04
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-05
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-06
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-07
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-08
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-09
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-11
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-14
Could not compute solution for formula : MedleyA-PT-05-CTLCardinality-2024-15

BK_STOP 1717352435812

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-05.tgz
mv MedleyA-PT-05 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;