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.r549-tall-171734898300297.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 FireWire-PT-17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717371632116

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:40:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 23:40:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:40:33] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 23:40:33] [INFO ] Transformed 428 places.
[2024-06-02 23:40:33] [INFO ] Transformed 656 transitions.
[2024-06-02 23:40:33] [INFO ] Found NUPN structural information;
[2024-06-02 23:40:33] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Support contains 123 out of 428 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 656/656 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 426 transition count 656
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 62 place count 366 transition count 596
Iterating global reduction 1 with 60 rules applied. Total rules applied 122 place count 366 transition count 596
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 129 place count 359 transition count 570
Iterating global reduction 1 with 7 rules applied. Total rules applied 136 place count 359 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 137 place count 359 transition count 569
Applied a total of 137 rules in 76 ms. Remains 359 /428 variables (removed 69) and now considering 569/656 (removed 87) transitions.
// Phase 1: matrix 569 rows 359 cols
[2024-06-02 23:40:33] [INFO ] Computed 8 invariants in 23 ms
[2024-06-02 23:40:33] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-02 23:40:33] [INFO ] Invariant cache hit.
[2024-06-02 23:40:34] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 568 sub problems to find dead transitions.
[2024-06-02 23:40:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 4/358 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:40:41] [INFO ] Deduced a trap composed of 183 places in 217 ms of which 24 ms to minimize.
[2024-06-02 23:40:41] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:40:41] [INFO ] Deduced a trap composed of 87 places in 67 ms of which 2 ms to minimize.
[2024-06-02 23:40:42] [INFO ] Deduced a trap composed of 91 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:40:42] [INFO ] Deduced a trap composed of 93 places in 73 ms of which 1 ms to minimize.
[2024-06-02 23:40:42] [INFO ] Deduced a trap composed of 95 places in 84 ms of which 2 ms to minimize.
[2024-06-02 23:40:43] [INFO ] Deduced a trap composed of 89 places in 61 ms of which 2 ms to minimize.
[2024-06-02 23:40:43] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:40:43] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 1 ms to minimize.
[2024-06-02 23:40:44] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:40:44] [INFO ] Deduced a trap composed of 95 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:40:44] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:40:44] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:40:45] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:40:46] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:40:47] [INFO ] Deduced a trap composed of 173 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 181 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 117 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:40:48] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 1 ms to minimize.
[2024-06-02 23:40:49] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:40:49] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-06-02 23:40:50] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:40:57] [INFO ] Deduced a trap composed of 103 places in 64 ms of which 2 ms to minimize.
[2024-06-02 23:40:57] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 1 ms to minimize.
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 99 places in 56 ms of which 1 ms to minimize.
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 99 places in 55 ms of which 2 ms to minimize.
[2024-06-02 23:40:58] [INFO ] Deduced a trap composed of 97 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 568 unsolved
(s150 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.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 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0timeout
)
(s151 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/928 variables, and 38 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (OVERLAPS) 4/358 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:41:08] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-02 23:41:08] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:41:08] [INFO ] Deduced a trap composed of 110 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:41:08] [INFO ] Deduced a trap composed of 151 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:41:08] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 6 ms to minimize.
[2024-06-02 23:41:08] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:41:09] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:41:13] [INFO ] Deduced a trap composed of 95 places in 71 ms of which 1 ms to minimize.
[2024-06-02 23:41:14] [INFO ] Deduced a trap composed of 105 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:41:21] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:41:24] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:41:26] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 568 unsolved
[2024-06-02 23:41:29] [INFO ] Deduced a trap composed of 106 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/928 variables, and 51 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/359 constraints, PredecessorRefiner: 0/568 constraints, Known Traps: 43/43 constraints]
After SMT, in 60310ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 359/428 places, 569/656 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61072 ms. Remains : 359/428 places, 569/656 transitions.
Support contains 123 out of 359 places after structural reductions.
[2024-06-02 23:41:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 23:41:34] [INFO ] Flatten gal took : 65 ms
FORMULA FireWire-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:41:34] [INFO ] Flatten gal took : 33 ms
[2024-06-02 23:41:35] [INFO ] Input system was already deterministic with 569 transitions.
Support contains 113 out of 359 places (down from 123) after GAL structural reductions.
RANDOM walk for 40000 steps (15 resets) in 2012 ms. (19 steps per ms) remains 38/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
[2024-06-02 23:41:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 270/338 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 550/888 variables, 338/346 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 14/902 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 14/916 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 9/925 variables, 6/365 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/925 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 3/928 variables, 2/367 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/928 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/928 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 928/928 variables, and 367 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3255 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 270/338 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 23:41:39] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-06-02 23:41:39] [INFO ] Deduced a trap composed of 176 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:41:39] [INFO ] Deduced a trap composed of 91 places in 56 ms of which 2 ms to minimize.
[2024-06-02 23:41:39] [INFO ] Deduced a trap composed of 87 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:41:39] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:41:40] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 2 ms to minimize.
[2024-06-02 23:41:40] [INFO ] Deduced a trap composed of 181 places in 115 ms of which 2 ms to minimize.
[2024-06-02 23:41:40] [INFO ] Deduced a trap composed of 173 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:41:40] [INFO ] Deduced a trap composed of 164 places in 116 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 550/888 variables, 338/355 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 33/388 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 23:41:41] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-06-02 23:41:42] [INFO ] Deduced a trap composed of 161 places in 126 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/888 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 14/902 variables, 7/397 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/928 variables, and 402 constraints, problems are : Problem set: 0 solved, 38 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 345/359 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 11/11 constraints]
After SMT, in 8296ms problems are : Problem set: 0 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 204 edges and 359 vertex of which 9 / 359 are part of one of the 2 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 971 edges and 352 vertex of which 348 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 348 transition count 511
Reduce places removed 47 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 53 rules applied. Total rules applied 104 place count 301 transition count 505
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 295 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 294 transition count 503
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 113 place count 294 transition count 489
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 141 place count 280 transition count 489
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 151 place count 270 transition count 479
Iterating global reduction 4 with 10 rules applied. Total rules applied 161 place count 270 transition count 479
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 161 place count 270 transition count 478
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 269 transition count 478
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 245 place count 228 transition count 437
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 227 transition count 417
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 227 transition count 417
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 275 place count 213 transition count 456
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 276 place count 213 transition count 455
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 298 place count 213 transition count 433
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 320 place count 191 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 321 place count 191 transition count 432
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 327 place count 191 transition count 432
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 328 place count 191 transition count 432
Applied a total of 328 rules in 131 ms. Remains 191 /359 variables (removed 168) and now considering 432/569 (removed 137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 191/359 places, 432/569 transitions.
RANDOM walk for 40000 steps (1582 resets) in 553 ms. (72 steps per ms) remains 26/38 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (36 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (29 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (35 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (37 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (36 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (33 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (32 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (36 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
// Phase 1: matrix 432 rows 191 cols
[2024-06-02 23:41:44] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:41:44] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 132/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 6/182 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 430/612 variables, 182/189 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/612 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 10/622 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/622 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 1/623 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/623 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 0/623 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 623/623 variables, and 207 constraints, problems are : Problem set: 0 solved, 25 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 132/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:41:46] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:41:46] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-02 23:41:46] [INFO ] Deduced a trap composed of 100 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:41:46] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 6/182 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 430/612 variables, 182/193 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/612 variables, 9/202 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 21/223 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:41:47] [INFO ] Deduced a trap composed of 45 places in 89 ms of which 2 ms to minimize.
[2024-06-02 23:41:47] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:41:47] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-06-02 23:41:47] [INFO ] Deduced a trap composed of 71 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/612 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:41:48] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/612 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/612 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 10/622 variables, 8/236 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/622 variables, 4/240 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/622 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 1/623 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:41:49] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/623 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-02 23:41:50] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/623 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/623 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 20 (OVERLAPS) 0/623 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 623/623 variables, and 243 constraints, problems are : Problem set: 0 solved, 25 unsolved in 6234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 11/11 constraints]
After SMT, in 7471ms problems are : Problem set: 0 solved, 25 unsolved
Parikh walk visited 0 properties in 2975 ms.
Support contains 44 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 432/432 transitions.
Graph (trivial) has 45 edges and 191 vertex of which 2 / 191 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 190 transition count 421
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 181 transition count 421
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 181 transition count 420
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 180 transition count 420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 179 transition count 419
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 179 transition count 419
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 172 transition count 412
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 172 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 52 place count 166 transition count 427
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 166 transition count 423
Applied a total of 56 rules in 38 ms. Remains 166 /191 variables (removed 25) and now considering 423/432 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 166/191 places, 423/432 transitions.
RANDOM walk for 40000 steps (1962 resets) in 394 ms. (101 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (42 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (32 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (47 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (45 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (48 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (47 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (49 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (43 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (45 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (47 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (50 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (46 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (49 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (48 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
[2024-06-02 23:41:55] [INFO ] Flow matrix only has 414 transitions (discarded 9 similar events)
// Phase 1: matrix 414 rows 166 cols
[2024-06-02 23:41:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:41:55] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 119/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 4/159 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 414/573 variables, 159/166 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 7/580 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/580 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 580/580 variables, and 181 constraints, problems are : Problem set: 0 solved, 19 unsolved in 696 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 119/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 85 places in 77 ms of which 1 ms to minimize.
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 86 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:41:56] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 4/159 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 414/573 variables, 159/171 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 8/179 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 15/194 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 62 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:41:57] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 7/580 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/580 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 0/580 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 580/580 variables, and 208 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 166/166 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 3104ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 2550 ms.
Support contains 36 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 423/423 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 166 transition count 422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 165 transition count 422
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 165 transition count 420
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 163 transition count 420
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 161 transition count 418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 160 transition count 417
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 160 transition count 417
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 160 transition count 413
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 159 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 159 transition count 414
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 159 transition count 412
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 23 place count 157 transition count 412
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 157 transition count 454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 27 place count 155 transition count 454
Applied a total of 27 rules in 46 ms. Remains 155 /166 variables (removed 11) and now considering 454/423 (removed -31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 155/166 places, 454/423 transitions.
RANDOM walk for 40000 steps (2014 resets) in 302 ms. (132 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (47 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (50 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (36 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (53 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (44 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (47 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (49 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (48 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (49 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (52 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (48 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (48 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 450490 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :13 out of 19
Probabilistic random walk after 450490 steps, saw 110621 distinct states, run finished after 3004 ms. (steps per millisecond=149 ) properties seen :13
[2024-06-02 23:42:04] [INFO ] Flow matrix only has 442 transitions (discarded 12 similar events)
// Phase 1: matrix 442 rows 155 cols
[2024-06-02 23:42:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:42:04] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 128/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/147 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 440/587 variables, 147/154 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 26/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 9/596 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/597 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/597 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 188 constraints, problems are : Problem set: 0 solved, 6 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 128/143 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:42:04] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 1 ms to minimize.
[2024-06-02 23:42:05] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 1 ms to minimize.
[2024-06-02 23:42:05] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 440/587 variables, 147/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 26/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 9/596 variables, 7/194 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:42:05] [INFO ] Deduced a trap composed of 47 places in 46 ms of which 1 ms to minimize.
[2024-06-02 23:42:05] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/596 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 1/597 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/597 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/597 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 199 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 1380ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2230 ms.
Support contains 15 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 454/454 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 155 transition count 448
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 149 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 148 transition count 447
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 147 transition count 446
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 147 transition count 446
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 147 transition count 445
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 146 transition count 445
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 145 transition count 442
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 145 transition count 442
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 140 transition count 437
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 139 transition count 432
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 139 transition count 432
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 42 place count 134 transition count 441
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 134 transition count 440
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 134 transition count 437
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 56 place count 131 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 66 place count 131 transition count 420
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 131 transition count 420
Applied a total of 67 rules in 55 ms. Remains 131 /155 variables (removed 24) and now considering 420/454 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 131/155 places, 420/454 transitions.
RANDOM walk for 40000 steps (2202 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (28 resets) in 49 ms. (800 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (565 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (546 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (552 resets) in 76 ms. (519 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (547 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (566 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 584051 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :4 out of 6
Probabilistic random walk after 584051 steps, saw 154256 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :4
[2024-06-02 23:42:11] [INFO ] Flow matrix only has 410 transitions (discarded 10 similar events)
// Phase 1: matrix 410 rows 131 cols
[2024-06-02 23:42:11] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:42:11] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/124 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:42:11] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-02 23:42:11] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2024-06-02 23:42:11] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 408/532 variables, 124/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 53/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/538 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/540 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/541 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/541 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 113/124 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 408/532 variables, 124/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 53/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 23:42:11] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/532 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/532 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/538 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/540 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/541 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/541 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 199 constraints, problems are : Problem set: 0 solved, 2 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 131/131 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 420/420 transitions.
Graph (trivial) has 27 edges and 131 vertex of which 3 / 131 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 415
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 127 transition count 415
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 126 transition count 412
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 126 transition count 412
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 123 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 123 transition count 379
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 123 transition count 374
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 118 transition count 374
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 3 with 42 rules applied. Total rules applied 95 place count 118 transition count 332
Applied a total of 95 rules in 27 ms. Remains 118 /131 variables (removed 13) and now considering 332/420 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 118/131 places, 332/420 transitions.
RANDOM walk for 40000 steps (2272 resets) in 987 ms. (40 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (565 resets) in 66 ms. (597 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (580 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-06-02 23:42:12] [INFO ] Flow matrix only has 298 transitions (discarded 34 similar events)
// Phase 1: matrix 298 rows 118 cols
[2024-06-02 23:42:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:42:12] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/112 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:42:12] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 296/408 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 55/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 7/415 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/416 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/416 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 268 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/112 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:42:12] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 296/408 variables, 112/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 55/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/415 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/416 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/416 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 118/118 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 544ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 332/332 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 118 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 116 transition count 330
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 115 transition count 329
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 115 transition count 327
Applied a total of 8 rules in 12 ms. Remains 115 /118 variables (removed 3) and now considering 327/332 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 115/118 places, 327/332 transitions.
RANDOM walk for 40000 steps (2384 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (615 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4919 steps, run visited all 1 properties in 14 ms. (steps per millisecond=351 )
Probabilistic random walk after 4919 steps, saw 1691 distinct states, run finished after 19 ms. (steps per millisecond=258 ) properties seen :1
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 38 ms
[2024-06-02 23:42:13] [INFO ] Input system was already deterministic with 569 transitions.
Computed a total of 58 stabilizing places and 60 stable transitions
Graph (complete) has 980 edges and 359 vertex of which 355 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 317 transition count 530
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 317 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 317 transition count 529
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 304 transition count 511
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 304 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 304 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 301 transition count 507
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 301 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 299 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 299 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 298 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 298 transition count 504
Applied a total of 120 rules in 61 ms. Remains 298 /359 variables (removed 61) and now considering 504/569 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 298/359 places, 504/569 transitions.
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:42:13] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 316 transition count 527
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 316 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 316 transition count 526
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 305 transition count 510
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 305 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 305 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 303 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 301 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 301 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 300 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 300 transition count 504
Applied a total of 116 rules in 30 ms. Remains 300 /359 variables (removed 59) and now considering 504/569 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 300/359 places, 504/569 transitions.
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:42:13] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 282 edges and 359 vertex of which 9 / 359 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 973 edges and 352 vertex of which 349 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 348 transition count 487
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 153 place count 274 transition count 484
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 272 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 271 transition count 482
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 158 place count 271 transition count 464
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 194 place count 253 transition count 464
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 213 place count 234 transition count 442
Iterating global reduction 4 with 19 rules applied. Total rules applied 232 place count 234 transition count 442
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 232 place count 234 transition count 434
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 248 place count 226 transition count 434
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 251 place count 223 transition count 430
Iterating global reduction 4 with 3 rules applied. Total rules applied 254 place count 223 transition count 430
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 256 place count 223 transition count 428
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 222 transition count 428
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 315 place count 193 transition count 399
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 318 place count 190 transition count 375
Iterating global reduction 6 with 3 rules applied. Total rules applied 321 place count 190 transition count 375
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 322 place count 190 transition count 374
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 324 place count 188 transition count 372
Applied a total of 324 rules in 69 ms. Remains 188 /359 variables (removed 171) and now considering 372/569 (removed 197) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 188/359 places, 372/569 transitions.
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:13] [INFO ] Input system was already deterministic with 372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 284 edges and 359 vertex of which 18 / 359 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 964 edges and 344 vertex of which 340 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 339 transition count 480
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 76 rules applied. Total rules applied 150 place count 267 transition count 476
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 152 place count 265 transition count 476
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 152 place count 265 transition count 460
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 184 place count 249 transition count 460
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 206 place count 227 transition count 435
Iterating global reduction 3 with 22 rules applied. Total rules applied 228 place count 227 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 227 transition count 434
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 229 place count 227 transition count 426
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 245 place count 219 transition count 426
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 249 place count 215 transition count 419
Iterating global reduction 4 with 4 rules applied. Total rules applied 253 place count 215 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 255 place count 215 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 256 place count 214 transition count 417
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 312 place count 186 transition count 389
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 315 place count 183 transition count 365
Iterating global reduction 6 with 3 rules applied. Total rules applied 318 place count 183 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 319 place count 183 transition count 364
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 320 place count 183 transition count 364
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 322 place count 181 transition count 362
Applied a total of 322 rules in 74 ms. Remains 181 /359 variables (removed 178) and now considering 362/569 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 75 ms. Remains : 181/359 places, 362/569 transitions.
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:42:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:42:13] [INFO ] Input system was already deterministic with 362 transitions.
RANDOM walk for 40000 steps (2212 resets) in 450 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (470 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 23934 steps, run visited all 1 properties in 59 ms. (steps per millisecond=405 )
Probabilistic random walk after 23934 steps, saw 6863 distinct states, run finished after 59 ms. (steps per millisecond=405 ) properties seen :1
FORMULA FireWire-PT-17-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 318 transition count 529
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 318 transition count 529
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 89 place count 307 transition count 514
Iterating global reduction 1 with 11 rules applied. Total rules applied 100 place count 307 transition count 514
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 307 transition count 513
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 304 transition count 510
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 304 transition count 510
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 302 transition count 508
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 302 transition count 508
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 301 transition count 507
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 301 transition count 507
Applied a total of 113 rules in 21 ms. Remains 301 /359 variables (removed 58) and now considering 507/569 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 301/359 places, 507/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 507 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 320 transition count 531
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 320 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 320 transition count 530
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 311 transition count 519
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 311 transition count 519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 311 transition count 518
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 309 transition count 516
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 309 transition count 516
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 308 transition count 515
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 308 transition count 515
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 307 transition count 514
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 307 transition count 514
Applied a total of 102 rules in 24 ms. Remains 307 /359 variables (removed 52) and now considering 514/569 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 307/359 places, 514/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 514 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 317 transition count 530
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 317 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 317 transition count 529
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 304 transition count 511
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 304 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 304 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 111 place count 301 transition count 507
Iterating global reduction 3 with 3 rules applied. Total rules applied 114 place count 301 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 299 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 299 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 298 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 298 transition count 504
Applied a total of 120 rules in 20 ms. Remains 298 /359 variables (removed 61) and now considering 504/569 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 298/359 places, 504/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 290 edges and 359 vertex of which 14 / 359 are part of one of the 2 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 967 edges and 347 vertex of which 343 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 342 transition count 478
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 265 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 263 transition count 474
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 162 place count 263 transition count 457
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 196 place count 246 transition count 457
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 218 place count 224 transition count 432
Iterating global reduction 3 with 22 rules applied. Total rules applied 240 place count 224 transition count 432
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 224 transition count 431
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 241 place count 224 transition count 423
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 257 place count 216 transition count 423
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 261 place count 212 transition count 416
Iterating global reduction 4 with 4 rules applied. Total rules applied 265 place count 212 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 267 place count 212 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 211 transition count 414
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 324 place count 183 transition count 386
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 327 place count 180 transition count 362
Iterating global reduction 6 with 3 rules applied. Total rules applied 330 place count 180 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 331 place count 180 transition count 361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 333 place count 178 transition count 359
Applied a total of 333 rules in 50 ms. Remains 178 /359 variables (removed 181) and now considering 359/569 (removed 210) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 178/359 places, 359/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 359 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 283 edges and 359 vertex of which 11 / 359 are part of one of the 2 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 971 edges and 350 vertex of which 347 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 346 transition count 486
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 152 place count 273 transition count 482
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 155 place count 271 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 270 transition count 481
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 156 place count 270 transition count 464
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 190 place count 253 transition count 464
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 212 place count 231 transition count 439
Iterating global reduction 4 with 22 rules applied. Total rules applied 234 place count 231 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 235 place count 231 transition count 438
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 235 place count 231 transition count 430
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 251 place count 223 transition count 430
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 255 place count 219 transition count 423
Iterating global reduction 5 with 4 rules applied. Total rules applied 259 place count 219 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 261 place count 219 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 218 transition count 421
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 7 with 56 rules applied. Total rules applied 318 place count 190 transition count 393
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 321 place count 187 transition count 369
Iterating global reduction 7 with 3 rules applied. Total rules applied 324 place count 187 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 325 place count 187 transition count 368
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 327 place count 185 transition count 366
Applied a total of 327 rules in 46 ms. Remains 185 /359 variables (removed 174) and now considering 366/569 (removed 203) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 185/359 places, 366/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 40 place count 319 transition count 530
Iterating global reduction 1 with 36 rules applied. Total rules applied 76 place count 319 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 319 transition count 529
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 88 place count 308 transition count 513
Iterating global reduction 2 with 11 rules applied. Total rules applied 99 place count 308 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 308 transition count 512
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 306 transition count 510
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 306 transition count 510
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 305 transition count 509
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 305 transition count 509
Applied a total of 106 rules in 13 ms. Remains 305 /359 variables (removed 54) and now considering 509/569 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 305/359 places, 509/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 509 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Graph (trivial) has 273 edges and 359 vertex of which 18 / 359 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 964 edges and 344 vertex of which 341 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 340 transition count 483
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 271 transition count 480
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 145 place count 269 transition count 480
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 145 place count 269 transition count 463
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 179 place count 252 transition count 463
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 194 place count 237 transition count 445
Iterating global reduction 3 with 15 rules applied. Total rules applied 209 place count 237 transition count 445
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 209 place count 237 transition count 439
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 231 transition count 439
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 223 place count 229 transition count 436
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 229 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 229 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 228 place count 228 transition count 434
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 288 place count 198 transition count 404
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 290 place count 196 transition count 382
Iterating global reduction 5 with 2 rules applied. Total rules applied 292 place count 196 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 293 place count 196 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 295 place count 194 transition count 379
Applied a total of 295 rules in 37 ms. Remains 194 /359 variables (removed 165) and now considering 379/569 (removed 190) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 194/359 places, 379/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 379 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 42 place count 317 transition count 528
Iterating global reduction 1 with 38 rules applied. Total rules applied 80 place count 317 transition count 528
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 317 transition count 527
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 307 transition count 512
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 307 transition count 512
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 306 transition count 511
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 306 transition count 511
Applied a total of 103 rules in 11 ms. Remains 306 /359 variables (removed 53) and now considering 511/569 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 306/359 places, 511/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 40 place count 319 transition count 530
Iterating global reduction 1 with 36 rules applied. Total rules applied 76 place count 319 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 319 transition count 529
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 90 place count 306 transition count 511
Iterating global reduction 2 with 13 rules applied. Total rules applied 103 place count 306 transition count 511
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 306 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 303 transition count 507
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 303 transition count 507
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 301 transition count 505
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 301 transition count 505
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 300 transition count 504
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 300 transition count 504
Applied a total of 116 rules in 15 ms. Remains 300 /359 variables (removed 59) and now considering 504/569 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 300/359 places, 504/569 transitions.
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:42:14] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:14] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 316 transition count 527
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 316 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 316 transition count 526
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 94 place count 305 transition count 510
Iterating global reduction 2 with 11 rules applied. Total rules applied 105 place count 305 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 305 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 303 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 303 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 302 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 302 transition count 506
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 301 transition count 505
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 301 transition count 505
Applied a total of 114 rules in 15 ms. Remains 301 /359 variables (removed 58) and now considering 505/569 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 301/359 places, 505/569 transitions.
[2024-06-02 23:42:15] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:15] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:42:15] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 569/569 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 355 transition count 569
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 41 place count 318 transition count 530
Iterating global reduction 1 with 37 rules applied. Total rules applied 78 place count 318 transition count 530
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 318 transition count 529
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 91 place count 306 transition count 513
Iterating global reduction 2 with 12 rules applied. Total rules applied 103 place count 306 transition count 513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 306 transition count 512
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 303 transition count 509
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 303 transition count 509
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 301 transition count 507
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 301 transition count 507
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 300 transition count 506
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 300 transition count 506
Applied a total of 116 rules in 14 ms. Remains 300 /359 variables (removed 59) and now considering 506/569 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 300/359 places, 506/569 transitions.
[2024-06-02 23:42:15] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:15] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:42:15] [INFO ] Input system was already deterministic with 506 transitions.
[2024-06-02 23:42:15] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:42:15] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:42:15] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-02 23:42:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 359 places, 569 transitions and 1683 arcs took 4 ms.
Total runtime 101957 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-17

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 852
MODEL NAME: /home/mcc/execution/412/model
359 places, 569 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 FireWire-PT-17-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-17-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA FireWire-PT-17-CTLCardinality-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717373489908

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-17"
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 FireWire-PT-17, 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 r549-tall-171734898300297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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