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.r575-smll-171734919600121.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 greatspnxred
Input is MedleyA-PT-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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-16-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717365054737

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:50:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:50:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:50:57] [INFO ] Load time of PNML (sax parser for PT used): 274 ms
[2024-06-02 21:50:57] [INFO ] Transformed 196 places.
[2024-06-02 21:50:57] [INFO ] Transformed 392 transitions.
[2024-06-02 21:50:57] [INFO ] Found NUPN structural information;
[2024-06-02 21:50:57] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 505 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 177 transition count 362
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 177 transition count 362
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 50 place count 177 transition count 350
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 176 transition count 349
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 176 transition count 349
Applied a total of 52 rules in 85 ms. Remains 176 /196 variables (removed 20) and now considering 349/390 (removed 41) transitions.
// Phase 1: matrix 349 rows 176 cols
[2024-06-02 21:50:57] [INFO ] Computed 7 invariants in 37 ms
[2024-06-02 21:50:58] [INFO ] Implicit Places using invariants in 462 ms returned []
[2024-06-02 21:50:58] [INFO ] Invariant cache hit.
[2024-06-02 21:50:58] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-06-02 21:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:03] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 31 ms to minimize.
[2024-06-02 21:51:03] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 4 ms to minimize.
[2024-06-02 21:51:03] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 3 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:51:04] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:51:05] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:51:05] [INFO ] Deduced a trap composed of 105 places in 97 ms of which 2 ms to minimize.
[2024-06-02 21:51:05] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:51:05] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:51:05] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:51:05] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 10 ms to minimize.
[2024-06-02 21:51:06] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:51:06] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:51:06] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:51:06] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:07] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 3 ms to minimize.
[2024-06-02 21:51:07] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 3 ms to minimize.
[2024-06-02 21:51:07] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:51:07] [INFO ] Deduced a trap composed of 40 places in 199 ms of which 4 ms to minimize.
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-06-02 21:51:08] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 111 places in 92 ms of which 3 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:51:09] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 3 ms to minimize.
[2024-06-02 21:51:10] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 8 ms to minimize.
[2024-06-02 21:51:10] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 16/43 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:14] [INFO ] Deduced a trap composed of 120 places in 162 ms of which 3 ms to minimize.
[2024-06-02 21:51:14] [INFO ] Deduced a trap composed of 121 places in 133 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:16] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 3 ms to minimize.
[2024-06-02 21:51:17] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 5 ms to minimize.
[2024-06-02 21:51:18] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:51:18] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:21] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 8 (OVERLAPS) 349/525 variables, 176/226 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 226 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:33] [INFO ] Deduced a trap composed of 129 places in 138 ms of which 3 ms to minimize.
[2024-06-02 21:51:33] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 3 ms to minimize.
[2024-06-02 21:51:34] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 349/525 variables, 176/229 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 348/577 constraints. Problems are: Problem set: 0 solved, 348 unsolved
[2024-06-02 21:51:47] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 3 ms to minimize.
[2024-06-02 21:51:49] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 348 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 579 constraints, problems are : Problem set: 0 solved, 348 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 48/48 constraints]
After SMT, in 60517ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 60563ms
Starting structural reductions in LTL mode, iteration 1 : 176/196 places, 349/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61699 ms. Remains : 176/196 places, 349/390 transitions.
Support contains 68 out of 176 places after structural reductions.
[2024-06-02 21:51:59] [INFO ] Flatten gal took : 81 ms
[2024-06-02 21:51:59] [INFO ] Flatten gal took : 38 ms
[2024-06-02 21:51:59] [INFO ] Input system was already deterministic with 349 transitions.
Support contains 64 out of 176 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2235 ms. (17 steps per ms) remains 37/42 properties
BEST_FIRST walk for 4002 steps (8 resets) in 157 ms. (25 steps per ms) remains 34/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 161 ms. (24 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 111 ms. (35 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
[2024-06-02 21:52:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 126/172 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 21:52:01] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 4/176 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 349/525 variables, 176/184 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/525 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 184 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1964 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 126/172 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 21:52:03] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:52:03] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
[2024-06-02 21:52:03] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:52:03] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:52:03] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
[2024-06-02 21:52:03] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:52:04] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 21:52:05] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:52:05] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:52:05] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 3 ms to minimize.
[2024-06-02 21:52:05] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 4/176 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 349/525 variables, 176/201 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 33/234 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/525 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 234 constraints, problems are : Problem set: 0 solved, 33 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 18/18 constraints]
After SMT, in 7007ms problems are : Problem set: 0 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 349/349 transitions.
Graph (trivial) has 111 edges and 176 vertex of which 5 / 176 are part of one of the 1 SCC in 5 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 172 transition count 328
Reduce places removed 16 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 156 transition count 325
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 153 transition count 325
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 153 transition count 320
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 148 transition count 320
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 143 transition count 312
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 143 transition count 312
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 143 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 60 place count 143 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 64 place count 141 transition count 309
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 100 place count 123 transition count 291
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 123 transition count 290
Performed 14 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 129 place count 109 transition count 366
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 132 place count 109 transition count 363
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 6 with 21 rules applied. Total rules applied 153 place count 109 transition count 342
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 108 transition count 341
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 108 transition count 341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 157 place count 107 transition count 350
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 166 place count 107 transition count 341
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 175 place count 98 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 186 place count 98 transition count 330
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 188 place count 98 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 190 place count 98 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 97 transition count 327
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 22 edges and 96 vertex of which 4 / 96 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 193 place count 94 transition count 327
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 201 place count 94 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 9 with 33 rules applied. Total rules applied 234 place count 94 transition count 286
Applied a total of 234 rules in 165 ms. Remains 94 /176 variables (removed 82) and now considering 286/349 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 94/176 places, 286/349 transitions.
RANDOM walk for 31731 steps (946 resets) in 509 ms. (62 steps per ms) remains 0/33 properties
[2024-06-02 21:52:08] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:52:08] [INFO ] Flatten gal took : 29 ms
[2024-06-02 21:52:08] [INFO ] Input system was already deterministic with 349 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 156 transition count 316
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 156 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 156 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 155 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 155 transition count 312
Applied a total of 45 rules in 35 ms. Remains 155 /176 variables (removed 21) and now considering 312/349 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 155/176 places, 312/349 transitions.
[2024-06-02 21:52:08] [INFO ] Flatten gal took : 32 ms
[2024-06-02 21:52:08] [INFO ] Flatten gal took : 33 ms
[2024-06-02 21:52:08] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 14 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 21:52:08] [INFO ] Flatten gal took : 28 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 31 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Graph (trivial) has 192 edges and 176 vertex of which 13 / 176 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 165 transition count 306
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 133 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 131 transition count 302
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 71 place count 131 transition count 297
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 81 place count 126 transition count 297
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 99 place count 108 transition count 264
Iterating global reduction 3 with 18 rules applied. Total rules applied 117 place count 108 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 3 with 2 rules applied. Total rules applied 119 place count 108 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 107 transition count 262
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 120 place count 107 transition count 259
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 104 transition count 259
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 128 place count 102 transition count 253
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 102 transition count 253
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 160 place count 87 transition count 238
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 164 place count 83 transition count 229
Iterating global reduction 5 with 4 rules applied. Total rules applied 168 place count 83 transition count 229
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 181 place count 83 transition count 216
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 181 place count 83 transition count 214
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 185 place count 81 transition count 214
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 193 place count 77 transition count 210
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 195 place count 75 transition count 208
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 73 vertex of which 26 / 73 are part of one of the 10 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 198 place count 57 transition count 208
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 238 place count 57 transition count 168
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 239 place count 56 transition count 158
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 56 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 7 with 51 rules applied. Total rules applied 291 place count 56 transition count 107
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 296 place count 56 transition count 102
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 301 place count 51 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 305 place count 49 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 307 place count 49 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 309 place count 49 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 311 place count 47 transition count 96
Applied a total of 311 rules in 116 ms. Remains 47 /176 variables (removed 129) and now considering 96/349 (removed 253) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116 ms. Remains : 47/176 places, 96/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 308
Applied a total of 49 rules in 7 ms. Remains 153 /176 variables (removed 23) and now considering 308/349 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 153/176 places, 308/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 313
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 313
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 309
Applied a total of 47 rules in 7 ms. Remains 154 /176 variables (removed 22) and now considering 309/349 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 154/176 places, 309/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 309 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 156 transition count 316
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 156 transition count 316
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 156 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 155 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 155 transition count 312
Applied a total of 45 rules in 7 ms. Remains 155 /176 variables (removed 21) and now considering 312/349 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 155/176 places, 312/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 7 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 308
Applied a total of 49 rules in 6 ms. Remains 153 /176 variables (removed 23) and now considering 308/349 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 153/176 places, 308/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 157 transition count 316
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 157 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 157 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 156 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 156 transition count 314
Applied a total of 41 rules in 7 ms. Remains 156 /176 variables (removed 20) and now considering 314/349 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 156/176 places, 314/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 163 transition count 328
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 163 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 163 transition count 325
Applied a total of 29 rules in 5 ms. Remains 163 /176 variables (removed 13) and now considering 325/349 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 163/176 places, 325/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 325 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 7 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 314
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 154 transition count 310
Applied a total of 47 rules in 6 ms. Remains 154 /176 variables (removed 22) and now considering 310/349 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 154/176 places, 310/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 312
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 154 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 153 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 153 transition count 308
Applied a total of 49 rules in 6 ms. Remains 153 /176 variables (removed 23) and now considering 308/349 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 153/176 places, 308/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 349/349 transitions.
Graph (trivial) has 191 edges and 176 vertex of which 13 / 176 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 165 transition count 309
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 63 place count 136 transition count 305
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 134 transition count 305
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 65 place count 134 transition count 298
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 79 place count 127 transition count 298
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 98 place count 108 transition count 263
Iterating global reduction 3 with 19 rules applied. Total rules applied 117 place count 108 transition count 263
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 122 place count 108 transition count 258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 106 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 124 place count 106 transition count 255
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 130 place count 103 transition count 255
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 133 place count 100 transition count 247
Iterating global reduction 5 with 3 rules applied. Total rules applied 136 place count 100 transition count 247
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 166 place count 85 transition count 232
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 82 transition count 225
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 82 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 185 place count 82 transition count 212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 185 place count 82 transition count 211
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 187 place count 81 transition count 211
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 197 place count 76 transition count 206
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 75 transition count 205
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 73 vertex of which 26 / 73 are part of one of the 10 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 201 place count 57 transition count 205
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 243 place count 57 transition count 163
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 245 place count 55 transition count 146
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 55 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 288 place count 55 transition count 105
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 5 rules applied. Total rules applied 293 place count 55 transition count 100
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 6 rules applied. Total rules applied 299 place count 50 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 300 place count 49 transition count 99
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 302 place count 47 transition count 94
Iterating global reduction 10 with 2 rules applied. Total rules applied 304 place count 47 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 308 place count 45 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 312 place count 45 transition count 88
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 10 with 1 rules applied. Total rules applied 313 place count 45 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 2 rules applied. Total rules applied 315 place count 44 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 316 place count 43 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 316 place count 43 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 318 place count 42 transition count 85
Applied a total of 318 rules in 57 ms. Remains 42 /176 variables (removed 134) and now considering 85/349 (removed 264) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 42/176 places, 85/349 transitions.
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 4 ms
[2024-06-02 21:52:09] [INFO ] Flatten gal took : 4 ms
[2024-06-02 21:52:09] [INFO ] Input system was already deterministic with 85 transitions.
[2024-06-02 21:52:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:52:10] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:52:10] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-02 21:52:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 176 places, 349 transitions and 1076 arcs took 4 ms.
Total runtime 73057 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 176
TRANSITIONS: 349
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 761
MODEL NAME: /home/mcc/execution/414/model
176 places, 349 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-16-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365148046

--------------------
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

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-16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-16, 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 r575-smll-171734919600121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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