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.r532-smll-171683810800124.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 ltsminxred
Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 19:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:20 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-d2m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717248906959

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:35:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:35:10] [INFO ] Load time of PNML (sax parser for PT used): 720 ms
[2024-06-01 13:35:10] [INFO ] Transformed 2398 places.
[2024-06-01 13:35:10] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:35:10] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 1015 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 50 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 958 place count 284 transition count 558
Iterating global reduction 1 with 105 rules applied. Total rules applied 1063 place count 284 transition count 558
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 1071 place count 284 transition count 550
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1149 place count 206 transition count 472
Iterating global reduction 2 with 78 rules applied. Total rules applied 1227 place count 206 transition count 472
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 1260 place count 206 transition count 439
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1286 place count 180 transition count 408
Iterating global reduction 3 with 26 rules applied. Total rules applied 1312 place count 180 transition count 408
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 1357 place count 180 transition count 363
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1362 place count 175 transition count 354
Iterating global reduction 4 with 5 rules applied. Total rules applied 1367 place count 175 transition count 354
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1372 place count 170 transition count 349
Iterating global reduction 4 with 5 rules applied. Total rules applied 1377 place count 170 transition count 349
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1379 place count 168 transition count 347
Iterating global reduction 4 with 2 rules applied. Total rules applied 1381 place count 168 transition count 347
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1382 place count 167 transition count 346
Iterating global reduction 4 with 1 rules applied. Total rules applied 1383 place count 167 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1384 place count 166 transition count 345
Iterating global reduction 4 with 1 rules applied. Total rules applied 1385 place count 166 transition count 345
Applied a total of 1385 rules in 203 ms. Remains 166 /414 variables (removed 248) and now considering 345/1954 (removed 1609) transitions.
// Phase 1: matrix 345 rows 166 cols
[2024-06-01 13:35:11] [INFO ] Computed 5 invariants in 29 ms
[2024-06-01 13:35:11] [INFO ] Implicit Places using invariants in 583 ms returned []
[2024-06-01 13:35:11] [INFO ] Invariant cache hit.
[2024-06-01 13:35:12] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-06-01 13:35:13] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2278 ms to find 0 implicit places.
Running 344 sub problems to find dead transitions.
[2024-06-01 13:35:13] [INFO ] Invariant cache hit.
[2024-06-01 13:35:13] [INFO ] State equation strengthened by 218 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (OVERLAPS) 1/166 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 51 places in 190 ms of which 39 ms to minimize.
[2024-06-01 13:35:23] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (OVERLAPS) 345/511 variables, 166/173 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 218/391 constraints. Problems are: Problem set: 0 solved, 344 unsolved
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 13:35:33] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 3/394 constraints. Problems are: Problem set: 3 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 511/511 variables, and 394 constraints, problems are : Problem set: 3 solved, 341 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 166/166 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 4/166 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 5/10 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 345/511 variables, 166/176 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 218/394 constraints. Problems are: Problem set: 3 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/511 variables, 341/735 constraints. Problems are: Problem set: 3 solved, 341 unsolved
[2024-06-01 13:36:06] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 511/511 variables, and 736 constraints, problems are : Problem set: 3 solved, 341 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 166/166 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 341/344 constraints, Known Traps: 6/6 constraints]
After SMT, in 61547ms problems are : Problem set: 3 solved, 341 unsolved
Search for dead transitions found 3 dead transitions in 61587ms
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 : 166/414 places, 342/1954 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 342
Applied a total of 3 rules in 8 ms. Remains 163 /166 variables (removed 3) and now considering 342/342 (removed 0) transitions.
// Phase 1: matrix 342 rows 163 cols
[2024-06-01 13:36:15] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 13:36:15] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 13:36:15] [INFO ] Invariant cache hit.
[2024-06-01 13:36:15] [INFO ] State equation strengthened by 217 read => feed constraints.
[2024-06-01 13:36:15] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/414 places, 342/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65024 ms. Remains : 163/414 places, 342/1954 transitions.
Support contains 24 out of 163 places after structural reductions.
[2024-06-01 13:36:16] [INFO ] Flatten gal took : 77 ms
[2024-06-01 13:36:16] [INFO ] Flatten gal took : 57 ms
[2024-06-01 13:36:16] [INFO ] Input system was already deterministic with 342 transitions.
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 40000 steps (8988 resets) in 3836 ms. (10 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (417 resets) in 63 ms. (62 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (184 resets) in 45 ms. (87 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (180 resets) in 43 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (183 resets) in 38 ms. (102 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (442 resets) in 84 ms. (47 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (181 resets) in 62 ms. (63 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (171 resets) in 46 ms. (85 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (193 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (181 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (178 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (196 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (185 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (194 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (198 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (180 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (189 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (189 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (205 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (186 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (199 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (189 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 210221 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :10 out of 21
Probabilistic random walk after 210221 steps, saw 93594 distinct states, run finished after 3013 ms. (steps per millisecond=69 ) properties seen :10
[2024-06-01 13:36:21] [INFO ] Invariant cache hit.
[2024-06-01 13:36:21] [INFO ] State equation strengthened by 217 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 77/90 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 37/127 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 13:36:21] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 266/393 variables, 127/132 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 141/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 112/505 variables, 36/309 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 76/385 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/505 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 385 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 78/89 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 37/126 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 13:36:23] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 266/392 variables, 126/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 141/273 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 113/505 variables, 37/310 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 76/386 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 10/396 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-01 13:36:24] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 13:36:24] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2024-06-01 13:36:25] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/505 variables, 4/400 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/505 variables, 0/400 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 400 constraints, problems are : Problem set: 1 solved, 10 unsolved in 4246 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 217/217 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 6223ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 14683 ms.
Support contains 11 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 342/342 transitions.
Graph (complete) has 603 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 162 transition count 340
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 151 transition count 272
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 151 transition count 272
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 31 place count 151 transition count 266
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 145 transition count 259
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 145 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 145 transition count 256
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 142 transition count 251
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 142 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 142 transition count 249
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 56 place count 140 transition count 247
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 140 transition count 247
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 60 place count 138 transition count 244
Iterating global reduction 4 with 2 rules applied. Total rules applied 62 place count 138 transition count 244
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 137 transition count 243
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 137 transition count 243
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 136 transition count 242
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 136 transition count 242
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 67 place count 135 transition count 241
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 135 transition count 241
Applied a total of 68 rules in 93 ms. Remains 135 /163 variables (removed 28) and now considering 241/342 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 135/163 places, 241/342 transitions.
RANDOM walk for 40000 steps (8994 resets) in 334 ms. (119 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 145 ms. (273 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1907 resets) in 217 ms. (183 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1922 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1935 resets) in 221 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1948 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1888 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1902 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1955 resets) in 199 ms. (200 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 275469 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :1 out of 10
Probabilistic random walk after 275469 steps, saw 122332 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :1
// Phase 1: matrix 241 rows 135 cols
[2024-06-01 13:36:45] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:36:45] [INFO ] State equation strengthened by 142 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 66/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/80 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 206/286 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 107/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 90/376 variables, 55/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/376 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 280 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1067 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 66/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/80 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 206/286 variables, 80/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 107/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 90/376 variables, 55/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 35/280 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 9/289 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 13:36:47] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 290 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2491 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 135/135 constraints, ReadFeed: 142/142 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 3599ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 4400 ms.
Support contains 10 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 241/241 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 227
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 227
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 133 transition count 226
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 133 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 133 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 132 transition count 223
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 132 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 132 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 131 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 131 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 130 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 130 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 129 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 129 transition count 219
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 129 transition count 213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 21 place count 128 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 128 transition count 212
Applied a total of 22 rules in 44 ms. Remains 128 /135 variables (removed 7) and now considering 212/241 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 128/135 places, 212/241 transitions.
RANDOM walk for 40000 steps (8920 resets) in 236 ms. (168 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1898 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1853 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1898 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (1852 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1858 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1872 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1879 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 261182 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 9
Probabilistic random walk after 261182 steps, saw 115351 distinct states, run finished after 3001 ms. (steps per millisecond=87 ) properties seen :0
// Phase 1: matrix 212 rows 128 cols
[2024-06-01 13:36:57] [INFO ] Computed 3 invariants in 6 ms
[2024-06-01 13:36:57] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 64/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/78 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 193/271 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 69/340 variables, 50/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 19/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/340 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 250 constraints, problems are : Problem set: 0 solved, 9 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 64/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/78 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 193/271 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 69/340 variables, 50/231 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 19/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 9/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 6 ms to minimize.
[2024-06-01 13:36:59] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/340 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/340 variables, and 261 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2831 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 3588ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 30933 ms.
Support contains 10 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 212/212 transitions.
Applied a total of 0 rules in 15 ms. Remains 128 /128 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 128/128 places, 212/212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 212/212 transitions.
Applied a total of 0 rules in 23 ms. Remains 128 /128 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2024-06-01 13:37:32] [INFO ] Invariant cache hit.
[2024-06-01 13:37:32] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 13:37:32] [INFO ] Invariant cache hit.
[2024-06-01 13:37:32] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-06-01 13:37:32] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-06-01 13:37:32] [INFO ] Redundant transitions in 9 ms returned []
Running 211 sub problems to find dead transitions.
[2024-06-01 13:37:32] [INFO ] Invariant cache hit.
[2024-06-01 13:37:32] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD193 is UNSAT
At refinement iteration 4 (OVERLAPS) 212/340 variables, 128/131 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 119/250 constraints. Problems are: Problem set: 3 solved, 208 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/250 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 7 (OVERLAPS) 0/340 variables, 0/250 constraints. Problems are: Problem set: 3 solved, 208 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/340 variables, and 250 constraints, problems are : Problem set: 3 solved, 208 unsolved in 9517 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 211/336 variables, 125/128 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 118/246 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 20/266 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 8 (OVERLAPS) 4/340 variables, 3/269 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 188/458 constraints. Problems are: Problem set: 3 solved, 208 unsolved
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:37:57] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 2/460 constraints. Problems are: Problem set: 3 solved, 208 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/460 constraints. Problems are: Problem set: 3 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 340/340 variables, and 460 constraints, problems are : Problem set: 3 solved, 208 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 128/128 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 208/211 constraints, Known Traps: 2/2 constraints]
After SMT, in 39895ms problems are : Problem set: 3 solved, 208 unsolved
Search for dead transitions found 3 dead transitions in 39899ms
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 : 128/128 places, 209/212 transitions.
Graph (complete) has 417 edges and 128 vertex of which 125 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 11 ms. Remains 125 /128 variables (removed 3) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 125 cols
[2024-06-01 13:38:12] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:38:12] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 13:38:12] [INFO ] Invariant cache hit.
[2024-06-01 13:38:12] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-06-01 13:38:13] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 125/128 places, 209/212 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 41127 ms. Remains : 125/128 places, 209/212 transitions.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 41 stabilizing places and 62 stable transitions
Graph (complete) has 661 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G((p1&&F(p2))))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 146 transition count 202
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 146 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 146 transition count 197
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 133 transition count 183
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 133 transition count 183
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 133 transition count 178
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 79 place count 124 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 88 place count 124 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 95 place count 124 transition count 157
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 119 transition count 152
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 119 transition count 152
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 114 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 114 transition count 146
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 118 place count 111 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 121 place count 111 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 111 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 106 transition count 134
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 106 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 134 place count 105 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 135 place count 105 transition count 133
Applied a total of 135 rules in 17 ms. Remains 105 /163 variables (removed 58) and now considering 133/342 (removed 209) transitions.
// Phase 1: matrix 133 rows 105 cols
[2024-06-01 13:38:13] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:38:13] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 13:38:13] [INFO ] Invariant cache hit.
[2024-06-01 13:38:13] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 13:38:13] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 13:38:13] [INFO ] Invariant cache hit.
[2024-06-01 13:38:13] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD118 is UNSAT
At refinement iteration 5 (OVERLAPS) 133/238 variables, 105/109 constraints. Problems are: Problem set: 3 solved, 129 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 60/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/238 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 169 constraints, problems are : Problem set: 3 solved, 129 unsolved in 4429 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 5 (OVERLAPS) 2/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 133/237 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 60/168 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 18/186 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/187 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 111/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
At refinement iteration 14 (OVERLAPS) 0/238 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 298 constraints, problems are : Problem set: 3 solved, 129 unsolved in 11118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 129/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 15723ms problems are : Problem set: 3 solved, 129 unsolved
Search for dead transitions found 3 dead transitions in 15726ms
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 : 105/163 places, 130/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 130
Applied a total of 3 rules in 2 ms. Remains 102 /105 variables (removed 3) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 102 cols
[2024-06-01 13:38:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:38:29] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 13:38:29] [INFO ] Invariant cache hit.
[2024-06-01 13:38:29] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-01 13:38:29] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/163 places, 130/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16481 ms. Remains : 102/163 places, 130/342 transitions.
Stuttering acceptance computed with spot in 376 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-00 finished in 16940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 130 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 130 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 130 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 121 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 121 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 121 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 116 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 116 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 111 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 126
Applied a total of 143 rules in 36 ms. Remains 102 /163 variables (removed 61) and now considering 126/342 (removed 216) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-06-01 13:38:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:38:30] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 13:38:30] [INFO ] Invariant cache hit.
[2024-06-01 13:38:30] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:38:30] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-06-01 13:38:30] [INFO ] Redundant transitions in 3 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 13:38:30] [INFO ] Invariant cache hit.
[2024-06-01 13:38:30] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 4229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 9377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 13747ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 13749ms
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_LTL mode, iteration 1 : 102/163 places, 123/342 transitions.
Graph (complete) has 325 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 7 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:38:44] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:38:44] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 13:38:44] [INFO ] Invariant cache hit.
[2024-06-01 13:38:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:38:44] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 123/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14587 ms. Remains : 99/163 places, 123/342 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
Product exploration explored 100000 steps with 22472 reset in 352 ms.
Product exploration explored 100000 steps with 22425 reset in 277 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9013 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1859 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1275044 steps, run visited all 1 properties in 1926 ms. (steps per millisecond=662 )
Probabilistic random walk after 1275044 steps, saw 535802 distinct states, run finished after 1934 ms. (steps per millisecond=659 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 13:38:47] [INFO ] Invariant cache hit.
[2024-06-01 13:38:47] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 13:38:47] [INFO ] Invariant cache hit.
[2024-06-01 13:38:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:38:48] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2024-06-01 13:38:48] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 13:38:48] [INFO ] Invariant cache hit.
[2024-06-01 13:38:48] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 11075ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 11076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11447 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8947 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1836 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1275044 steps, run visited all 1 properties in 1711 ms. (steps per millisecond=745 )
Probabilistic random walk after 1275044 steps, saw 535802 distinct states, run finished after 1711 ms. (steps per millisecond=745 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22464 reset in 149 ms.
Product exploration explored 100000 steps with 22416 reset in 160 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 13:39:01] [INFO ] Invariant cache hit.
[2024-06-01 13:39:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-01 13:39:01] [INFO ] Invariant cache hit.
[2024-06-01 13:39:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:39:02] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-01 13:39:02] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 13:39:02] [INFO ] Invariant cache hit.
[2024-06-01 13:39:02] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 4057 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6798 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 10980ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 10981ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11389 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-02 finished in 43011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 145 transition count 201
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 145 transition count 201
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 145 transition count 196
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 55 place count 131 transition count 180
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 131 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 75 place count 131 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 122 transition count 160
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 122 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 100 place count 122 transition count 153
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 104 place count 118 transition count 149
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 118 transition count 149
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 114 transition count 144
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 111 transition count 141
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 108 transition count 134
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 108 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 132 place count 106 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 134 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 105 transition count 131
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 105 transition count 131
Applied a total of 136 rules in 16 ms. Remains 105 /163 variables (removed 58) and now considering 131/342 (removed 211) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-06-01 13:39:13] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:39:13] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 13:39:13] [INFO ] Invariant cache hit.
[2024-06-01 13:39:13] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 13:39:13] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 13:39:13] [INFO ] Invariant cache hit.
[2024-06-01 13:39:13] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 5 (OVERLAPS) 131/236 variables, 105/109 constraints. Problems are: Problem set: 3 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 58/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 167 constraints, problems are : Problem set: 3 solved, 127 unsolved in 4404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 2/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 131/235 variables, 104/108 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 58/166 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 17/183 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 1/236 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 110/294 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (OVERLAPS) 0/236 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 294 constraints, problems are : Problem set: 3 solved, 127 unsolved in 9937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 105/105 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 127/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 14485ms problems are : Problem set: 3 solved, 127 unsolved
Search for dead transitions found 3 dead transitions in 14488ms
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 : 105/163 places, 128/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 102 transition count 128
Applied a total of 3 rules in 3 ms. Remains 102 /105 variables (removed 3) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 102 cols
[2024-06-01 13:39:28] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:39:28] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 13:39:28] [INFO ] Invariant cache hit.
[2024-06-01 13:39:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 13:39:28] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/163 places, 128/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15285 ms. Remains : 102/163 places, 128/342 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
Product exploration explored 100000 steps with 22435 reset in 280 ms.
Product exploration explored 100000 steps with 22436 reset in 277 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 334 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 128 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8944 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1937 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1836 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2119213 steps, run timeout after 3001 ms. (steps per millisecond=706 ) properties seen :1 out of 2
Probabilistic random walk after 2119213 steps, saw 878709 distinct states, run finished after 3003 ms. (steps per millisecond=705 ) properties seen :1
[2024-06-01 13:39:32] [INFO ] Invariant cache hit.
[2024-06-01 13:39:32] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:39:32] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/187 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/230 variables, 26/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/187 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/230 variables, 26/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 423ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 275 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 128/128 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 100 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 99 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 121
Applied a total of 10 rules in 10 ms. Remains 98 /102 variables (removed 4) and now considering 121/128 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 98/102 places, 121/128 transitions.
RANDOM walk for 40000 steps (8964 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1794 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2203141 steps, run timeout after 3001 ms. (steps per millisecond=734 ) properties seen :0 out of 1
Probabilistic random walk after 2203141 steps, saw 925422 distinct states, run finished after 3001 ms. (steps per millisecond=734 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:39:36] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 13:39:36] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 394 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:39:37] [INFO ] Invariant cache hit.
[2024-06-01 13:39:37] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 13:39:37] [INFO ] Invariant cache hit.
[2024-06-01 13:39:37] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:39:37] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-06-01 13:39:37] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:39:37] [INFO ] Invariant cache hit.
[2024-06-01 13:39:37] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 10110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 15586ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16169 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 25 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-06-01 13:39:53] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:39:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:39:53] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:39:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:39:53] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:39:53] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:39:53] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 267 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 16 factoid took 188 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 128/128 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 102 cols
[2024-06-01 13:39:54] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:39:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 13:39:54] [INFO ] Invariant cache hit.
[2024-06-01 13:39:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 13:39:54] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-06-01 13:39:54] [INFO ] Invariant cache hit.
[2024-06-01 13:39:54] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/230 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 163 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5451 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/230 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 127/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 0 solved, 127 unsolved in 11821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 17562ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 17564ms
Finished structural reductions in LTL mode , in 1 iterations and 18176 ms. Remains : 102/102 places, 128/128 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 334 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8967 resets) in 260 ms. (153 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1942 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1883 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1957997 steps, run timeout after 3001 ms. (steps per millisecond=652 ) properties seen :1 out of 2
Probabilistic random walk after 1957997 steps, saw 815012 distinct states, run finished after 3001 ms. (steps per millisecond=652 ) properties seen :1
[2024-06-01 13:40:15] [INFO ] Invariant cache hit.
[2024-06-01 13:40:16] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 13:40:16] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/187 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/230 variables, 26/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/72 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/76 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/187 variables, 76/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 43/230 variables, 26/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/230 variables, 17/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/230 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 516ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 281 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 128/128 transitions.
Graph (complete) has 299 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 101 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 100 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 99 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 99 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 121
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 121
Applied a total of 10 rules in 16 ms. Remains 98 /102 variables (removed 4) and now considering 121/128 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 98/102 places, 121/128 transitions.
RANDOM walk for 40000 steps (8967 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1740842 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :0 out of 1
Probabilistic random walk after 1740842 steps, saw 734617 distinct states, run finished after 3003 ms. (steps per millisecond=579 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:40:19] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 13:40:19] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 540ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 363 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 11 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:40:20] [INFO ] Invariant cache hit.
[2024-06-01 13:40:20] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 13:40:20] [INFO ] Invariant cache hit.
[2024-06-01 13:40:21] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:40:21] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-06-01 13:40:21] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:40:21] [INFO ] Invariant cache hit.
[2024-06-01 13:40:21] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9219 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 14690ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15262 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 18 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-06-01 13:40:36] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:40:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:40:36] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:40:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 13:40:36] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:40:36] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:40:36] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 285 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22403 reset in 216 ms.
Product exploration explored 100000 steps with 22458 reset in 245 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 128/128 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 13:40:38] [INFO ] Redundant transitions in 1 ms returned []
Running 127 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 102 cols
[2024-06-01 13:40:38] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:40:38] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/230 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 163 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/230 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 127/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 0 solved, 127 unsolved in 8812 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 14167ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 14170ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14192 ms. Remains : 102/102 places, 128/128 transitions.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 128/128 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 128/128 (removed 0) transitions.
[2024-06-01 13:40:52] [INFO ] Invariant cache hit.
[2024-06-01 13:40:52] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 13:40:52] [INFO ] Invariant cache hit.
[2024-06-01 13:40:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 13:40:52] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 127 sub problems to find dead transitions.
[2024-06-01 13:40:52] [INFO ] Invariant cache hit.
[2024-06-01 13:40:52] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/230 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 127 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 0/230 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 163 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5539 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 128/230 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 57/163 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 127/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 0 solved, 127 unsolved in 10796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints]
After SMT, in 16487ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 16488ms
Finished structural reductions in LTL mode , in 1 iterations and 16863 ms. Remains : 102/102 places, 128/128 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 finished in 115939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 130 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 130 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 130 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 121 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 121 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 121 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 116 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 116 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 111 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 126
Applied a total of 143 rules in 32 ms. Remains 102 /163 variables (removed 61) and now considering 126/342 (removed 216) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-06-01 13:41:09] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 13:41:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 13:41:09] [INFO ] Invariant cache hit.
[2024-06-01 13:41:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:41:09] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-06-01 13:41:09] [INFO ] Redundant transitions in 0 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 13:41:09] [INFO ] Invariant cache hit.
[2024-06-01 13:41:09] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 5404 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 11563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 17170ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 17173ms
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_LTL mode, iteration 1 : 102/163 places, 123/342 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:41:26] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-06-01 13:41:27] [INFO ] Invariant cache hit.
[2024-06-01 13:41:27] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 123/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18072 ms. Remains : 99/163 places, 123/342 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-04
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-04 finished in 18146 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 130 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 130 transition count 177
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 79 place count 130 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 88 place count 121 transition count 156
Iterating global reduction 2 with 9 rules applied. Total rules applied 97 place count 121 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 121 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 116 transition count 144
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 116 transition count 144
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 111 transition count 138
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 111 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 127 place count 108 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 130 place count 108 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 108 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 105 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 105 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 103 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 103 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 102 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 102 transition count 125
Applied a total of 144 rules in 52 ms. Remains 102 /163 variables (removed 61) and now considering 125/342 (removed 217) transitions.
// Phase 1: matrix 125 rows 102 cols
[2024-06-01 13:41:27] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 13:41:27] [INFO ] Invariant cache hit.
[2024-06-01 13:41:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:41:27] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-01 13:41:27] [INFO ] Redundant transitions in 1 ms returned []
Running 124 sub problems to find dead transitions.
[2024-06-01 13:41:27] [INFO ] Invariant cache hit.
[2024-06-01 13:41:27] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 5 (OVERLAPS) 125/227 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 162 constraints, problems are : Problem set: 3 solved, 121 unsolved in 6333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 125/226 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 11 (OVERLAPS) 1/227 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 104/283 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 121 unsolved
At refinement iteration 14 (OVERLAPS) 0/227 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 283 constraints, problems are : Problem set: 3 solved, 121 unsolved in 11805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 121/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 18348ms problems are : Problem set: 3 solved, 121 unsolved
Search for dead transitions found 3 dead transitions in 18352ms
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_LTL mode, iteration 1 : 102/163 places, 122/342 transitions.
Graph (complete) has 324 edges and 102 vertex of which 99 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 5 ms. Remains 99 /102 variables (removed 3) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 99 cols
[2024-06-01 13:41:46] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:41:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 13:41:46] [INFO ] Invariant cache hit.
[2024-06-01 13:41:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:41:46] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 122/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19362 ms. Remains : 99/163 places, 122/342 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
Product exploration explored 100000 steps with 22390 reset in 223 ms.
Product exploration explored 100000 steps with 22531 reset in 264 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 322 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8871 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1856 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2048821 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :0 out of 1
Probabilistic random walk after 2048821 steps, saw 879008 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
[2024-06-01 13:41:50] [INFO ] Invariant cache hit.
[2024-06-01 13:41:50] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/178 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/221 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/178 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/221 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/221 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 122/122 transitions.
Graph (complete) has 288 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 120
Applied a total of 3 rules in 6 ms. Remains 98 /99 variables (removed 1) and now considering 120/122 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/99 places, 120/122 transitions.
RANDOM walk for 40000 steps (8904 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1938699 steps, run timeout after 3001 ms. (steps per millisecond=646 ) properties seen :0 out of 1
Probabilistic random walk after 1938699 steps, saw 833306 distinct states, run finished after 3003 ms. (steps per millisecond=645 ) properties seen :0
// Phase 1: matrix 120 rows 98 cols
[2024-06-01 13:41:54] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:41:54] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/212 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/218 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/212 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/218 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 346 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 120/120 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 13:41:54] [INFO ] Invariant cache hit.
[2024-06-01 13:41:54] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 13:41:54] [INFO ] Invariant cache hit.
[2024-06-01 13:41:55] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:41:55] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2024-06-01 13:41:55] [INFO ] Redundant transitions in 0 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 13:41:55] [INFO ] Invariant cache hit.
[2024-06-01 13:41:55] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/218 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/218 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 119/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 273 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 13907ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14497 ms. Remains : 98/98 places, 120/120 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 7 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 98
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 101
Applied a total of 57 rules in 15 ms. Remains 70 /98 variables (removed 28) and now considering 101/120 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2024-06-01 13:42:09] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:42:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:42:09] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:42:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:42:09] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:42:09] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:42:09] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 367 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 99 cols
[2024-06-01 13:42:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:42:10] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 13:42:10] [INFO ] Invariant cache hit.
[2024-06-01 13:42:10] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:42:10] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-06-01 13:42:10] [INFO ] Redundant transitions in 1 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 13:42:10] [INFO ] Invariant cache hit.
[2024-06-01 13:42:10] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/221 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 158 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4542 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/221 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 121/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 279 constraints, problems are : Problem set: 0 solved, 121 unsolved in 10641 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 15380ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 15384ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15992 ms. Remains : 99/99 places, 122/122 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 322 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8954 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1855 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2041950 steps, run timeout after 3001 ms. (steps per millisecond=680 ) properties seen :0 out of 1
Probabilistic random walk after 2041950 steps, saw 876258 distinct states, run finished after 3001 ms. (steps per millisecond=680 ) properties seen :0
[2024-06-01 13:42:29] [INFO ] Invariant cache hit.
[2024-06-01 13:42:29] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/178 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/221 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/178 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/178 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/221 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/221 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 563ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 122/122 transitions.
Graph (complete) has 288 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 120
Applied a total of 3 rules in 7 ms. Remains 98 /99 variables (removed 1) and now considering 120/122 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/99 places, 120/122 transitions.
RANDOM walk for 40000 steps (8997 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1916 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1865885 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :0 out of 1
Probabilistic random walk after 1865885 steps, saw 803695 distinct states, run finished after 3005 ms. (steps per millisecond=620 ) properties seen :0
// Phase 1: matrix 120 rows 98 cols
[2024-06-01 13:42:32] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:42:32] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/212 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/218 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/212 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/218 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 260 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 120/120 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-06-01 13:42:33] [INFO ] Invariant cache hit.
[2024-06-01 13:42:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 13:42:33] [INFO ] Invariant cache hit.
[2024-06-01 13:42:33] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:42:34] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-06-01 13:42:34] [INFO ] Redundant transitions in 0 ms returned []
Running 119 sub problems to find dead transitions.
[2024-06-01 13:42:34] [INFO ] Invariant cache hit.
[2024-06-01 13:42:34] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/218 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 154 constraints, problems are : Problem set: 0 solved, 119 unsolved in 5150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 120/218 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 119/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 273 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8607 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 13915ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13918ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14348 ms. Remains : 98/98 places, 120/120 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 7 place count 98 transition count 113
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 113
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 98
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 101
Applied a total of 57 rules in 12 ms. Remains 70 /98 variables (removed 28) and now considering 101/120 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 70 cols
[2024-06-01 13:42:47] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:42:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:42:48] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:42:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:42:48] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:42:48] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:42:48] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 318 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22477 reset in 245 ms.
Product exploration explored 100000 steps with 22341 reset in 239 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 122/122 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 99 cols
[2024-06-01 13:42:49] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:42:49] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 13:42:49] [INFO ] Invariant cache hit.
[2024-06-01 13:42:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:42:49] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2024-06-01 13:42:49] [INFO ] Redundant transitions in 0 ms returned []
Running 121 sub problems to find dead transitions.
[2024-06-01 13:42:49] [INFO ] Invariant cache hit.
[2024-06-01 13:42:49] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/221 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 158 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5100 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/221 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 121/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/221 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/221 variables, and 279 constraints, problems are : Problem set: 0 solved, 121 unsolved in 7014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 12329ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12910 ms. Remains : 99/99 places, 122/122 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 finished in 94586 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 143 transition count 185
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 143 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 143 transition count 179
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 61 place count 128 transition count 162
Iterating global reduction 1 with 15 rules applied. Total rules applied 76 place count 128 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 83 place count 128 transition count 155
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 93 place count 118 transition count 139
Iterating global reduction 2 with 10 rules applied. Total rules applied 103 place count 118 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 110 place count 118 transition count 132
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 113 transition count 127
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 113 transition count 127
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 125 place count 108 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 130 place count 108 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 134 place count 104 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 138 place count 104 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 140 place count 104 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 143 place count 101 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 146 place count 101 transition count 112
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 147 place count 100 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 148 place count 100 transition count 111
Applied a total of 148 rules in 21 ms. Remains 100 /163 variables (removed 63) and now considering 111/342 (removed 231) transitions.
// Phase 1: matrix 111 rows 100 cols
[2024-06-01 13:43:01] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 13:43:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 13:43:02] [INFO ] Invariant cache hit.
[2024-06-01 13:43:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:43:02] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-01 13:43:02] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-01 13:43:02] [INFO ] Invariant cache hit.
[2024-06-01 13:43:02] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 1/100 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 110 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD99 is UNSAT
At refinement iteration 5 (OVERLAPS) 111/211 variables, 100/104 constraints. Problems are: Problem set: 3 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 42/146 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/146 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/211 variables, 0/146 constraints. Problems are: Problem set: 3 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 146 constraints, problems are : Problem set: 3 solved, 107 unsolved in 3612 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 1/97 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 2/99 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 111/210 variables, 99/103 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/210 variables, 42/145 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 17/162 constraints. Problems are: Problem set: 3 solved, 107 unsolved
[2024-06-01 13:43:08] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/210 variables, 1/163 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 1/211 variables, 1/164 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 90/254 constraints. Problems are: Problem set: 3 solved, 107 unsolved
[2024-06-01 13:43: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/211 variables, 1/255 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/211 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 107 unsolved
At refinement iteration 16 (OVERLAPS) 0/211 variables, 0/255 constraints. Problems are: Problem set: 3 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 255 constraints, problems are : Problem set: 3 solved, 107 unsolved in 11456 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 100/100 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 107/110 constraints, Known Traps: 2/2 constraints]
After SMT, in 15244ms problems are : Problem set: 3 solved, 107 unsolved
Search for dead transitions found 3 dead transitions in 15250ms
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_LTL mode, iteration 1 : 100/163 places, 108/342 transitions.
Graph (complete) has 308 edges and 100 vertex of which 97 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 97 /100 variables (removed 3) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 97 cols
[2024-06-01 13:43:17] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:43:17] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 13:43:17] [INFO ] Invariant cache hit.
[2024-06-01 13:43:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:43:18] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 97/163 places, 108/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16056 ms. Remains : 97/163 places, 108/342 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-06
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-06 finished in 16143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 130 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 130 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 130 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 121 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 121 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 121 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 116 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 116 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 111 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 126
Applied a total of 143 rules in 21 ms. Remains 102 /163 variables (removed 61) and now considering 126/342 (removed 216) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-06-01 13:43:18] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:43:18] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 13:43:18] [INFO ] Invariant cache hit.
[2024-06-01 13:43:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:43:18] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 13:43:18] [INFO ] Redundant transitions in 1 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 13:43:18] [INFO ] Invariant cache hit.
[2024-06-01 13:43:18] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 4507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 10960 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 15666ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 15669ms
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_LTL mode, iteration 1 : 102/163 places, 123/342 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 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 5 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:43:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:43:34] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 13:43:34] [INFO ] Invariant cache hit.
[2024-06-01 13:43:34] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:43:34] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 123/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16444 ms. Remains : 99/163 places, 123/342 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-07 finished in 16525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 187
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 181
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 129 transition count 164
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 129 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 129 transition count 157
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 119 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 119 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 119 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 113 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 113 transition count 128
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 107 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 107 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 103 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 103 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 103 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 99 transition count 109
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 99 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 97 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 96 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 96 transition count 106
Applied a total of 156 rules in 20 ms. Remains 96 /163 variables (removed 67) and now considering 106/342 (removed 236) transitions.
// Phase 1: matrix 106 rows 96 cols
[2024-06-01 13:43:34] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:43:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 13:43:34] [INFO ] Invariant cache hit.
[2024-06-01 13:43:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:43:35] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 13:43:35] [INFO ] Invariant cache hit.
[2024-06-01 13:43:35] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 3 solved, 102 unsolved in 3185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 42/141 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/202 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 86/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 244 constraints, problems are : Problem set: 3 solved, 102 unsolved in 8955 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 12236ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 12238ms
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 : 96/163 places, 103/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 93 transition count 103
Applied a total of 3 rules in 2 ms. Remains 93 /96 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-06-01 13:43:47] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:43:47] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 13:43:47] [INFO ] Invariant cache hit.
[2024-06-01 13:43:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:43:47] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/163 places, 103/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12959 ms. Remains : 93/163 places, 103/342 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
Product exploration explored 100000 steps with 22444 reset in 208 ms.
Product exploration explored 100000 steps with 22352 reset in 239 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 293 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8880 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1828 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 6 ms. (steps per millisecond=275 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 7 ms. (steps per millisecond=236 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:43:49] [INFO ] Invariant cache hit.
[2024-06-01 13:43:49] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 13:43:49] [INFO ] Invariant cache hit.
[2024-06-01 13:43:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:43:49] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 13:43:49] [INFO ] Invariant cache hit.
[2024-06-01 13:43:49] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 102/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 240 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7480 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 11747ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11750ms
Finished structural reductions in LTL mode , in 1 iterations and 12279 ms. Remains : 93/93 places, 103/103 transitions.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 293 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9004 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1880 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 6 ms. (steps per millisecond=275 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 6 ms. (steps per millisecond=275 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22531 reset in 201 ms.
Product exploration explored 100000 steps with 22475 reset in 224 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:44:03] [INFO ] Redundant transitions in 1 ms returned []
Running 102 sub problems to find dead transitions.
[2024-06-01 13:44:03] [INFO ] Invariant cache hit.
[2024-06-01 13:44:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 102 unsolved in 3564 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 102/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 240 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 10115ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 10118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10133 ms. Remains : 93/93 places, 103/103 transitions.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:44:13] [INFO ] Invariant cache hit.
[2024-06-01 13:44:13] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 13:44:13] [INFO ] Invariant cache hit.
[2024-06-01 13:44:13] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:44:13] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 13:44:13] [INFO ] Invariant cache hit.
[2024-06-01 13:44:13] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4208 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 102/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 240 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6863 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 11214ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11217ms
Finished structural reductions in LTL mode , in 1 iterations and 11744 ms. Remains : 93/93 places, 103/103 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 finished in 50434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1)||G(p2))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 146 transition count 202
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 146 transition count 202
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 146 transition count 197
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 134 transition count 184
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 134 transition count 184
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 69 place count 134 transition count 178
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 127 transition count 166
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 127 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 127 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 124 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 124 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 121 transition count 153
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 121 transition count 153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 119 transition count 151
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 119 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 119 transition count 149
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 117 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 117 transition count 147
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 116 transition count 146
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 116 transition count 146
Applied a total of 113 rules in 16 ms. Remains 116 /163 variables (removed 47) and now considering 146/342 (removed 196) transitions.
// Phase 1: matrix 146 rows 116 cols
[2024-06-01 13:44:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:44:25] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 13:44:25] [INFO ] Invariant cache hit.
[2024-06-01 13:44:25] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 13:44:25] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-01 13:44:25] [INFO ] Invariant cache hit.
[2024-06-01 13:44:25] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 5 (OVERLAPS) 146/262 variables, 116/120 constraints. Problems are: Problem set: 3 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 65/185 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 185 constraints, problems are : Problem set: 3 solved, 142 unsolved in 7931 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 2/115 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 146/261 variables, 115/119 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 65/184 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 19/203 constraints. Problems are: Problem set: 3 solved, 142 unsolved
[2024-06-01 13:44:37] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 1/204 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 1/262 variables, 1/205 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/262 variables, 123/328 constraints. Problems are: Problem set: 3 solved, 142 unsolved
[2024-06-01 13:44:43] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/262 variables, 1/329 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/262 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 142 unsolved
At refinement iteration 16 (OVERLAPS) 0/262 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 329 constraints, problems are : Problem set: 3 solved, 142 unsolved in 20647 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 142/145 constraints, Known Traps: 2/2 constraints]
After SMT, in 28850ms problems are : Problem set: 3 solved, 142 unsolved
Search for dead transitions found 3 dead transitions in 28853ms
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 : 116/163 places, 143/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 143
Applied a total of 3 rules in 1 ms. Remains 113 /116 variables (removed 3) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 113 cols
[2024-06-01 13:44:54] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:44:54] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 13:44:54] [INFO ] Invariant cache hit.
[2024-06-01 13:44:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-01 13:44:55] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 533 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 113/163 places, 143/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30065 ms. Remains : 113/163 places, 143/342 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-09
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-09 finished in 30189 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F((p2&&X(!p3)))&&p1))&&p0)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 146 transition count 227
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 146 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 146 transition count 221
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 134 transition count 207
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 134 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 70 place count 134 transition count 201
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 78 place count 126 transition count 189
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 126 transition count 189
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 94 place count 126 transition count 181
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 98 place count 122 transition count 177
Iterating global reduction 3 with 4 rules applied. Total rules applied 102 place count 122 transition count 177
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 106 place count 118 transition count 172
Iterating global reduction 3 with 4 rules applied. Total rules applied 110 place count 118 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 112 place count 116 transition count 170
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 116 transition count 170
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 116 place count 114 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 114 transition count 166
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 112 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 112 transition count 164
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 111 transition count 163
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 111 transition count 163
Applied a total of 124 rules in 23 ms. Remains 111 /163 variables (removed 52) and now considering 163/342 (removed 179) transitions.
// Phase 1: matrix 163 rows 111 cols
[2024-06-01 13:44:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:44:55] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 13:44:55] [INFO ] Invariant cache hit.
[2024-06-01 13:44:55] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-06-01 13:44:56] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
Running 162 sub problems to find dead transitions.
[2024-06-01 13:44:56] [INFO ] Invariant cache hit.
[2024-06-01 13:44:56] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD146 is UNSAT
At refinement iteration 5 (OVERLAPS) 163/274 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 159 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 87/202 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 202 constraints, problems are : Problem set: 3 solved, 159 unsolved in 8369 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 2/110 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 163/273 variables, 110/114 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 87/201 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 19/220 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 1/274 variables, 1/221 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 140/361 constraints. Problems are: Problem set: 3 solved, 159 unsolved
[2024-06-01 13:45:14] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 1/362 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 0/362 constraints. Problems are: Problem set: 3 solved, 159 unsolved
At refinement iteration 15 (OVERLAPS) 0/274 variables, 0/362 constraints. Problems are: Problem set: 3 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 362 constraints, problems are : Problem set: 3 solved, 159 unsolved in 24935 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 159/162 constraints, Known Traps: 1/1 constraints]
After SMT, in 33606ms problems are : Problem set: 3 solved, 159 unsolved
Search for dead transitions found 3 dead transitions in 33609ms
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 : 111/163 places, 160/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 108 transition count 160
Applied a total of 3 rules in 1 ms. Remains 108 /111 variables (removed 3) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 108 cols
[2024-06-01 13:45:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:45:29] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-06-01 13:45:29] [INFO ] Invariant cache hit.
[2024-06-01 13:45:29] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-01 13:45:30] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 108/163 places, 160/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35005 ms. Remains : 108/163 places, 160/342 transitions.
Stuttering acceptance computed with spot in 298 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) (NOT p1) p3), (OR (NOT p2) (NOT p0) (NOT p1) p3), (OR (NOT p2) (NOT p1) (NOT p0) p3), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-10 finished in 35330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X((X(p0)||(G(p2)&&p1))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 146 transition count 215
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 146 transition count 215
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 41 place count 146 transition count 208
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 134 transition count 194
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 134 transition count 194
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 134 transition count 189
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 127 transition count 178
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 127 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 127 transition count 174
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 123 transition count 170
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 123 transition count 170
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 119 transition count 165
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 119 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 117 transition count 163
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 117 transition count 163
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 115 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 115 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 113 transition count 157
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 113 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 112 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 112 transition count 156
Applied a total of 118 rules in 16 ms. Remains 112 /163 variables (removed 51) and now considering 156/342 (removed 186) transitions.
// Phase 1: matrix 156 rows 112 cols
[2024-06-01 13:45:30] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 13:45:30] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 13:45:30] [INFO ] Invariant cache hit.
[2024-06-01 13:45:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-06-01 13:45:31] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-06-01 13:45:31] [INFO ] Invariant cache hit.
[2024-06-01 13:45:31] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 5 (OVERLAPS) 156/268 variables, 112/116 constraints. Problems are: Problem set: 3 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 78/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 194 constraints, problems are : Problem set: 3 solved, 152 unsolved in 8300 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 1/109 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 156/267 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 78/193 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 18/211 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 1/268 variables, 1/212 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/268 variables, 134/346 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/346 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 14 (OVERLAPS) 0/268 variables, 0/346 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 346 constraints, problems are : Problem set: 3 solved, 152 unsolved in 19474 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 112/112 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 0/0 constraints]
After SMT, in 28070ms problems are : Problem set: 3 solved, 152 unsolved
Search for dead transitions found 3 dead transitions in 28073ms
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 : 112/163 places, 153/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 109 transition count 153
Applied a total of 3 rules in 1 ms. Remains 109 /112 variables (removed 3) and now considering 153/153 (removed 0) transitions.
// Phase 1: matrix 153 rows 109 cols
[2024-06-01 13:45:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:45:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 13:45:59] [INFO ] Invariant cache hit.
[2024-06-01 13:45:59] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-06-01 13:46:00] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/163 places, 153/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29531 ms. Remains : 109/163 places, 153/342 transitions.
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-11 finished in 29914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 199
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 199
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 130 transition count 177
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 130 transition count 177
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 130 transition count 171
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 87 place count 121 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 96 place count 121 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 103 place count 121 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 108 place count 116 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 113 place count 116 transition count 145
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 118 place count 111 transition count 139
Iterating global reduction 3 with 5 rules applied. Total rules applied 123 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 126 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 129 place count 108 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 108 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 105 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 105 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 139 place count 103 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 103 transition count 127
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 102 transition count 126
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 102 transition count 126
Applied a total of 143 rules in 29 ms. Remains 102 /163 variables (removed 61) and now considering 126/342 (removed 216) transitions.
// Phase 1: matrix 126 rows 102 cols
[2024-06-01 13:46:00] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 13:46:00] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 13:46:00] [INFO ] Invariant cache hit.
[2024-06-01 13:46:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 13:46:01] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-06-01 13:46:01] [INFO ] Redundant transitions in 1 ms returned []
Running 125 sub problems to find dead transitions.
[2024-06-01 13:46:01] [INFO ] Invariant cache hit.
[2024-06-01 13:46:01] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 126/228 variables, 102/106 constraints. Problems are: Problem set: 3 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 56/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/162 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 162 constraints, problems are : Problem set: 3 solved, 122 unsolved in 5163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 2/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 126/227 variables, 101/105 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 56/161 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 17/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 11 (OVERLAPS) 1/228 variables, 1/179 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 105/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 284 constraints, problems are : Problem set: 3 solved, 122 unsolved in 11575 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 122/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 16865ms problems are : Problem set: 3 solved, 122 unsolved
Search for dead transitions found 3 dead transitions in 16867ms
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_LTL mode, iteration 1 : 102/163 places, 123/342 transitions.
Graph (complete) has 325 edges and 102 vertex of which 99 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 6 ms. Remains 99 /102 variables (removed 3) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:46:17] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:46:18] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 13:46:18] [INFO ] Invariant cache hit.
[2024-06-01 13:46:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:46:18] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/163 places, 123/342 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17929 ms. Remains : 99/163 places, 123/342 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
Product exploration explored 100000 steps with 22393 reset in 348 ms.
Product exploration explored 100000 steps with 22479 reset in 390 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[p0]
RANDOM walk for 40000 steps (8976 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1855 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1979002 steps, run timeout after 3001 ms. (steps per millisecond=659 ) properties seen :0 out of 1
Probabilistic random walk after 1979002 steps, saw 831793 distinct states, run finished after 3001 ms. (steps per millisecond=659 ) properties seen :0
[2024-06-01 13:46:22] [INFO ] Invariant cache hit.
[2024-06-01 13:46:22] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 369ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Graph (complete) has 289 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 121
Applied a total of 3 rules in 5 ms. Remains 98 /99 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/99 places, 121/123 transitions.
RANDOM walk for 40000 steps (8995 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1924 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2096425 steps, run timeout after 3001 ms. (steps per millisecond=698 ) properties seen :0 out of 1
Probabilistic random walk after 2096425 steps, saw 879265 distinct states, run finished after 3001 ms. (steps per millisecond=698 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:46:25] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:46:25] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 408 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:46:26] [INFO ] Invariant cache hit.
[2024-06-01 13:46:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-01 13:46:26] [INFO ] Invariant cache hit.
[2024-06-01 13:46:26] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:46:27] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2024-06-01 13:46:27] [INFO ] Redundant transitions in 0 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:46:27] [INFO ] Invariant cache hit.
[2024-06-01 13:46:27] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 5141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 8210 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 13570ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 13572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14190 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 9 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-06-01 13:46:40] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:46:40] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:46:41] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:46:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 13:46:41] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:46:41] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:46:41] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 270 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Stuttering acceptance computed with spot in 39 ms :[p0]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:46:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:46:41] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 13:46:41] [INFO ] Invariant cache hit.
[2024-06-01 13:46:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:46:41] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-06-01 13:46:41] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 13:46:41] [INFO ] Invariant cache hit.
[2024-06-01 13:46:41] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5431 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 14359ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 14361ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14779 ms. Remains : 99/99 places, 123/123 transitions.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 323 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 22 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[p0]
RANDOM walk for 40000 steps (8975 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1880 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2072780 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2072780 steps, saw 869941 distinct states, run finished after 3001 ms. (steps per millisecond=690 ) properties seen :0
[2024-06-01 13:46:59] [INFO ] Invariant cache hit.
[2024-06-01 13:46:59] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/69 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/73 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 106/179 variables, 73/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 43/222 variables, 26/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/222 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 420ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 123/123 transitions.
Graph (complete) has 289 edges and 99 vertex of which 98 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 98 transition count 121
Applied a total of 3 rules in 6 ms. Remains 98 /99 variables (removed 1) and now considering 121/123 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 98/99 places, 121/123 transitions.
RANDOM walk for 40000 steps (9031 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1942 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2107590 steps, run timeout after 3001 ms. (steps per millisecond=702 ) properties seen :0 out of 1
Probabilistic random walk after 2107590 steps, saw 883524 distinct states, run finished after 3001 ms. (steps per millisecond=702 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 13:47:02] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:47:02] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/219 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 6/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 131/213 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/213 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 41/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/219 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 313 ms.
Support contains 2 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 121/121 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 121/121 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 13:47:03] [INFO ] Invariant cache hit.
[2024-06-01 13:47:03] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 13:47:03] [INFO ] Invariant cache hit.
[2024-06-01 13:47:03] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 13:47:04] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-06-01 13:47:04] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 13:47:04] [INFO ] Invariant cache hit.
[2024-06-01 13:47:04] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 154 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4761 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 121/219 variables, 98/101 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 53/154 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 120/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 8 (OVERLAPS) 0/219 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 274 constraints, problems are : Problem set: 0 solved, 120 unsolved in 9215 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 98/98 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 14172ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14174ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14773 ms. Remains : 98/98 places, 121/121 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 rules applied. Total rules applied 7 place count 98 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 92 transition count 114
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 13 place count 92 transition count 99
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 43 place count 77 transition count 99
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 55 place count 71 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 70 transition count 102
Applied a total of 57 rules in 8 ms. Remains 70 /98 variables (removed 28) and now considering 102/121 (removed 19) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 102 rows 70 cols
[2024-06-01 13:47:18] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 13:47:18] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 13:47:18] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 13:47:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 13:47:18] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 13:47:18] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 13:47:18] [INFO ] After 191ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 333 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 46 ms :[p0]
Product exploration explored 100000 steps with 22478 reset in 232 ms.
Product exploration explored 100000 steps with 22428 reset in 245 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 13:47:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:47:19] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 13:47:19] [INFO ] Invariant cache hit.
[2024-06-01 13:47:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 13:47:20] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-06-01 13:47:20] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 13:47:20] [INFO ] Invariant cache hit.
[2024-06-01 13:47:20] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 158 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5185 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 123/222 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 122/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/222 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 280 constraints, problems are : Problem set: 0 solved, 122 unsolved in 7330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 99/99 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 12721ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 12723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13324 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 finished in 92398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 187
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 144 transition count 182
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 58 place count 129 transition count 165
Iterating global reduction 1 with 15 rules applied. Total rules applied 73 place count 129 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 80 place count 129 transition count 158
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 119 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 119 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 107 place count 119 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 113 place count 113 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 119 place count 113 transition count 129
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 125 place count 107 transition count 122
Iterating global reduction 3 with 6 rules applied. Total rules applied 131 place count 107 transition count 122
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 103 transition count 118
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 103 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 141 place count 103 transition count 116
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 99 transition count 110
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 99 transition count 110
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 151 place count 97 transition count 108
Iterating global reduction 4 with 2 rules applied. Total rules applied 153 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 154 place count 96 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 155 place count 96 transition count 107
Applied a total of 155 rules in 11 ms. Remains 96 /163 variables (removed 67) and now considering 107/342 (removed 235) transitions.
// Phase 1: matrix 107 rows 96 cols
[2024-06-01 13:47:32] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:47:32] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 13:47:32] [INFO ] Invariant cache hit.
[2024-06-01 13:47:33] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:47:33] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-06-01 13:47:33] [INFO ] Invariant cache hit.
[2024-06-01 13:47:33] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD95 is UNSAT
At refinement iteration 5 (OVERLAPS) 107/203 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 103 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 41/141 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/141 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 141 constraints, problems are : Problem set: 3 solved, 103 unsolved in 4605 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 107/202 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 41/140 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 16/156 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 1/203 variables, 1/157 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 87/244 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/203 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 103 unsolved
At refinement iteration 14 (OVERLAPS) 0/203 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 244 constraints, problems are : Problem set: 3 solved, 103 unsolved in 8904 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 103/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 13669ms problems are : Problem set: 3 solved, 103 unsolved
Search for dead transitions found 3 dead transitions in 13675ms
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 : 96/163 places, 104/342 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 93 transition count 104
Applied a total of 3 rules in 1 ms. Remains 93 /96 variables (removed 3) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 93 cols
[2024-06-01 13:47:47] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 13:47:47] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 13:47:47] [INFO ] Invariant cache hit.
[2024-06-01 13:47:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-01 13:47:47] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 93/163 places, 104/342 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14633 ms. Remains : 93/163 places, 104/342 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-14 finished in 14770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(G(p1))||p0))&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 342/342 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 144 transition count 187
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 144 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 144 transition count 181
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 59 place count 129 transition count 164
Iterating global reduction 1 with 15 rules applied. Total rules applied 74 place count 129 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 129 transition count 157
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 119 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 119 transition count 141
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 108 place count 119 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 113 transition count 128
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 113 transition count 128
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 107 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 107 transition count 121
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 136 place count 103 transition count 117
Iterating global reduction 3 with 4 rules applied. Total rules applied 140 place count 103 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 142 place count 103 transition count 115
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 146 place count 99 transition count 109
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 99 transition count 109
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 152 place count 97 transition count 107
Iterating global reduction 4 with 2 rules applied. Total rules applied 154 place count 97 transition count 107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 96 transition count 106
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 96 transition count 106
Applied a total of 156 rules in 27 ms. Remains 96 /163 variables (removed 67) and now considering 106/342 (removed 236) transitions.
// Phase 1: matrix 106 rows 96 cols
[2024-06-01 13:47:48] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:47:48] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 13:47:48] [INFO ] Invariant cache hit.
[2024-06-01 13:47:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 13:47:49] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 13:47:49] [INFO ] Invariant cache hit.
[2024-06-01 13:47:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 5 (OVERLAPS) 106/202 variables, 96/100 constraints. Problems are: Problem set: 3 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 42/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/142 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 142 constraints, problems are : Problem set: 3 solved, 102 unsolved in 4547 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 2/95 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 106/201 variables, 95/99 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 42/141 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 16/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/157 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 1/202 variables, 1/158 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 86/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 244 constraints, problems are : Problem set: 3 solved, 102 unsolved in 10161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 96/96 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 102/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 14857ms problems are : Problem set: 3 solved, 102 unsolved
Search for dead transitions found 3 dead transitions in 14859ms
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 LI_LTL mode, iteration 1 : 96/163 places, 103/342 transitions.
Graph (complete) has 295 edges and 96 vertex of which 93 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 3 ms. Remains 93 /96 variables (removed 3) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-06-01 13:48:04] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 13:48:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 13:48:04] [INFO ] Invariant cache hit.
[2024-06-01 13:48:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:48:04] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 93/163 places, 103/342 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 15770 ms. Remains : 93/163 places, 103/342 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
Product exploration explored 100000 steps with 22435 reset in 199 ms.
Product exploration explored 100000 steps with 22456 reset in 219 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 293 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8998 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1855 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 7 ms. (steps per millisecond=236 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 7 ms. (steps per millisecond=236 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:48:05] [INFO ] Invariant cache hit.
[2024-06-01 13:48:05] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 13:48:05] [INFO ] Invariant cache hit.
[2024-06-01 13:48:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:48:05] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 13:48:05] [INFO ] Invariant cache hit.
[2024-06-01 13:48:05] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 102/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 240 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 11833ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11835ms
Finished structural reductions in LTL mode , in 1 iterations and 12226 ms. Remains : 93/93 places, 103/103 transitions.
Computed a total of 17 stabilizing places and 21 stable transitions
Graph (complete) has 293 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9002 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1875 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1654 steps, run visited all 1 properties in 9 ms. (steps per millisecond=183 )
Probabilistic random walk after 1654 steps, saw 793 distinct states, run finished after 9 ms. (steps per millisecond=183 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22499 reset in 117 ms.
Product exploration explored 100000 steps with 22410 reset in 216 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:48:19] [INFO ] Redundant transitions in 0 ms returned []
Running 102 sub problems to find dead transitions.
[2024-06-01 13:48:19] [INFO ] Invariant cache hit.
[2024-06-01 13:48:19] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 102/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 240 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7770 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 12167ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 12170ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12180 ms. Remains : 93/93 places, 103/103 transitions.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-06-01 13:48:31] [INFO ] Invariant cache hit.
[2024-06-01 13:48:31] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 13:48:31] [INFO ] Invariant cache hit.
[2024-06-01 13:48:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 13:48:32] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2024-06-01 13:48:32] [INFO ] Invariant cache hit.
[2024-06-01 13:48:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 138 constraints, problems are : Problem set: 0 solved, 102 unsolved in 4447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 41/138 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 102/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/196 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 240 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 93/93 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
After SMT, in 11805ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 11808ms
Finished structural reductions in LTL mode , in 1 iterations and 12327 ms. Remains : 93/93 places, 103/103 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 finished in 55658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
[2024-06-01 13:48:44] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:48:44] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 13:48:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 342 transitions and 1354 arcs took 9 ms.
Total runtime 814489 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m36-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717249870815

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name SieveSingleMsgMbox-PT-d2m36-LTLFireability-02
ltl formula formula --ltl=/tmp/2274/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 342 transitions and 1354 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.220 real 0.130 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 164 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 348 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~92 levels ~10000 states ~30752 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~20000 states ~62008 transitions
pnml2lts-mc( 3/ 4): ~135 levels ~40000 states ~123788 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~80000 states ~250480 transitions
pnml2lts-mc( 3/ 4): ~180 levels ~160000 states ~503324 transitions
pnml2lts-mc( 3/ 4): ~223 levels ~320000 states ~1012996 transitions
pnml2lts-mc( 3/ 4): ~267 levels ~640000 states ~2046904 transitions
pnml2lts-mc( 1/ 4): ~325 levels ~1280000 states ~4047588 transitions
pnml2lts-mc( 1/ 4): ~369 levels ~2560000 states ~8129824 transitions
pnml2lts-mc( 1/ 4): ~413 levels ~5120000 states ~16354112 transitions
pnml2lts-mc( 2/ 4): ~444 levels ~10240000 states ~33681540 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20242096
pnml2lts-mc( 0/ 4): unique states count: 20245908
pnml2lts-mc( 0/ 4): unique transitions count: 65011234
pnml2lts-mc( 0/ 4): - self-loop count: 36130452
pnml2lts-mc( 0/ 4): - claim dead count: 8611705
pnml2lts-mc( 0/ 4): - claim found count: 40
pnml2lts-mc( 0/ 4): - claim success count: 20246141
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4097
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20246141 states 65012763 transitions, fanout: 3.211
pnml2lts-mc( 0/ 4): Total exploration time 107.110 sec (107.080 sec minimum, 107.098 sec on average)
pnml2lts-mc( 0/ 4): States per second: 189022, Transitions per second: 606972
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 218.6MB, 11.3 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 60.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 345 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 218.6MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d2m36-LTLFireability-03
ltl formula formula --ltl=/tmp/2274/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 342 transitions and 1354 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 165 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 358 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~92 levels ~10000 states ~30764 transitions
pnml2lts-mc( 3/ 4): ~149 levels ~20000 states ~62360 transitions
pnml2lts-mc( 3/ 4): ~149 levels ~40000 states ~124784 transitions
pnml2lts-mc( 3/ 4): ~193 levels ~80000 states ~251476 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1710!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 113137
pnml2lts-mc( 0/ 4): unique states count: 116724
pnml2lts-mc( 0/ 4): unique transitions count: 374418
pnml2lts-mc( 0/ 4): - self-loop count: 194033
pnml2lts-mc( 0/ 4): - claim dead count: 45936
pnml2lts-mc( 0/ 4): - claim found count: 112
pnml2lts-mc( 0/ 4): - claim success count: 116961
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3680
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 116961 states 375861 transitions, fanout: 3.214
pnml2lts-mc( 0/ 4): Total exploration time 1.080 sec (1.080 sec minimum, 1.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 108297, Transitions per second: 348019
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.5MB, 11.8 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 345 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.5MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d2m36-LTLFireability-05
ltl formula formula --ltl=/tmp/2274/ltl_2_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 342 transitions and 1354 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 164 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 348 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~228 levels ~10000 states ~30920 transitions
pnml2lts-mc( 3/ 4): ~420 levels ~20000 states ~61868 transitions
pnml2lts-mc( 3/ 4): ~809 levels ~40000 states ~123872 transitions
pnml2lts-mc( 3/ 4): ~1567 levels ~80000 states ~247632 transitions
pnml2lts-mc( 1/ 4): ~1425 levels ~160000 states ~499088 transitions
pnml2lts-mc( 1/ 4): ~1425 levels ~320000 states ~985732 transitions
pnml2lts-mc( 1/ 4): ~1425 levels ~640000 states ~1961976 transitions
pnml2lts-mc( 1/ 4): ~1425 levels ~1280000 states ~3925124 transitions
pnml2lts-mc( 1/ 4): ~1425 levels ~2560000 states ~7855416 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~9265!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3162088
pnml2lts-mc( 0/ 4): unique states count: 3176968
pnml2lts-mc( 0/ 4): unique transitions count: 10037006
pnml2lts-mc( 0/ 4): - self-loop count: 5645602
pnml2lts-mc( 0/ 4): - claim dead count: 1133912
pnml2lts-mc( 0/ 4): - claim found count: 6356
pnml2lts-mc( 0/ 4): - claim success count: 3177026
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14360
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3177026 states 10037266 transitions, fanout: 3.159
pnml2lts-mc( 0/ 4): Total exploration time 17.080 sec (17.080 sec minimum, 17.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 186009, Transitions per second: 587662
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 37.1MB, 12.0 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 9.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 345 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 37.1MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d2m36-LTLFireability-08
ltl formula formula --ltl=/tmp/2274/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 342 transitions and 1354 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 165 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 348 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~36!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 157
pnml2lts-mc( 0/ 4): unique states count: 254
pnml2lts-mc( 0/ 4): unique transitions count: 782
pnml2lts-mc( 0/ 4): - self-loop count: 343
pnml2lts-mc( 0/ 4): - claim dead count: 31
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 322
pnml2lts-mc( 0/ 4): - cum. max stack depth: 147
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 322 states 1049 transitions, fanout: 3.258
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 20.2 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 345 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d2m36-LTLFireability-12
ltl formula formula --ltl=/tmp/2274/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 163 places, 342 transitions and 1354 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2274/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2274/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2274/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2274/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 164 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 164, there are 348 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~166 levels ~10000 states ~31012 transitions
pnml2lts-mc( 3/ 4): ~219 levels ~20000 states ~61144 transitions
pnml2lts-mc( 3/ 4): ~276 levels ~40000 states ~121684 transitions
pnml2lts-mc( 3/ 4): ~333 levels ~80000 states ~242532 transitions
pnml2lts-mc( 3/ 4): ~390 levels ~160000 states ~484812 transitions
pnml2lts-mc( 3/ 4): ~447 levels ~320000 states ~969692 transitions
pnml2lts-mc( 3/ 4): ~504 levels ~640000 states ~1941460 transitions
pnml2lts-mc( 3/ 4): ~574 levels ~1280000 states ~3895120 transitions
pnml2lts-mc( 3/ 4): ~675 levels ~2560000 states ~7807000 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~55415!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3197672
pnml2lts-mc( 0/ 4): unique states count: 3259145
pnml2lts-mc( 0/ 4): unique transitions count: 10744658
pnml2lts-mc( 0/ 4): - self-loop count: 5733426
pnml2lts-mc( 0/ 4): - claim dead count: 1380845
pnml2lts-mc( 0/ 4): - claim found count: 25335
pnml2lts-mc( 0/ 4): - claim success count: 3259251
pnml2lts-mc( 0/ 4): - cum. max stack depth: 58390
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3259251 states 10745171 transitions, fanout: 3.297
pnml2lts-mc( 0/ 4): Total exploration time 19.140 sec (19.140 sec minimum, 19.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 170285, Transitions per second: 561399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 39.4MB, 11.7 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/19.0%
pnml2lts-mc( 0/ 4): Stored 345 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 39.4MB (~256.0MB paged-in)

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-d2m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d2m36, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r532-smll-171683810800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m36.tgz
mv SieveSingleMsgMbox-PT-d2m36 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;