fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r553-tall-171734901100209
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FireWire-PT-06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
568.144 51155.00 79504.00 163.50 ???TT????F?????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901100209.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 FireWire-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K 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.6K 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 90K 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 FireWire-PT-06-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717354144051

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:49:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:49:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:49:05] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 18:49:05] [INFO ] Transformed 116 places.
[2024-06-02 18:49:05] [INFO ] Transformed 368 transitions.
[2024-06-02 18:49:05] [INFO ] Found NUPN structural information;
[2024-06-02 18:49:05] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
FORMULA FireWire-PT-06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 312/312 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 116 transition count 306
Applied a total of 6 rules in 22 ms. Remains 116 /116 variables (removed 0) and now considering 306/312 (removed 6) transitions.
[2024-06-02 18:49:05] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 18:49:05] [INFO ] Computed 9 invariants in 14 ms
[2024-06-02 18:49:05] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-06-02 18:49:05] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 18:49:05] [INFO ] Invariant cache hit.
[2024-06-02 18:49:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-02 18:49:05] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-02 18:49:05] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 18:49:05] [INFO ] Invariant cache hit.
[2024-06-02 18:49:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 18:49:08] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
[2024-06-02 18:49:08] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:49:08] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:49:08] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:49:09] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:49:09] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-02 18:49:09] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:49:09] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2024-06-02 18:49:09] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-02 18:49:10] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:49:10] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 293 constraints, problems are : Problem set: 0 solved, 305 unsolved in 16372 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 9/124 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 11/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 305/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (OVERLAPS) 1/396 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (OVERLAPS) 0/396 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 598 constraints, problems are : Problem set: 0 solved, 305 unsolved in 20538 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 11/11 constraints]
After SMT, in 37202ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 37228ms
Starting structural reductions in LTL mode, iteration 1 : 116/116 places, 306/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37711 ms. Remains : 116/116 places, 306/312 transitions.
Support contains 76 out of 116 places after structural reductions.
[2024-06-02 18:49:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-02 18:49:43] [INFO ] Flatten gal took : 48 ms
FORMULA FireWire-PT-06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:49:43] [INFO ] Flatten gal took : 23 ms
[2024-06-02 18:49:43] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 66 out of 116 places (down from 76) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 51 to 50
RANDOM walk for 40000 steps (1969 resets) in 1777 ms. (22 steps per ms) remains 21/50 properties
BEST_FIRST walk for 4004 steps (46 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (69 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (53 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (49 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (103 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (58 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (51 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (63 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (49 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (50 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (60 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (48 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (40 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
[2024-06-02 18:49:44] [INFO ] Flow matrix only has 280 transitions (discarded 26 similar events)
[2024-06-02 18:49:44] [INFO ] Invariant cache hit.
[2024-06-02 18:49:44] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 2 (OVERLAPS) 81/116 variables, 9/44 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 81/125 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 5/130 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/131 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-02 18:49:44] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/132 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 279/395 variables, 116/248 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 40/288 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-02 18:49:45] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 1/289 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 0/289 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 1/396 variables, 1/290 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 0/396 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 290 constraints, problems are : Problem set: 3 solved, 18 unsolved in 1531 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 3 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 80/107 variables, 6/33 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 80/113 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 6/119 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-02 18:49:45] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 1/120 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/120 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 9/116 variables, 3/123 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 9/132 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 2/134 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-02 18:49:46] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:49:46] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/136 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/136 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 279/395 variables, 116/252 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 40/292 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 18/310 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 1/396 variables, 1/311 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 18 (OVERLAPS) 0/396 variables, 0/311 constraints. Problems are: Problem set: 3 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 311 constraints, problems are : Problem set: 3 solved, 18 unsolved in 1518 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/21 constraints, Known Traps: 11/11 constraints]
After SMT, in 3068ms problems are : Problem set: 3 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 898 ms.
Support contains 25 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 306/306 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 116 transition count 302
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 114 transition count 301
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 112 transition count 305
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 110 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 109 transition count 297
Applied a total of 21 rules in 60 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 109/116 places, 297/306 transitions.
RANDOM walk for 40000 steps (2407 resets) in 420 ms. (95 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (70 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (47 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (63 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (66 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (65 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (56 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (37 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (60 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (70 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (56 resets) in 10 ms. (363 steps per ms) remains 12/15 properties
BEST_FIRST walk for 4002 steps (78 resets) in 22 ms. (174 steps per ms) remains 12/12 properties
[2024-06-02 18:49:48] [INFO ] Flow matrix only has 271 transitions (discarded 26 similar events)
// Phase 1: matrix 271 rows 109 cols
[2024-06-02 18:49:48] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:49:48] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 83/104 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:49:48] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:49:48] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:49:48] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-06-02 18:49:48] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 269/373 variables, 104/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 40/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 7/380 variables, 5/263 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/380 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 270 constraints, problems are : Problem set: 0 solved, 12 unsolved in 959 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 83/104 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 83/110 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:49:49] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 269/373 variables, 104/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 40/259 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/373 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:49:49] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 18:49:49] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/373 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/373 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 7/380 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/380 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/380 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/380 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-02 18:49:50] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/380 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/380 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 0/380 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 286 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1382 ms.
Refiners :[Domain max(s): 109/109 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 8/8 constraints]
After SMT, in 2353ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 9 properties in 1676 ms.
Support contains 10 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 297/297 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 296
Applied a total of 2 rules in 15 ms. Remains 108 /109 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 108/109 places, 296/297 transitions.
RANDOM walk for 40000 steps (2465 resets) in 160 ms. (248 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (576 resets) in 69 ms. (571 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (567 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (606 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
[2024-06-02 18:49:52] [INFO ] Flow matrix only has 270 transitions (discarded 26 similar events)
// Phase 1: matrix 270 rows 108 cols
[2024-06-02 18:49:52] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:49:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 93/101 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-02 18:49:52] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 268/369 variables, 101/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 40/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 9/378 variables, 7/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 7/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/378 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 285 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 93/101 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 268/369 variables, 101/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 40/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:49:53] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/378 variables, 7/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 7/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:49:53] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/378 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/378 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 350 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 108/108 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 643ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 307 ms.
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 296/296 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 107 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 293
Applied a total of 4 rules in 21 ms. Remains 107 /108 variables (removed 1) and now considering 293/296 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 107/108 places, 293/296 transitions.
RANDOM walk for 40000 steps (2364 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (631 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (625 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 94886 steps, run visited all 2 properties in 225 ms. (steps per millisecond=421 )
Probabilistic random walk after 94886 steps, saw 20553 distinct states, run finished after 228 ms. (steps per millisecond=416 ) properties seen :2
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 59 out of 116 places (down from 60) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Applied a total of 8 rules in 24 ms. Remains 112 /116 variables (removed 4) and now considering 299/306 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 112/116 places, 299/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 299 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 4 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 110 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 27 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 109/116 places, 297/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 110 transition count 297
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 26 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 109/116 places, 297/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 116 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 114 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 114 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 113 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 113 transition count 300
Applied a total of 8 rules in 17 ms. Remains 113 /116 variables (removed 3) and now considering 300/306 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 113/116 places, 300/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 116/116 places, 306/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Applied a total of 0 rules in 1 ms. Remains 116 /116 variables (removed 0) and now considering 306/306 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 116/116 places, 306/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 306 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 115 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 302
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 112 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 112 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 10 place count 110 transition count 297
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 109 transition count 297
Applied a total of 12 rules in 22 ms. Remains 109 /116 variables (removed 7) and now considering 297/306 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 109/116 places, 297/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 306/306 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 115 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 115 transition count 304
Applied a total of 2 rules in 2 ms. Remains 115 /116 variables (removed 1) and now considering 304/306 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 115/116 places, 304/306 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:54] [INFO ] Input system was already deterministic with 304 transitions.
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:54] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 18:49:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 306 transitions and 1118 arcs took 2 ms.
Total runtime 49642 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 : FireWire-PT-06-CTLCardinality-2024-00
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-02
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-05
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-06
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-11
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-12
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-13
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-14
Could not compute solution for formula : FireWire-PT-06-CTLCardinality-2024-15

BK_STOP 1717354195206

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 FireWire-PT-06-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/644/ctl_0_
ctl formula name FireWire-PT-06-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/644/ctl_1_
ctl formula name FireWire-PT-06-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/644/ctl_2_
ctl formula name FireWire-PT-06-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/644/ctl_3_
ctl formula name FireWire-PT-06-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/644/ctl_4_
ctl formula name FireWire-PT-06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/644/ctl_5_
ctl formula name FireWire-PT-06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/644/ctl_6_
ctl formula name FireWire-PT-06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/644/ctl_7_
ctl formula name FireWire-PT-06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/644/ctl_8_
ctl formula name FireWire-PT-06-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/644/ctl_9_
ctl formula name FireWire-PT-06-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/644/ctl_10_
ctl formula name FireWire-PT-06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/644/ctl_11_
ctl formula name FireWire-PT-06-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/644/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="FireWire-PT-06"
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 FireWire-PT-06, 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 r553-tall-171734901100209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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