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.r377-smll-171683809700113.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 SieveSingleMsgMbox-PT-d2m18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809700113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 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 SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716915089982

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:51:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 16:51:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:51:32] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2024-05-28 16:51:32] [INFO ] Transformed 2398 places.
[2024-05-28 16:51:32] [INFO ] Transformed 1954 transitions.
[2024-05-28 16:51:32] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 538 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
Deduced a syphon composed of 1984 places in 25 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 792 transitions
Reduce isomorphic transitions removed 792 transitions.
Iterating post reduction 0 with 816 rules applied. Total rules applied 816 place count 390 transition count 1162
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 932 place count 274 transition count 396
Iterating global reduction 1 with 116 rules applied. Total rules applied 1048 place count 274 transition count 396
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 1059 place count 274 transition count 385
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 1146 place count 187 transition count 298
Iterating global reduction 2 with 87 rules applied. Total rules applied 1233 place count 187 transition count 298
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1267 place count 187 transition count 264
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1299 place count 155 transition count 220
Iterating global reduction 3 with 32 rules applied. Total rules applied 1331 place count 155 transition count 220
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 1354 place count 155 transition count 197
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1360 place count 149 transition count 188
Iterating global reduction 4 with 6 rules applied. Total rules applied 1366 place count 149 transition count 188
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1372 place count 143 transition count 182
Iterating global reduction 4 with 6 rules applied. Total rules applied 1378 place count 143 transition count 182
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1380 place count 141 transition count 179
Iterating global reduction 4 with 2 rules applied. Total rules applied 1382 place count 141 transition count 179
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1384 place count 139 transition count 177
Iterating global reduction 4 with 2 rules applied. Total rules applied 1386 place count 139 transition count 177
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1388 place count 137 transition count 175
Iterating global reduction 4 with 2 rules applied. Total rules applied 1390 place count 137 transition count 175
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1391 place count 136 transition count 174
Iterating global reduction 4 with 1 rules applied. Total rules applied 1392 place count 136 transition count 174
Applied a total of 1392 rules in 172 ms. Remains 136 /414 variables (removed 278) and now considering 174/1954 (removed 1780) transitions.
// Phase 1: matrix 174 rows 136 cols
[2024-05-28 16:51:33] [INFO ] Computed 5 invariants in 28 ms
[2024-05-28 16:51:33] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-28 16:51:33] [INFO ] Invariant cache hit.
[2024-05-28 16:51:33] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-28 16:51:34] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-28 16:51:34] [INFO ] Invariant cache hit.
[2024-05-28 16:51:34] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 20 ms to minimize.
[2024-05-28 16:51:38] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 174/309 variables, 135/142 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 76/218 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 173 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/310 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (OVERLAPS) 0/310 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 219 constraints, problems are : Problem set: 0 solved, 173 unsolved in 16717 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-28 16:51:52] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 1/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-28 16:51:54] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-28 16:51:55] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 174/309 variables, 135/145 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 76/221 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 145/366 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-28 16:52:01] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
[2024-05-28 16:52:02] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 3 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD159 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 3/369 constraints. Problems are: Problem set: 3 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/309 variables, 0/369 constraints. Problems are: Problem set: 3 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 1/310 variables, 1/370 constraints. Problems are: Problem set: 3 solved, 170 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 28/398 constraints. Problems are: Problem set: 3 solved, 170 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 310/310 variables, and 398 constraints, problems are : Problem set: 3 solved, 170 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 136/136 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 8/8 constraints]
After SMT, in 47563ms problems are : Problem set: 3 solved, 170 unsolved
Search for dead transitions found 3 dead transitions in 47595ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/414 places, 171/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 171
Applied a total of 3 rules in 5 ms. Remains 133 /136 variables (removed 3) and now considering 171/171 (removed 0) transitions.
// Phase 1: matrix 171 rows 133 cols
[2024-05-28 16:52:21] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 16:52:22] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-28 16:52:22] [INFO ] Invariant cache hit.
[2024-05-28 16:52:22] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 16:52:22] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/414 places, 171/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50060 ms. Remains : 133/414 places, 171/1954 transitions.
Support contains 8 out of 133 places after structural reductions.
[2024-05-28 16:52:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 16:52:23] [INFO ] Flatten gal took : 83 ms
[2024-05-28 16:52:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:52:23] [INFO ] Flatten gal took : 38 ms
[2024-05-28 16:52:23] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 5 out of 133 places (down from 8) after GAL structural reductions.
RANDOM walk for 40000 steps (8908 resets) in 2979 ms. (13 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4095 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4200 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4109 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4060 resets) in 196 ms. (203 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4104 resets) in 223 ms. (178 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 421093 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 5
Probabilistic random walk after 421093 steps, saw 196099 distinct states, run finished after 3006 ms. (steps per millisecond=140 ) properties seen :0
[2024-05-28 16:52:27] [INFO ] Invariant cache hit.
[2024-05-28 16:52:27] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 74/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 24/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 151/254 variables, 103/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 55/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 8 (OVERLAPS) 50/304 variables, 30/192 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 20/212 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 212 constraints, problems are : Problem set: 2 solved, 3 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/77 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-28 16:52:28] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 26/103 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 151/254 variables, 103/108 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 55/163 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 2/165 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/165 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 50/304 variables, 30/195 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/304 variables, 20/215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 1/216 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-28 16:52:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:52:28] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 2/218 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/304 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 218 constraints, problems are : Problem set: 2 solved, 3 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 948ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 1149 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 171/171 transitions.
Graph (complete) has 395 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 131 transition count 167
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 127 transition count 163
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 127 transition count 163
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 123 transition count 157
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 123 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 123 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 119 transition count 149
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 119 transition count 149
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 116 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 116 transition count 145
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 113 transition count 142
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 113 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 113 transition count 140
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 111 transition count 138
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 111 transition count 138
Applied a total of 50 rules in 58 ms. Remains 111 /133 variables (removed 22) and now considering 138/171 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 111/133 places, 138/171 transitions.
RANDOM walk for 40000 steps (8889 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4111 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4181 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4145 resets) in 201 ms. (198 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 419757 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 3
Probabilistic random walk after 419757 steps, saw 188126 distinct states, run finished after 3001 ms. (steps per millisecond=139 ) properties seen :0
// Phase 1: matrix 138 rows 111 cols
[2024-05-28 16:52:33] [INFO ] Computed 3 invariants in 5 ms
[2024-05-28 16:52:33] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 96/162 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 70/232 variables, 32/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 55/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 17/249 variables, 13/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 4/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/249 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 96/162 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:52:33] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 70/232 variables, 32/102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 55/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 3/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 17/249 variables, 13/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:52:33] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/249 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/249 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 178 constraints, problems are : Problem set: 0 solved, 3 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 852 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 138/138 transitions.
Applied a total of 0 rules in 12 ms. Remains 111 /111 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 111/111 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 138/138 transitions.
Applied a total of 0 rules in 17 ms. Remains 111 /111 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-28 16:52:34] [INFO ] Invariant cache hit.
[2024-05-28 16:52:34] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 16:52:34] [INFO ] Invariant cache hit.
[2024-05-28 16:52:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 16:52:35] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-28 16:52:35] [INFO ] Redundant transitions in 4 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-28 16:52:35] [INFO ] Invariant cache hit.
[2024-05-28 16:52:35] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 137 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 138/249 variables, 111/114 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 59/173 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 16:52:38] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/174 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/174 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 174 constraints, problems are : Problem set: 3 solved, 134 unsolved in 8409 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 137/245 variables, 108/111 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 58/169 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 16/185 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 4/249 variables, 3/188 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/249 variables, 1/189 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 118/307 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 1/308 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 16:52:55] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 1/309 constraints. Problems are: Problem set: 3 solved, 134 unsolved
[2024-05-28 16:52:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/249 variables, 1/310 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/249 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 134 unsolved
At refinement iteration 15 (OVERLAPS) 0/249 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 310 constraints, problems are : Problem set: 3 solved, 134 unsolved in 24598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 134/137 constraints, Known Traps: 3/3 constraints]
After SMT, in 33217ms problems are : Problem set: 3 solved, 134 unsolved
Search for dead transitions found 3 dead transitions in 33220ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 135/138 transitions.
Graph (complete) has 320 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 108 /111 variables (removed 3) and now considering 135/135 (removed 0) transitions.
// Phase 1: matrix 135 rows 108 cols
[2024-05-28 16:53:08] [INFO ] Computed 3 invariants in 5 ms
[2024-05-28 16:53:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 16:53:08] [INFO ] Invariant cache hit.
[2024-05-28 16:53:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 16:53:08] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/111 places, 135/138 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34201 ms. Remains : 108/111 places, 135/138 transitions.
RANDOM walk for 40000 steps (8959 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (4117 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4078 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4198 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 503815 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 3
Probabilistic random walk after 503815 steps, saw 227036 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-28 16:53:12] [INFO ] Invariant cache hit.
[2024-05-28 16:53:12] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 96/162 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 67/229 variables, 31/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 55/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 14/243 variables, 11/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/243 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/243 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 169 constraints, problems are : Problem set: 0 solved, 3 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 59/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 96/162 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 67/229 variables, 31/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 55/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/229 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/243 variables, 11/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/243 variables, 3/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:53:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/243 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/243 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 174 constraints, problems are : Problem set: 0 solved, 3 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 733ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 693 ms.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 108/108 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-28 16:53:13] [INFO ] Invariant cache hit.
[2024-05-28 16:53:13] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-28 16:53:13] [INFO ] Invariant cache hit.
[2024-05-28 16:53:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 16:53:14] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2024-05-28 16:53:14] [INFO ] Redundant transitions in 4 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-28 16:53:14] [INFO ] Invariant cache hit.
[2024-05-28 16:53:14] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 135/243 variables, 108/111 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 58/169 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-28 16:53:17] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/170 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/170 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/170 constraints. Problems are: Problem set: 4 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 170 constraints, problems are : Problem set: 4 solved, 130 unsolved in 6190 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 4 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 5/108 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 135/243 variables, 108/112 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 58/170 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 130/300 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/300 constraints. Problems are: Problem set: 4 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/300 constraints. Problems are: Problem set: 4 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 300 constraints, problems are : Problem set: 4 solved, 130 unsolved in 10751 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/134 constraints, Known Traps: 1/1 constraints]
After SMT, in 17096ms problems are : Problem set: 4 solved, 130 unsolved
Search for dead transitions found 4 dead transitions in 17098ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 108/108 places, 131/135 transitions.
Graph (complete) has 310 edges and 108 vertex of which 104 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 130
Applied a total of 2 rules in 13 ms. Remains 104 /108 variables (removed 4) and now considering 130/131 (removed 1) transitions.
// Phase 1: matrix 130 rows 104 cols
[2024-05-28 16:53:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 16:53:31] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-28 16:53:31] [INFO ] Invariant cache hit.
[2024-05-28 16:53:31] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 16:53:31] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 104/108 places, 130/135 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18059 ms. Remains : 104/108 places, 130/135 transitions.
RANDOM walk for 40000 steps (8892 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4087 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4063 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 454975 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 3
Probabilistic random walk after 454975 steps, saw 204230 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2024-05-28 16:53:34] [INFO ] Invariant cache hit.
[2024-05-28 16:53:34] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 91/208 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 51/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 26/234 variables, 21/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/234 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 76/117 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 91/208 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 51/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 26/234 variables, 21/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 16:53:35] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/234 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 166 constraints, problems are : Problem set: 0 solved, 3 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 617ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 925 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 15 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 104/104 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-28 16:53:36] [INFO ] Invariant cache hit.
[2024-05-28 16:53:36] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-28 16:53:36] [INFO ] Invariant cache hit.
[2024-05-28 16:53:36] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 16:53:36] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-28 16:53:36] [INFO ] Redundant transitions in 4 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 16:53:36] [INFO ] Invariant cache hit.
[2024-05-28 16:53:36] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 162 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5659 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/234 variables, 104/106 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 56/162 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 129/291 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2024-05-28 16:53:45] [INFO ] Deduced a trap composed of 36 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 292 constraints, problems are : Problem set: 0 solved, 129 unsolved in 12486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 104/104 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 1/1 constraints]
After SMT, in 18305ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 18307ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18707 ms. Remains : 104/104 places, 130/130 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 8 rules applied. Total rules applied 8 place count 104 transition count 122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 98 transition count 122
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 14 place count 98 transition count 108
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 42 place count 84 transition count 108
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 78 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 58 place count 76 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 76 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 75 transition count 110
Applied a total of 60 rules in 24 ms. Remains 75 /104 variables (removed 29) and now considering 110/130 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 110 rows 75 cols
[2024-05-28 16:53:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 16:53:55] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 16:53:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-28 16:53:55] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:53:55] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 16:53:55] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 2 ms to minimize.
[2024-05-28 16:53:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 1
[2024-05-28 16:53:55] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 16:53:55] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 387 ms.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2024-05-28 16:53:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 23 ms
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 25 ms
[2024-05-28 16:53:55] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 2 out of 133 places (down from 3) after GAL structural reductions.
Computed a total of 34 stabilizing places and 42 stable transitions
Graph (complete) has 438 edges and 133 vertex of which 131 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 171/171 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 125 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 125 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 125 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 119 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 119 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 119 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 40 place count 114 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 114 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 114 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 50 place count 110 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 54 place count 110 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 58 place count 106 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 106 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 67 place count 102 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 102 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 75 place count 99 transition count 110
Iterating global reduction 6 with 3 rules applied. Total rules applied 78 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 98 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 97 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 96 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 95 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 95 transition count 104
Applied a total of 86 rules in 26 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 95/133 places, 104/171 transitions.
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 11 ms
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 11 ms
[2024-05-28 16:53:55] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 171/171 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 126 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 126 transition count 151
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 120 transition count 143
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 120 transition count 143
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 120 transition count 138
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 37 place count 115 transition count 131
Iterating global reduction 2 with 5 rules applied. Total rules applied 42 place count 115 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 115 transition count 130
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 111 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 111 transition count 125
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 55 place count 107 transition count 121
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 107 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 107 transition count 120
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 64 place count 103 transition count 116
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 103 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 103 transition count 115
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 101 transition count 113
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 101 transition count 113
Applied a total of 73 rules in 17 ms. Remains 101 /133 variables (removed 32) and now considering 113/171 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 101/133 places, 113/171 transitions.
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 10 ms
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 11 ms
[2024-05-28 16:53:55] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 171/171 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 125 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 125 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 125 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 119 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 119 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 119 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 40 place count 114 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 114 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 114 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 50 place count 110 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 54 place count 110 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 58 place count 106 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 106 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 67 place count 102 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 102 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 75 place count 99 transition count 110
Iterating global reduction 6 with 3 rules applied. Total rules applied 78 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 98 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 97 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 96 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 95 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 95 transition count 104
Applied a total of 86 rules in 24 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 95/133 places, 104/171 transitions.
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 11 ms
[2024-05-28 16:53:55] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 171/171 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 125 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 125 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 125 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 119 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 119 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 119 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 40 place count 114 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 114 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 114 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 50 place count 110 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 54 place count 110 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 58 place count 106 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 106 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 67 place count 102 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 102 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 75 place count 99 transition count 110
Iterating global reduction 6 with 3 rules applied. Total rules applied 78 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 98 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 97 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 96 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 95 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 95 transition count 104
Applied a total of 86 rules in 23 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 95/133 places, 104/171 transitions.
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 10 ms
[2024-05-28 16:53:55] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 133/133 places, 171/171 transitions.
Graph (complete) has 438 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 132 transition count 169
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 126 transition count 151
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 126 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 126 transition count 150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 121 transition count 143
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 121 transition count 143
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 121 transition count 139
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 35 place count 116 transition count 132
Iterating global reduction 3 with 5 rules applied. Total rules applied 40 place count 116 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 116 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 45 place count 112 transition count 126
Iterating global reduction 4 with 4 rules applied. Total rules applied 49 place count 112 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 53 place count 108 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 108 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 108 transition count 121
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 61 place count 105 transition count 118
Iterating global reduction 5 with 3 rules applied. Total rules applied 64 place count 105 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 65 place count 105 transition count 117
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 67 place count 103 transition count 115
Iterating global reduction 6 with 2 rules applied. Total rules applied 69 place count 103 transition count 115
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 70 place count 102 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 71 place count 102 transition count 114
Applied a total of 71 rules in 45 ms. Remains 102 /133 variables (removed 31) and now considering 114/171 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 102/133 places, 114/171 transitions.
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 10 ms
[2024-05-28 16:53:55] [INFO ] Flatten gal took : 12 ms
[2024-05-28 16:53:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 171/171 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 169
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 125 transition count 150
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 125 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 125 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 24 place count 119 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 119 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 35 place count 119 transition count 136
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 40 place count 114 transition count 129
Iterating global reduction 3 with 5 rules applied. Total rules applied 45 place count 114 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 114 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 50 place count 110 transition count 123
Iterating global reduction 4 with 4 rules applied. Total rules applied 54 place count 110 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 58 place count 106 transition count 119
Iterating global reduction 4 with 4 rules applied. Total rules applied 62 place count 106 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 106 transition count 118
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 67 place count 102 transition count 114
Iterating global reduction 5 with 4 rules applied. Total rules applied 71 place count 102 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 72 place count 102 transition count 113
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 75 place count 99 transition count 110
Iterating global reduction 6 with 3 rules applied. Total rules applied 78 place count 99 transition count 110
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 79 place count 98 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 80 place count 98 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 81 place count 97 transition count 106
Iterating global reduction 6 with 1 rules applied. Total rules applied 82 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 83 place count 96 transition count 105
Iterating global reduction 6 with 1 rules applied. Total rules applied 84 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 85 place count 95 transition count 104
Iterating global reduction 6 with 1 rules applied. Total rules applied 86 place count 95 transition count 104
Applied a total of 86 rules in 21 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 95/133 places, 104/171 transitions.
[2024-05-28 16:53:56] [INFO ] Flatten gal took : 8 ms
[2024-05-28 16:53:56] [INFO ] Flatten gal took : 9 ms
[2024-05-28 16:53:56] [INFO ] Input system was already deterministic with 104 transitions.
[2024-05-28 16:53:56] [INFO ] Flatten gal took : 14 ms
[2024-05-28 16:53:56] [INFO ] Flatten gal took : 14 ms
[2024-05-28 16:53:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-28 16:53:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 171 transitions and 679 arcs took 4 ms.
Total runtime 144269 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m18

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 735
MODEL NAME: /home/mcc/execution/413/model
133 places, 171 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 SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716915876763

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

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="SieveSingleMsgMbox-PT-d2m18"
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 SieveSingleMsgMbox-PT-d2m18, 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 r377-smll-171683809700113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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