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.r378-smll-171683810800113.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 itstools
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 r378-smll-171683810800113
=====================================================================

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

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 21:15:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:15:21] [INFO ] Load time of PNML (sax parser for PT used): 532 ms
[2024-05-28 21:15:21] [INFO ] Transformed 2398 places.
[2024-05-28 21:15:21] [INFO ] Transformed 1954 transitions.
[2024-05-28 21:15:21] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 786 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Deduced a syphon composed of 1984 places in 39 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 205 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 21:15:21] [INFO ] Computed 5 invariants in 24 ms
[2024-05-28 21:15:22] [INFO ] Implicit Places using invariants in 813 ms returned []
[2024-05-28 21:15:22] [INFO ] Invariant cache hit.
[2024-05-28 21:15:23] [INFO ] State equation strengthened by 76 read => feed constraints.
[2024-05-28 21:15:23] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1672 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-28 21:15:23] [INFO ] Invariant cache hit.
[2024-05-28 21:15:23] [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 21:15:28] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 26 ms to minimize.
[2024-05-28 21:15:28] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 3 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 19111 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 21:15:44] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 3 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 21:15:46] [INFO ] Deduced a trap composed of 41 places in 70 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 21:15:47] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 2 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 21:15:52] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-28 21:15:52] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 2 ms to minimize.
[2024-05-28 21:15:53] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 2 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
At refinement iteration 16 (INCLUDED_ONLY) 0/310 variables, 0/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 30020 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 49986ms problems are : Problem set: 3 solved, 170 unsolved
Search for dead transitions found 3 dead transitions in 50018ms
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 4 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 21:16:13] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:16:13] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-28 21:16:13] [INFO ] Invariant cache hit.
[2024-05-28 21:16:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-28 21:16:14] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 648 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 52590 ms. Remains : 133/414 places, 171/1954 transitions.
Support contains 8 out of 133 places after structural reductions.
[2024-05-28 21:16:14] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 21:16:14] [INFO ] Flatten gal took : 90 ms
[2024-05-28 21:16:14] [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 21:16:14] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:16:14] [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 (9014 resets) in 2411 ms. (16 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4116 resets) in 509 ms. (78 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (4128 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4190 resets) in 164 ms. (242 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (4223 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4160 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 418487 steps, run timeout after 3001 ms. (steps per millisecond=139 ) properties seen :0 out of 5
Probabilistic random walk after 418487 steps, saw 194937 distinct states, run finished after 3008 ms. (steps per millisecond=139 ) properties seen :0
[2024-05-28 21:16:18] [INFO ] Invariant cache hit.
[2024-05-28 21:16:18] [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 305 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 21:16:19] [INFO ] Deduced a trap composed of 45 places in 53 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 21:16:19] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 3 ms to minimize.
[2024-05-28 21:16:19] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 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 711 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 1028ms problems are : Problem set: 2 solved, 3 unsolved
Parikh walk visited 0 properties in 1117 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.2 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 67 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 67 ms. Remains : 111/133 places, 138/171 transitions.
RANDOM walk for 40000 steps (8919 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4197 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4177 resets) in 150 ms. (264 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4202 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 480695 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 3
Probabilistic random walk after 480695 steps, saw 216660 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
// Phase 1: matrix 138 rows 111 cols
[2024-05-28 21:16:24] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 21:16:24] [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 192 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 21:16:24] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 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 21:16:24] [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 459 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 662ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 907 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 11 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 12 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 10 ms. Remains 111 /111 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-28 21:16:25] [INFO ] Invariant cache hit.
[2024-05-28 21:16:26] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:16:26] [INFO ] Invariant cache hit.
[2024-05-28 21:16:26] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-28 21:16:26] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2024-05-28 21:16:26] [INFO ] Redundant transitions in 4 ms returned []
Running 137 sub problems to find dead transitions.
[2024-05-28 21:16:26] [INFO ] Invariant cache hit.
[2024-05-28 21:16:26] [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 21:16:29] [INFO ] Deduced a trap composed of 41 places in 46 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 6814 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 21:16:42] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 1 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 21:16:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 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 25184 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 32180ms problems are : Problem set: 3 solved, 134 unsolved
Search for dead transitions found 3 dead transitions in 32183ms
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 13 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 21:16:58] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:16:58] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-28 21:16:58] [INFO ] Invariant cache hit.
[2024-05-28 21:16:58] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 21:16:59] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 542 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 33210 ms. Remains : 108/111 places, 135/138 transitions.
RANDOM walk for 40000 steps (8986 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4166 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4144 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4139 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 507980 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 3
Probabilistic random walk after 507980 steps, saw 228802 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-28 21:17:02] [INFO ] Invariant cache hit.
[2024-05-28 21:17:02] [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 194 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 21:17:02] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 10 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 21:17:02] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 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 426 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 627ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 600 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 12 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 12 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 10 ms. Remains 108 /108 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-28 21:17:03] [INFO ] Invariant cache hit.
[2024-05-28 21:17:03] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-28 21:17:03] [INFO ] Invariant cache hit.
[2024-05-28 21:17:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 21:17:04] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-28 21:17:04] [INFO ] Redundant transitions in 6 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-28 21:17:04] [INFO ] Invariant cache hit.
[2024-05-28 21:17:04] [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 21:17:07] [INFO ] Deduced a trap composed of 36 places in 40 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 7888 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 11428 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 19555ms problems are : Problem set: 4 solved, 130 unsolved
Search for dead transitions found 4 dead transitions in 19559ms
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 9 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 21:17:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 21:17:23] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 21:17:23] [INFO ] Invariant cache hit.
[2024-05-28 21:17:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:17:24] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 354 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 20600 ms. Remains : 104/108 places, 130/135 transitions.
RANDOM walk for 40000 steps (9030 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4131 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4196 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (4088 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 552557 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 3
Probabilistic random walk after 552557 steps, saw 247815 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-05-28 21:17:27] [INFO ] Invariant cache hit.
[2024-05-28 21:17:27] [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 220 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 21:17:27] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 2 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 389 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 624ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1011 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 14 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 14 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 21:17:28] [INFO ] Invariant cache hit.
[2024-05-28 21:17:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 21:17:29] [INFO ] Invariant cache hit.
[2024-05-28 21:17:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-28 21:17:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
[2024-05-28 21:17:29] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-28 21:17:29] [INFO ] Invariant cache hit.
[2024-05-28 21:17:29] [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 5366 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 21:17:37] [INFO ] Deduced a trap composed of 36 places in 29 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 13137 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 18667ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 18668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19065 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 1 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 1 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 23 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 21:17:47] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 21:17:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 21:17:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-28 21:17:48] [INFO ] [Nat]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-28 21:17:48] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-28 21:17:48] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 2 ms to minimize.
[2024-05-28 21:17:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
TRAPS : Iteration 1
[2024-05-28 21:17:48] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-28 21:17:48] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 325 ms.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
[2024-05-28 21:17:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 21:17:48] [INFO ] Flatten gal took : 15 ms
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:17:48] [INFO ] Flatten gal took : 15 ms
[2024-05-28 21:17:48] [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.6 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 31 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-28 21:17:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:17:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-28 21:17:48] [INFO ] Invariant cache hit.
[2024-05-28 21:17:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 21:17:48] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 21:17:48] [INFO ] Invariant cache hit.
[2024-05-28 21:17:48] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 3138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 84/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 3 solved, 100 unsolved in 10083 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 13318ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 13320ms
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 : 95/133 places, 101/171 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 2 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-28 21:18:02] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:18:02] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-28 21:18:02] [INFO ] Invariant cache hit.
[2024-05-28 21:18:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 21:18:02] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/133 places, 101/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14112 ms. Remains : 92/133 places, 101/171 transitions.
[2024-05-28 21:18:02] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:18:02] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:18:02] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-28 21:18:02] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:18:02] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:18:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality10952802462047340649.gal : 4 ms
[2024-05-28 21:18:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6633163250444046150.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10952802462047340649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6633163250444046150.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86386e+09,21.5635,365688,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: EG(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t41, t69, t76, t77, t78, t79, t80, t81, t82, t83, t84, t88, t89, t92, t93, t95,...281
(forward)formula 0,0,24.6587,365688,1,0,221,1.43845e+06,223,90,3230,881166,254
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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 11 ms. Remains 101 /133 variables (removed 32) and now considering 113/171 (removed 58) transitions.
// Phase 1: matrix 113 rows 101 cols
[2024-05-28 21:18:27] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:18:27] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 21:18:27] [INFO ] Invariant cache hit.
[2024-05-28 21:18:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 21:18:27] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2024-05-28 21:18:27] [INFO ] Invariant cache hit.
[2024-05-28 21:18:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD101 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/214 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 43/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/214 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 148 constraints, problems are : Problem set: 3 solved, 109 unsolved in 5242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 2/100 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 113/213 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 43/147 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 17/164 constraints. Problems are: Problem set: 3 solved, 109 unsolved
[2024-05-28 21:18:35] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 1/214 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/214 variables, 92/258 constraints. Problems are: Problem set: 3 solved, 109 unsolved
[2024-05-28 21:18:40] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 1/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
At refinement iteration 16 (OVERLAPS) 0/214 variables, 0/259 constraints. Problems are: Problem set: 3 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 259 constraints, problems are : Problem set: 3 solved, 109 unsolved in 15219 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 109/112 constraints, Known Traps: 2/2 constraints]
After SMT, in 20557ms problems are : Problem set: 3 solved, 109 unsolved
Search for dead transitions found 3 dead transitions in 20559ms
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 : 101/133 places, 110/171 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 98 transition count 110
Applied a total of 3 rules in 3 ms. Remains 98 /101 variables (removed 3) and now considering 110/110 (removed 0) transitions.
// Phase 1: matrix 110 rows 98 cols
[2024-05-28 21:18:48] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:18:48] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-28 21:18:48] [INFO ] Invariant cache hit.
[2024-05-28 21:18:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:18:48] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 98/133 places, 110/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21495 ms. Remains : 98/133 places, 110/171 transitions.
[2024-05-28 21:18:48] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:18:48] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:18:48] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-28 21:18:48] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:18:49] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:18:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9603138542615900266.gal : 6 ms
[2024-05-28 21:18:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality12415781305139677144.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9603138542615900266.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12415781305139677144.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00468e+10,8.46201,165908,2,12011,5,705711,6,0,502,752308,0


Converting to forward existential form...Done !
original formula: EF((EX(TRUE) * EX((l106>0))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * EX(TRUE))) * (l106>0))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t20, t24, t25, t45, t48, t76, t83, t84, t85, t86, t87, t88, t89, t90, t91, t95,...313
(forward)formula 0,1,12.1976,165908,1,0,192,705711,234,95,3454,752308,226
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

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 16 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-28 21:19:01] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:19:01] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-28 21:19:01] [INFO ] Invariant cache hit.
[2024-05-28 21:19:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 21:19:01] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 21:19:01] [INFO ] Invariant cache hit.
[2024-05-28 21:19:01] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 4290 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 84/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 3 solved, 100 unsolved in 11007 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 15423ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 15424ms
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 : 95/133 places, 101/171 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 2 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-28 21:19:17] [INFO ] Computed 4 invariants in 4 ms
[2024-05-28 21:19:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 21:19:17] [INFO ] Invariant cache hit.
[2024-05-28 21:19:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 21:19:17] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/133 places, 101/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16405 ms. Remains : 92/133 places, 101/171 transitions.
[2024-05-28 21:19:17] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:19:17] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:19:17] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-28 21:19:17] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:19:17] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:19:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality10821481107841162810.gal : 5 ms
[2024-05-28 21:19:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality9714369917338781581.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10821481107841162810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9714369917338781581.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86386e+09,21.7507,365100,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t41, t69, t76, t77, t78, t79, t80, t81, t82, t83, t84, t88, t89, t92, t93, t95,...281
Detected timeout of ITS tools.
[2024-05-28 21:19:47] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:19:47] [INFO ] Applying decomposition
[2024-05-28 21:19:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17658445703680749257.txt' '-o' '/tmp/graph17658445703680749257.bin' '-w' '/tmp/graph17658445703680749257.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17658445703680749257.bin' '-l' '-1' '-v' '-w' '/tmp/graph17658445703680749257.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:19:47] [INFO ] Decomposing Gal with order
[2024-05-28 21:19:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:19:48] [INFO ] Removed a total of 89 redundant transitions.
[2024-05-28 21:19:48] [INFO ] Flatten gal took : 58 ms
[2024-05-28 21:19:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 12 ms.
[2024-05-28 21:19:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14098403479925847403.gal : 8 ms
[2024-05-28 21:19:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11505593057969324241.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14098403479925847403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11505593057969324241.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
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 12 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-28 21:20:18] [INFO ] Computed 4 invariants in 3 ms
[2024-05-28 21:20:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 21:20:18] [INFO ] Invariant cache hit.
[2024-05-28 21:20:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 21:20:18] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 21:20:18] [INFO ] Invariant cache hit.
[2024-05-28 21:20:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 4561 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 84/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 3 solved, 100 unsolved in 11161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 15860ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 15862ms
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 : 95/133 places, 101/171 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 1 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-28 21:20:34] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:20:34] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 21:20:34] [INFO ] Invariant cache hit.
[2024-05-28 21:20:34] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 21:20:34] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/133 places, 101/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16708 ms. Remains : 92/133 places, 101/171 transitions.
[2024-05-28 21:20:34] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:20:34] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:20:34] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-28 21:20:34] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:20:34] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:20:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality11423582075991349629.gal : 3 ms
[2024-05-28 21:20:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality6936541706350278200.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11423582075991349629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6936541706350278200.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86386e+09,21.9278,365080,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t14, t38, t41, t69, t76, t77, t78, t79, t80, t81, t82, t83, t84, t88, t89, t92, t93, t95,...281
(forward)formula 0,1,24.6752,365080,1,0,177,1.43845e+06,217,89,3198,881166,208
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

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 35 ms. Remains 102 /133 variables (removed 31) and now considering 114/171 (removed 57) transitions.
// Phase 1: matrix 114 rows 102 cols
[2024-05-28 21:20:59] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:20:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-28 21:20:59] [INFO ] Invariant cache hit.
[2024-05-28 21:20:59] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-28 21:21:00] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-28 21:21:00] [INFO ] Redundant transitions in 4 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-28 21:21:00] [INFO ] Invariant cache hit.
[2024-05-28 21:21:00] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 5 (OVERLAPS) 114/216 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 43/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 149 constraints, problems are : Problem set: 3 solved, 110 unsolved in 4227 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 114/215 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 43/148 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 17/165 constraints. Problems are: Problem set: 3 solved, 110 unsolved
[2024-05-28 21:21:07] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 1/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 1/216 variables, 1/167 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 93/260 constraints. Problems are: Problem set: 3 solved, 110 unsolved
[2024-05-28 21:21:12] [INFO ] Deduced a trap composed of 47 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/216 variables, 1/261 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/216 variables, 0/261 constraints. Problems are: Problem set: 3 solved, 110 unsolved
[2024-05-28 21:21:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/216 variables, 1/262 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 110 unsolved
At refinement iteration 18 (OVERLAPS) 0/216 variables, 0/262 constraints. Problems are: Problem set: 3 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 262 constraints, problems are : Problem set: 3 solved, 110 unsolved in 22679 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 110/113 constraints, Known Traps: 3/3 constraints]
After SMT, in 27067ms problems are : Problem set: 3 solved, 110 unsolved
Search for dead transitions found 3 dead transitions in 27069ms
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 SI_CTL mode, iteration 1 : 102/133 places, 111/171 transitions.
Graph (complete) has 315 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 99 /102 variables (removed 3) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 99 cols
[2024-05-28 21:21:27] [INFO ] Computed 4 invariants in 2 ms
[2024-05-28 21:21:27] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-28 21:21:27] [INFO ] Invariant cache hit.
[2024-05-28 21:21:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 21:21:27] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 99/133 places, 111/171 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 28080 ms. Remains : 99/133 places, 111/171 transitions.
[2024-05-28 21:21:27] [INFO ] Flatten gal took : 12 ms
[2024-05-28 21:21:27] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:21:27] [INFO ] Input system was already deterministic with 111 transitions.
[2024-05-28 21:21:27] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:21:27] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:21:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality5484227001297919782.gal : 2 ms
[2024-05-28 21:21:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16156164586736829045.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5484227001297919782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16156164586736829045.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00707e+10,8.60961,165644,2,13980,5,687696,6,0,507,720063,0


Converting to forward existential form...Done !
original formula: AF(AG((p15>0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p15>0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t15, t19, t21, t24, t26, t45, t48, t76, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92,...318
(forward)formula 0,0,21.2639,304204,1,0,240,1.21547e+06,246,100,3592,1.12986e+06,282
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

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 15 ms. Remains 95 /133 variables (removed 38) and now considering 104/171 (removed 67) transitions.
// Phase 1: matrix 104 rows 95 cols
[2024-05-28 21:21:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:21:49] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-28 21:21:49] [INFO ] Invariant cache hit.
[2024-05-28 21:21:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-28 21:21:49] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-28 21:21:49] [INFO ] Invariant cache hit.
[2024-05-28 21:21:49] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 5 (OVERLAPS) 104/199 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 100 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 40/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/139 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 139 constraints, problems are : Problem set: 3 solved, 100 unsolved in 4643 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/92 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 2/94 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 104/198 variables, 94/98 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 40/138 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 16/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/154 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 1/199 variables, 1/155 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 84/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 3 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 3 solved, 100 unsolved in 12105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 100/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 16876ms problems are : Problem set: 3 solved, 100 unsolved
Search for dead transitions found 3 dead transitions in 16878ms
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 : 95/133 places, 101/171 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 92 transition count 101
Applied a total of 3 rules in 1 ms. Remains 92 /95 variables (removed 3) and now considering 101/101 (removed 0) transitions.
// Phase 1: matrix 101 rows 92 cols
[2024-05-28 21:22:06] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 21:22:06] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-28 21:22:06] [INFO ] Invariant cache hit.
[2024-05-28 21:22:06] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-28 21:22:06] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 92/133 places, 101/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17643 ms. Remains : 92/133 places, 101/171 transitions.
[2024-05-28 21:22:06] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:22:06] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:22:06] [INFO ] Input system was already deterministic with 101 transitions.
[2024-05-28 21:22:06] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:22:06] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:22:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8645312783990322771.gal : 8 ms
[2024-05-28 21:22:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6037786543681305815.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8645312783990322771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6037786543681305815.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.86386e+09,22.0422,366176,2,12522,5,1.43845e+06,6,0,469,881166,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,22.046,366176,1,0,6,1.43845e+06,7,1,625,881166,1
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-28 21:22:29] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:22:29] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:22:29] [INFO ] Applying decomposition
[2024-05-28 21:22:29] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9096624892442746486.txt' '-o' '/tmp/graph9096624892442746486.bin' '-w' '/tmp/graph9096624892442746486.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9096624892442746486.bin' '-l' '-1' '-v' '-w' '/tmp/graph9096624892442746486.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:22:29] [INFO ] Decomposing Gal with order
[2024-05-28 21:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:22:29] [INFO ] Removed a total of 142 redundant transitions.
[2024-05-28 21:22:29] [INFO ] Flatten gal took : 21 ms
[2024-05-28 21:22:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 7 ms.
[2024-05-28 21:22:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality1829942166325303814.gal : 6 ms
[2024-05-28 21:22:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality7980111425261750776.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1829942166325303814.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7980111425261750776.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.51212e+11,259.995,2325256,8711,10210,1.34779e+06,949583,387,8.52115e+06,247,2.62658e+07,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t24, t37, t41, t64, t67, t68, t88, t132, t133, t134, t135, t136, t137, t138, t139, t141,...475
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 21:44:51] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:44:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13354453078729951799.gal : 3 ms
[2024-05-28 21:44:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality17612701152625641457.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13354453078729951799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17612701152625641457.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.51212e+11,64.9017,1129164,2,30500,5,3.45576e+06,6,0,700,2.56634e+06,0


Converting to forward existential form...Done !
original formula: EG(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,EX(TRUE))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t18, t25, t30, t34, t35, t37, t38, t64, t67, t68, t69, t70, t80, t81, t87, t88, t90, t108...474
(forward)formula 0,1,549.503,2775888,1,0,1230,1.30224e+07,13,733,2165,1.67344e+07,376
FORMULA SieveSingleMsgMbox-PT-d2m18-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Total runtime 2321815 ms.

BK_STOP 1716933242453

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r378-smll-171683810800113"
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 ;