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.r157-smll-171636265100153.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 EisenbergMcGuire-PT-04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 255K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2024-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2023-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2023-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2023-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716479415936

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 15:50:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 15:50:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:50:18] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2024-05-23 15:50:18] [INFO ] Transformed 196 places.
[2024-05-23 15:50:18] [INFO ] Transformed 448 transitions.
[2024-05-23 15:50:18] [INFO ] Found NUPN structural information;
[2024-05-23 15:50:18] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 187 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 187 transition count 412
Applied a total of 18 rules in 84 ms. Remains 187 /196 variables (removed 9) and now considering 412/448 (removed 36) transitions.
[2024-05-23 15:50:19] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
// Phase 1: matrix 248 rows 187 cols
[2024-05-23 15:50:19] [INFO ] Computed 13 invariants in 33 ms
[2024-05-23 15:50:19] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-23 15:50:19] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
[2024-05-23 15:50:19] [INFO ] Invariant cache hit.
[2024-05-23 15:50:20] [INFO ] State equation strengthened by 85 read => feed constraints.
[2024-05-23 15:50:20] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1502 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2024-05-23 15:50:20] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
[2024-05-23 15:50:20] [INFO ] Invariant cache hit.
[2024-05-23 15:50:20] [INFO ] State equation strengthened by 85 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:50:24] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 26 ms to minimize.
[2024-05-23 15:50:25] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 4 ms to minimize.
[2024-05-23 15:50:25] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 4 ms to minimize.
[2024-05-23 15:50:25] [INFO ] Deduced a trap composed of 40 places in 170 ms of which 4 ms to minimize.
[2024-05-23 15:50:25] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 2 ms to minimize.
[2024-05-23 15:50:26] [INFO ] Deduced a trap composed of 30 places in 172 ms of which 4 ms to minimize.
[2024-05-23 15:50:26] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 4 ms to minimize.
[2024-05-23 15:50:26] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 4 ms to minimize.
[2024-05-23 15:50:26] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 4 ms to minimize.
[2024-05-23 15:50:26] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 4 ms to minimize.
[2024-05-23 15:50:26] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 3 ms to minimize.
[2024-05-23 15:50:27] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 3 ms to minimize.
[2024-05-23 15:50:27] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-05-23 15:50:27] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-23 15:50:27] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:50:28] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2024-05-23 15:50:28] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
[2024-05-23 15:50:28] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 15:50:28] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-23 15:50:28] [INFO ] Deduced a trap composed of 30 places in 153 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:50:29] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 3 ms to minimize.
[2024-05-23 15:50:29] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-23 15:50:30] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-23 15:50:30] [INFO ] Deduced a trap composed of 20 places in 207 ms of which 3 ms to minimize.
[2024-05-23 15:50:30] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 3 ms to minimize.
[2024-05-23 15:50:32] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 3 ms to minimize.
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 5 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 47 places in 91 ms of which 7 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-23 15:50:39] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 4 ms to minimize.
[2024-05-23 15:50:39] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 4 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 58 places in 152 ms of which 3 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 3 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 3 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 4 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 3 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:50:43] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 3 ms to minimize.
[2024-05-23 15:50:44] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 3 ms to minimize.
[2024-05-23 15:50:44] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 3 ms to minimize.
[2024-05-23 15:50:45] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 6 ms to minimize.
[2024-05-23 15:50:47] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-05-23 15:50:48] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 4 ms to minimize.
[2024-05-23 15:50:48] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 187/435 variables, and 73 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/187 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:50:53] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:50:54] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-23 15:50:54] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-05-23 15:50:54] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 4 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 4 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 3 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 2 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 3 ms to minimize.
[2024-05-23 15:50:55] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:50:58] [INFO ] Deduced a trap composed of 51 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:51:04] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 3 ms to minimize.
[2024-05-23 15:51:04] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 3 ms to minimize.
[2024-05-23 15:51:05] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 3 ms to minimize.
[2024-05-23 15:51:05] [INFO ] Deduced a trap composed of 56 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:51:05] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 3 ms to minimize.
[2024-05-23 15:51:05] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 3 ms to minimize.
[2024-05-23 15:51:06] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 4 ms to minimize.
[2024-05-23 15:51:06] [INFO ] Deduced a trap composed of 30 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:51:06] [INFO ] Deduced a trap composed of 33 places in 162 ms of which 3 ms to minimize.
[2024-05-23 15:51:06] [INFO ] Deduced a trap composed of 60 places in 161 ms of which 3 ms to minimize.
[2024-05-23 15:51:07] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:51:07] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 3 ms to minimize.
[2024-05-23 15:51:07] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 3 ms to minimize.
[2024-05-23 15:51:08] [INFO ] Deduced a trap composed of 55 places in 122 ms of which 2 ms to minimize.
[2024-05-23 15:51:08] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:51:08] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 16/99 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:51:10] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
[2024-05-23 15:51:13] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 408 unsolved
[2024-05-23 15:51:17] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-23 15:51:18] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2024-05-23 15:51:18] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 3 ms to minimize.
[2024-05-23 15:51:18] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 187/435 variables, and 105 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/187 constraints, ReadFeed: 0/85 constraints, PredecessorRefiner: 0/408 constraints, Known Traps: 92/92 constraints]
After SMT, in 60560ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60611ms
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 412/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62266 ms. Remains : 187/196 places, 412/448 transitions.
Support contains 58 out of 187 places after structural reductions.
[2024-05-23 15:51:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 15:51:21] [INFO ] Flatten gal took : 129 ms
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 15:51:21] [INFO ] Flatten gal took : 69 ms
[2024-05-23 15:51:21] [INFO ] Input system was already deterministic with 412 transitions.
Support contains 51 out of 187 places (down from 58) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2110 ms. (18 steps per ms) remains 12/34 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
[2024-05-23 15:51:23] [INFO ] Flow matrix only has 248 transitions (discarded 164 similar events)
[2024-05-23 15:51:23] [INFO ] Invariant cache hit.
[2024-05-23 15:51:23] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 154/176 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 7/183 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 248/431 variables, 183/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/431 variables, 85/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4/435 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/435 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/435 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/435 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 435/435 variables, and 285 constraints, problems are : Problem set: 0 solved, 10 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 187/187 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 154/176 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/183 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-23 15:51:24] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-23 15:51:24] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-23 15:51:24] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
Problem AtomicPropp21 is UNSAT
[2024-05-23 15:51:25] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 11/23 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/23 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 248/431 variables, 183/206 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 85/291 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/431 variables, 6/297 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 15:51:26] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 1/298 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 0/298 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/435 variables, 4/302 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/435 variables, 1/303 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/435 variables, 2/305 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-23 15:51:26] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-23 15:51:26] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/435 variables, 2/307 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/435 variables, 0/307 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/435 variables, 0/307 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 435/435 variables, and 307 constraints, problems are : Problem set: 2 solved, 8 unsolved in 3010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 187/187 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 3898ms problems are : Problem set: 2 solved, 8 unsolved
Parikh walk visited 2 properties in 3311 ms.
Support contains 13 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 412/412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 409
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 184 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 8 place count 183 transition count 367
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 90 place count 142 transition count 367
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 139 transition count 355
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 139 transition count 355
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 120 place count 127 transition count 343
Applied a total of 120 rules in 79 ms. Remains 127 /187 variables (removed 60) and now considering 343/412 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 127/187 places, 343/412 transitions.
RANDOM walk for 40000 steps (8 resets) in 453 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 39643 steps, run visited all 6 properties in 229 ms. (steps per millisecond=173 )
Probabilistic random walk after 39643 steps, saw 10124 distinct states, run finished after 239 ms. (steps per millisecond=165 ) properties seen :6
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
[2024-05-23 15:51:31] [INFO ] Flatten gal took : 29 ms
[2024-05-23 15:51:31] [INFO ] Flatten gal took : 32 ms
[2024-05-23 15:51:31] [INFO ] Input system was already deterministic with 412 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 20 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-23 15:51:31] [INFO ] Flatten gal took : 24 ms
[2024-05-23 15:51:31] [INFO ] Flatten gal took : 26 ms
[2024-05-23 15:51:31] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 187 transition count 409
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 184 transition count 409
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 6 place count 184 transition count 360
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 104 place count 135 transition count 360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 106 place count 133 transition count 352
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 133 transition count 352
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 132 place count 121 transition count 340
Applied a total of 132 rules in 52 ms. Remains 121 /187 variables (removed 66) and now considering 340/412 (removed 72) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 121/187 places, 340/412 transitions.
[2024-05-23 15:51:31] [INFO ] Flatten gal took : 18 ms
[2024-05-23 15:51:31] [INFO ] Flatten gal took : 20 ms
[2024-05-23 15:51:31] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 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 0 with 2 rules applied. Total rules applied 2 place count 187 transition count 410
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 185 transition count 408
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 8 place count 183 transition count 364
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 96 place count 139 transition count 364
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 98 place count 137 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 100 place count 137 transition count 356
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 124 place count 125 transition count 344
Applied a total of 124 rules in 35 ms. Remains 125 /187 variables (removed 62) and now considering 344/412 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 125/187 places, 344/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 14 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 8 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 23 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 404
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 404
Applied a total of 4 rules in 12 ms. Remains 185 /187 variables (removed 2) and now considering 404/412 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 185/187 places, 404/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 26 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 28 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 187 transition count 408
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 183 transition count 357
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 132 transition count 357
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 129 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 129 transition count 345
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 138 place count 118 transition count 334
Applied a total of 138 rules in 47 ms. Remains 118 /187 variables (removed 69) and now considering 334/412 (removed 78) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 118/187 places, 334/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 22 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 24 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 334 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 187 transition count 408
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 8 place count 183 transition count 360
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 104 place count 135 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 132 transition count 348
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 132 transition count 348
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 132 place count 121 transition count 337
Applied a total of 132 rules in 42 ms. Remains 121 /187 variables (removed 66) and now considering 337/412 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 121/187 places, 337/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 23 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 25 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 187 transition count 408
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 183 transition count 408
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 8 place count 183 transition count 359
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 106 place count 134 transition count 359
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 131 transition count 347
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 131 transition count 347
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 119 transition count 335
Applied a total of 136 rules in 28 ms. Remains 119 /187 variables (removed 68) and now considering 335/412 (removed 77) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 119/187 places, 335/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 14 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 8 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 17 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 412/412 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 184 transition count 400
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 184 transition count 400
Applied a total of 6 rules in 8 ms. Remains 184 /187 variables (removed 3) and now considering 400/412 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 184/187 places, 400/412 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 17 ms
[2024-05-23 15:51:32] [INFO ] Input system was already deterministic with 400 transitions.
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 18 ms
[2024-05-23 15:51:32] [INFO ] Flatten gal took : 17 ms
[2024-05-23 15:51:32] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-23 15:51:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 412 transitions and 1808 arcs took 5 ms.
Total runtime 74936 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-04

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 884
MODEL NAME: /home/mcc/execution/413/model
187 places, 412 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 EisenbergMcGuire-PT-04-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716479984251

--------------------
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="EisenbergMcGuire-PT-04"
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 EisenbergMcGuire-PT-04, 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 r157-smll-171636265100153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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