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-171636265100154.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265100154
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-01
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-02
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-03
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-04
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-05
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-06
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-07
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-08
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-09
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-10
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2024-11
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-12
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-13
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-14
FORMULA_NAME EisenbergMcGuire-PT-04-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716479424802

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 15:50:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:50:27] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2024-05-23 15:50:27] [INFO ] Transformed 196 places.
[2024-05-23 15:50:27] [INFO ] Transformed 448 transitions.
[2024-05-23 15:50:27] [INFO ] Found NUPN structural information;
[2024-05-23 15:50:27] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 64 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 448/448 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 189 transition count 420
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 189 transition count 420
Applied a total of 14 rules in 64 ms. Remains 189 /196 variables (removed 7) and now considering 420/448 (removed 28) transitions.
[2024-05-23 15:50:27] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
// Phase 1: matrix 256 rows 189 cols
[2024-05-23 15:50:27] [INFO ] Computed 13 invariants in 30 ms
[2024-05-23 15:50:28] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-05-23 15:50:28] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-05-23 15:50:28] [INFO ] Invariant cache hit.
[2024-05-23 15:50:28] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-23 15:50:28] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-23 15:50:28] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-05-23 15:50:28] [INFO ] Invariant cache hit.
[2024-05-23 15:50:29] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 26 places in 188 ms of which 27 ms to minimize.
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 4 ms to minimize.
[2024-05-23 15:50:33] [INFO ] Deduced a trap composed of 41 places in 204 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 3 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 4 ms to minimize.
[2024-05-23 15:50:34] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 4 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 3 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 4 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 3 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 34 places in 146 ms of which 4 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-23 15:50:35] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 2 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 2 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 3 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 3 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-05-23 15:50:36] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 15:50:37] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 3 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 3 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-23 15:50:38] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 3 ms to minimize.
[2024-05-23 15:50:39] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:50:39] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 4 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:50:40] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
[2024-05-23 15:50:41] [INFO ] Deduced a trap composed of 14 places in 193 ms of which 4 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 3 ms to minimize.
[2024-05-23 15:50:42] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:50:46] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 3 ms to minimize.
[2024-05-23 15:50:49] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 3 ms to minimize.
[2024-05-23 15:50:50] [INFO ] Deduced a trap composed of 23 places in 182 ms of which 4 ms to minimize.
[2024-05-23 15:50:50] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:50:52] [INFO ] Deduced a trap composed of 37 places in 188 ms of which 4 ms to minimize.
[2024-05-23 15:50:53] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 3 ms to minimize.
[2024-05-23 15:50:53] [INFO ] Deduced a trap composed of 56 places in 206 ms of which 3 ms to minimize.
[2024-05-23 15:50:53] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 3 ms to minimize.
[2024-05-23 15:50:53] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2024-05-23 15:50:54] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 2 ms to minimize.
[2024-05-23 15:50:56] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 4 ms to minimize.
[2024-05-23 15:50:56] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 3 ms to minimize.
[2024-05-23 15:50:57] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-05-23 15:50:58] [INFO ] Deduced a trap composed of 28 places in 177 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/445 variables, and 68 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:51:04] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:51:05] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 3 ms to minimize.
[2024-05-23 15:51:06] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 3 ms to minimize.
[2024-05-23 15:51:09] [INFO ] Deduced a trap composed of 56 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:51:13] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 3 ms to minimize.
[2024-05-23 15:51:13] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 4 ms to minimize.
[2024-05-23 15:51:14] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 3 ms to minimize.
[2024-05-23 15:51:14] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 4 ms to minimize.
[2024-05-23 15:51:14] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:51:19] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:51:21] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-23 15:51:21] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2024-05-23 15:51:21] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:51:21] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-05-23 15:51:22] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-23 15:51:22] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-23 15:51:22] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-23 15:51:26] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-23 15:51:26] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
[2024-05-23 15:51:26] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 2 ms to minimize.
[2024-05-23 15:51:27] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/445 variables, and 89 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/91 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 76/76 constraints]
After SMT, in 60540ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60596ms
Starting structural reductions in LTL mode, iteration 1 : 189/196 places, 420/448 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61913 ms. Remains : 189/196 places, 420/448 transitions.
Support contains 64 out of 189 places after structural reductions.
[2024-05-23 15:51:29] [INFO ] Flatten gal took : 83 ms
[2024-05-23 15:51:29] [INFO ] Flatten gal took : 43 ms
[2024-05-23 15:51:30] [INFO ] Input system was already deterministic with 420 transitions.
RANDOM walk for 40000 steps (8 resets) in 2317 ms. (17 steps per ms) remains 34/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
[2024-05-23 15:51:31] [INFO ] Flow matrix only has 256 transitions (discarded 164 similar events)
[2024-05-23 15:51:31] [INFO ] Invariant cache hit.
[2024-05-23 15:51:31] [INFO ] State equation strengthened by 91 read => feed constraints.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 145/189 variables, 8/9 constraints. Problems are: Problem set: 1 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 31 unsolved
[2024-05-23 15:51:31] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-23 15:51:31] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 2 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
[2024-05-23 15:51:32] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 3 ms to minimize.
[2024-05-23 15:51:33] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 11/24 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-23 15:51:33] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 15:51:33] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-23 15:51:33] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 3/27 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-23 15:51:33] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-23 15:51:33] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 2/29 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 6/35 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-23 15:51:34] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 30 unsolved
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 2 ms to minimize.
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 2 ms to minimize.
[2024-05-23 15:51:35] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 6/43 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/43 constraints. Problems are: Problem set: 2 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 256/445 variables, 189/232 constraints. Problems are: Problem set: 2 solved, 30 unsolved
SMT process timed out in 5051ms, After SMT, problems are : Problem set: 2 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 418
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 187 transition count 418
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 4 place count 187 transition count 373
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 94 place count 142 transition count 373
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 138 transition count 357
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 138 transition count 357
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 126 place count 126 transition count 345
Applied a total of 126 rules in 69 ms. Remains 126 /189 variables (removed 63) and now considering 345/420 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 126/189 places, 345/420 transitions.
RANDOM walk for 40000 steps (8 resets) in 540 ms. (73 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
Interrupted probabilistic random walk after 368325 steps, run timeout after 3001 ms. (steps per millisecond=122 ) properties seen :22 out of 28
Probabilistic random walk after 368325 steps, saw 75265 distinct states, run finished after 3012 ms. (steps per millisecond=122 ) properties seen :22
[2024-05-23 15:51:39] [INFO ] Flow matrix only has 181 transitions (discarded 164 similar events)
// Phase 1: matrix 181 rows 126 cols
[2024-05-23 15:51:39] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 15:51:39] [INFO ] State equation strengthened by 79 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/93 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 27/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 2 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/126 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 42 places in 85 ms of which 2 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-23 15:51:40] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 181/307 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 79/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/307 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 227 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/88 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/93 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 27/120 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 6/126 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 181/307 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 79/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 15:51:41] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-23 15:51:41] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-23 15:51:41] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/307 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 236 constraints, problems are : Problem set: 0 solved, 6 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 126/126 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2665 ms.
Support contains 13 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 345/345 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 126 transition count 336
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 117 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 116 transition count 332
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 116 transition count 332
Applied a total of 20 rules in 43 ms. Remains 116 /126 variables (removed 10) and now considering 332/345 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 116/126 places, 332/345 transitions.
RANDOM walk for 40000 steps (8 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 471490 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :1 out of 6
Probabilistic random walk after 471490 steps, saw 95689 distinct states, run finished after 3002 ms. (steps per millisecond=157 ) properties seen :1
[2024-05-23 15:51:47] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-23 15:51:47] [INFO ] Computed 13 invariants in 6 ms
[2024-05-23 15:51:47] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 15:51:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 2 ms to minimize.
[2024-05-23 15:51:47] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 15:51:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/116 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 15:51:48] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-23 15:51:48] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 2 ms to minimize.
[2024-05-23 15:51:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 15:51:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 168/284 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/284 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 212 constraints, problems are : Problem set: 0 solved, 5 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 69/79 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 5/84 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/110 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/116 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 168/284 variables, 116/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 5/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 15:51:48] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 15:51:48] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/284 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 219 constraints, problems are : Problem set: 0 solved, 5 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 116/116 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 9/9 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1955 ms.
Support contains 10 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 13 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 116/116 places, 332/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 108 ms. (366 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 557228 steps, run visited all 5 properties in 2838 ms. (steps per millisecond=196 )
Probabilistic random walk after 557228 steps, saw 112766 distinct states, run finished after 2844 ms. (steps per millisecond=195 ) properties seen :5
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 28 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 28 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 420 transitions.
Support contains 58 out of 189 places (down from 59) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 404
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 404
Applied a total of 8 rules in 15 ms. Remains 185 /189 variables (removed 4) and now considering 404/420 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 185/189 places, 404/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 21 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 22 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 185 transition count 364
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 133 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 128 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 128 transition count 344
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 146 place count 116 transition count 332
Applied a total of 146 rules in 40 ms. Remains 116 /189 variables (removed 73) and now considering 332/420 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 116/189 places, 332/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 17 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 18 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 7 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 20 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
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 185 transition count 365
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 115 place count 129 transition count 345
Iterating global reduction 2 with 5 rules applied. Total rules applied 120 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 144 place count 117 transition count 333
Applied a total of 144 rules in 28 ms. Remains 117 /189 variables (removed 72) and now considering 333/420 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 117/189 places, 333/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 14 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 333 transitions.
RANDOM walk for 13645 steps (2 resets) in 22 ms. (593 steps per ms) remains 0/1 properties
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 22 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 404
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 404
Applied a total of 8 rules in 6 ms. Remains 185 /189 variables (removed 4) and now considering 404/420 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 185/189 places, 404/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 21 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 404 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:54] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:54] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 16 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 420/420 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 400
Applied a total of 10 rules in 6 ms. Remains 184 /189 variables (removed 5) and now considering 400/420 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 184/189 places, 400/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 14 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
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 185 transition count 365
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 130 transition count 349
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 130 transition count 349
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 142 place count 118 transition count 337
Applied a total of 142 rules in 31 ms. Remains 118 /189 variables (removed 71) and now considering 337/420 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 118/189 places, 337/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 6 place count 186 transition count 366
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 108 place count 135 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 130 transition count 346
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 130 transition count 346
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 140 place count 119 transition count 335
Applied a total of 140 rules in 24 ms. Remains 119 /189 variables (removed 70) and now considering 335/420 (removed 85) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 119/189 places, 335/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 13 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 335 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
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 185 transition count 367
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 136 transition count 367
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 131 transition count 347
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 131 transition count 347
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 138 place count 120 transition count 336
Applied a total of 138 rules in 22 ms. Remains 120 /189 variables (removed 69) and now considering 336/420 (removed 84) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 120/189 places, 336/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 18 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 336 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 417
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 186 transition count 417
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 6 place count 186 transition count 365
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 110 place count 134 transition count 365
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 114 place count 130 transition count 349
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 130 transition count 349
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 142 place count 118 transition count 337
Applied a total of 142 rules in 22 ms. Remains 118 /189 variables (removed 71) and now considering 337/420 (removed 83) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 118/189 places, 337/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 11 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 12 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 337 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 420/420 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 189 transition count 416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 185 transition count 416
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 185 transition count 364
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 133 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 128 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 128 transition count 344
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 146 place count 116 transition count 332
Applied a total of 146 rules in 22 ms. Remains 116 /189 variables (removed 73) and now considering 332/420 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 116/189 places, 332/420 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 11 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 11 ms
[2024-05-23 15:51:55] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 20 ms
[2024-05-23 15:51:55] [INFO ] Flatten gal took : 15 ms
[2024-05-23 15:51:55] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-23 15:51:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 420 transitions and 1840 arcs took 4 ms.
Total runtime 88740 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/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 189
TRANSITIONS: 420
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.022s, Sys 0.000s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 953
MODEL NAME: /home/mcc/execution/409/model
189 places, 420 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-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA EisenbergMcGuire-PT-04-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716480330637

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="CTLFireability"
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 CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r157-smll-171636265100154"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;