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-171683810800140.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-d2m96, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:40 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 14K Apr 12 19:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 12 19:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:38 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-d2m96-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m96-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717250974857

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-d2m96
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:09:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:09:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:09:38] [INFO ] Load time of PNML (sax parser for PT used): 673 ms
[2024-06-01 14:09:38] [INFO ] Transformed 2398 places.
[2024-06-01 14:09:38] [INFO ] Transformed 1954 transitions.
[2024-06-01 14:09:38] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 946 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 36 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 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 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 950 place count 292 transition count 705
Iterating global reduction 1 with 97 rules applied. Total rules applied 1047 place count 292 transition count 705
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1057 place count 292 transition count 695
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 1126 place count 223 transition count 626
Iterating global reduction 2 with 69 rules applied. Total rules applied 1195 place count 223 transition count 626
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 1223 place count 223 transition count 598
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1249 place count 197 transition count 567
Iterating global reduction 3 with 26 rules applied. Total rules applied 1275 place count 197 transition count 567
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 1327 place count 197 transition count 515
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1332 place count 192 transition count 507
Iterating global reduction 4 with 5 rules applied. Total rules applied 1337 place count 192 transition count 507
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1342 place count 187 transition count 502
Iterating global reduction 4 with 5 rules applied. Total rules applied 1347 place count 187 transition count 502
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1349 place count 185 transition count 499
Iterating global reduction 4 with 2 rules applied. Total rules applied 1351 place count 185 transition count 499
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1353 place count 183 transition count 497
Iterating global reduction 4 with 2 rules applied. Total rules applied 1355 place count 183 transition count 497
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1357 place count 181 transition count 495
Iterating global reduction 4 with 2 rules applied. Total rules applied 1359 place count 181 transition count 495
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1360 place count 180 transition count 494
Iterating global reduction 4 with 1 rules applied. Total rules applied 1361 place count 180 transition count 494
Applied a total of 1361 rules in 222 ms. Remains 180 /414 variables (removed 234) and now considering 494/1954 (removed 1460) transitions.
// Phase 1: matrix 494 rows 180 cols
[2024-06-01 14:09:39] [INFO ] Computed 5 invariants in 40 ms
[2024-06-01 14:09:39] [INFO ] Implicit Places using invariants in 439 ms returned []
[2024-06-01 14:09:39] [INFO ] Invariant cache hit.
[2024-06-01 14:09:39] [INFO ] State equation strengthened by 354 read => feed constraints.
[2024-06-01 14:09:41] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-06-01 14:09:41] [INFO ] Invariant cache hit.
[2024-06-01 14:09:41] [INFO ] State equation strengthened by 354 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 1/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 31 ms to minimize.
[2024-06-01 14:09:54] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 494/674 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 354/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 541 constraints, problems are : Problem set: 0 solved, 493 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 493 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/179 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (OVERLAPS) 1/180 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 6 (OVERLAPS) 494/674 variables, 180/187 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/674 variables, 354/541 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/674 variables, 493/1034 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 52 places in 44 ms of which 2 ms to minimize.
[2024-06-01 14:10:36] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 14:10:38] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 2 ms to minimize.
Problem TDEAD61 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 1037 constraints, problems are : Problem set: 2 solved, 491 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 180/180 constraints, ReadFeed: 354/354 constraints, PredecessorRefiner: 493/493 constraints, Known Traps: 5/5 constraints]
After SMT, in 62066ms problems are : Problem set: 2 solved, 491 unsolved
Search for dead transitions found 2 dead transitions in 62116ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 180/414 places, 492/1954 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 178 transition count 492
Applied a total of 2 rules in 9 ms. Remains 178 /180 variables (removed 2) and now considering 492/492 (removed 0) transitions.
// Phase 1: matrix 492 rows 178 cols
[2024-06-01 14:10:43] [INFO ] Computed 4 invariants in 8 ms
[2024-06-01 14:10:43] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-01 14:10:43] [INFO ] Invariant cache hit.
[2024-06-01 14:10:44] [INFO ] State equation strengthened by 353 read => feed constraints.
[2024-06-01 14:10:45] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 178/414 places, 492/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66184 ms. Remains : 178/414 places, 492/1954 transitions.
Support contains 28 out of 178 places after structural reductions.
[2024-06-01 14:10:45] [INFO ] Flatten gal took : 145 ms
[2024-06-01 14:10:45] [INFO ] Flatten gal took : 78 ms
[2024-06-01 14:10:45] [INFO ] Input system was already deterministic with 492 transitions.
RANDOM walk for 40000 steps (8896 resets) in 3242 ms. (12 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (179 resets) in 56 ms. (70 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (178 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (183 resets) in 54 ms. (72 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (191 resets) in 43 ms. (91 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (186 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (408 resets) in 34 ms. (114 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (155 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (210 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (168 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (191 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (198 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (188 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (417 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (184 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (193 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (427 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (173 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (178 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (415 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (190 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (173 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (187 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (199 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (394 resets) in 42 ms. (93 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (178 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (184 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 224700 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :10 out of 26
Probabilistic random walk after 224700 steps, saw 105010 distinct states, run finished after 3007 ms. (steps per millisecond=74 ) properties seen :10
[2024-06-01 14:10:50] [INFO ] Invariant cache hit.
[2024-06-01 14:10:50] [INFO ] State equation strengthened by 353 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 78/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 37/138 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 59 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 363/501 variables, 138/144 constraints. Problems are: Problem set: 1 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 224/368 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 0/368 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 11 (OVERLAPS) 169/670 variables, 40/408 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/670 variables, 129/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/670 variables, 0/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 0/670 variables, 0/537 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 670/670 variables, and 537 constraints, problems are : Problem set: 2 solved, 14 unsolved in 2404 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 78/94 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/98 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 53 places in 52 ms of which 2 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 37/135 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 318/453 variables, 135/143 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 179/322 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/453 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 217/670 variables, 43/367 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/670 variables, 174/541 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/670 variables, 12/553 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/670 variables, 1/554 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/670 variables, 1/555 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/670 variables, and 555 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 353/353 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 6/6 constraints]
After SMT, in 7513ms problems are : Problem set: 2 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 492/492 transitions.
Graph (complete) has 770 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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 177 transition count 490
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 167 transition count 340
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 167 transition count 340
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 157 transition count 330
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 157 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 157 transition count 325
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 153 transition count 317
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 153 transition count 317
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 153 transition count 315
Applied a total of 58 rules in 81 ms. Remains 153 /178 variables (removed 25) and now considering 315/492 (removed 177) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 153/178 places, 315/492 transitions.
RANDOM walk for 40000 steps (8973 resets) in 698 ms. (57 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1936 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1852 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (4152 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1924 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1930 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (4165 resets) in 114 ms. (347 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (4136 resets) in 163 ms. (243 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1877 resets) in 78 ms. (506 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1839 resets) in 81 ms. (487 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1921 resets) in 79 ms. (500 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1893 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (4231 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 213573 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :2 out of 14
Probabilistic random walk after 213573 steps, saw 93833 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :2
// Phase 1: matrix 315 rows 153 cols
[2024-06-01 14:11:01] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 14:11:01] [INFO ] State equation strengthened by 199 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 263/355 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 147/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 113/468 variables, 61/303 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 52/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/468 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 355 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1264 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 153/153 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 74/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/92 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 2 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 14 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 263/355 variables, 92/98 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 147/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 113/468 variables, 61/306 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/468 variables, 52/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 12/370 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 0/468 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 371 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4779 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 153/153 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 6101ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 31210 ms.
Support contains 14 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 315/315 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 151 transition count 285
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 151 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 149 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 149 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 149 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 147 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 147 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 147 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 146 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 146 transition count 276
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 145 transition count 275
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 145 transition count 275
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 144 transition count 274
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 144 transition count 274
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 28 place count 144 transition count 266
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 29 place count 143 transition count 265
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 143 transition count 265
Applied a total of 30 rules in 58 ms. Remains 143 /153 variables (removed 10) and now considering 265/315 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 143/153 places, 265/315 transitions.
RANDOM walk for 40000 steps (9026 resets) in 354 ms. (112 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1900 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1854 resets) in 185 ms. (215 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4094 resets) in 237 ms. (168 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1883 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4106 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1890 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (4171 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1889 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1931 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4123 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 397384 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 12
Probabilistic random walk after 397384 steps, saw 170184 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 265 rows 143 cols
[2024-06-01 14:11:42] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 14:11:42] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 245/334 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 138/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/408 variables, 54/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/408 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 304 constraints, problems are : Problem set: 0 solved, 12 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/89 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 245/334 variables, 89/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 138/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 74/408 variables, 54/284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 12/316 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 14:11:44] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/408 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 408/408 variables, and 317 constraints, problems are : Problem set: 0 solved, 12 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
After SMT, in 4102ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 33269 ms.
Support contains 14 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 265/265 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 143/143 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 265/265 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-06-01 14:12:20] [INFO ] Invariant cache hit.
[2024-06-01 14:12:20] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 14:12:20] [INFO ] Invariant cache hit.
[2024-06-01 14:12:20] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-06-01 14:12:21] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-06-01 14:12:21] [INFO ] Redundant transitions in 14 ms returned []
Running 264 sub problems to find dead transitions.
[2024-06-01 14:12:21] [INFO ] Invariant cache hit.
[2024-06-01 14:12:21] [INFO ] State equation strengthened by 158 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD241 is UNSAT
At refinement iteration 4 (OVERLAPS) 265/408 variables, 143/146 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 158/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/408 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 7 (OVERLAPS) 0/408 variables, 0/304 constraints. Problems are: Problem set: 3 solved, 261 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 304 constraints, problems are : Problem set: 3 solved, 261 unsolved in 13857 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 261 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 4 (OVERLAPS) 264/404 variables, 140/143 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 157/300 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 23/323 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/323 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 8 (OVERLAPS) 4/408 variables, 3/326 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 1/327 constraints. Problems are: Problem set: 3 solved, 261 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 238/565 constraints. Problems are: Problem set: 3 solved, 261 unsolved
[2024-06-01 14:13:01] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 2 ms to minimize.
[2024-06-01 14:13:01] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 567 constraints, problems are : Problem set: 3 solved, 261 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 158/158 constraints, PredecessorRefiner: 261/264 constraints, Known Traps: 2/2 constraints]
After SMT, in 44414ms problems are : Problem set: 3 solved, 261 unsolved
Search for dead transitions found 3 dead transitions in 44419ms
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 : 143/143 places, 262/265 transitions.
Graph (complete) has 495 edges and 143 vertex of which 140 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 20 ms. Remains 140 /143 variables (removed 3) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 140 cols
[2024-06-01 14:13:05] [INFO ] Computed 3 invariants in 3 ms
[2024-06-01 14:13:05] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-01 14:13:05] [INFO ] Invariant cache hit.
[2024-06-01 14:13:05] [INFO ] State equation strengthened by 157 read => feed constraints.
[2024-06-01 14:13:06] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1103 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 140/143 places, 262/265 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46286 ms. Remains : 140/143 places, 262/265 transitions.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33 stabilizing places and 60 stable transitions
Graph (complete) has 832 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 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((G(F(p0)) U !p1)))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 104 place count 134 transition count 193
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 115 place count 123 transition count 172
Iterating global reduction 1 with 11 rules applied. Total rules applied 126 place count 123 transition count 172
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 132 place count 123 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 119 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 119 transition count 162
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 115 transition count 158
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 115 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 112 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 112 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 157 place count 112 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 109 transition count 149
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 109 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 108 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 108 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 107 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 107 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 106 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 106 transition count 144
Applied a total of 169 rules in 45 ms. Remains 106 /178 variables (removed 72) and now considering 144/492 (removed 348) transitions.
// Phase 1: matrix 144 rows 106 cols
[2024-06-01 14:13:06] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:13:07] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 14:13:07] [INFO ] Invariant cache hit.
[2024-06-01 14:13:07] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:13:07] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-06-01 14:13:07] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2024-06-01 14:13:07] [INFO ] Invariant cache hit.
[2024-06-01 14:13:07] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-06-01 14:13:09] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 144/250 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 69/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 180 constraints, problems are : Problem set: 3 solved, 140 unsolved in 8754 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 143/247 variables, 104/109 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 68/177 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 27/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/204 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 3/250 variables, 2/206 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/207 constraints. Problems are: Problem set: 3 solved, 140 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 113/320 constraints. Problems are: Problem set: 3 solved, 140 unsolved
[2024-06-01 14:13:24] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/250 variables, 1/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/250 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
At refinement iteration 17 (OVERLAPS) 0/250 variables, 0/321 constraints. Problems are: Problem set: 4 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 321 constraints, problems are : Problem set: 4 solved, 139 unsolved in 18247 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 106/106 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/143 constraints, Known Traps: 2/2 constraints]
After SMT, in 27203ms problems are : Problem set: 4 solved, 139 unsolved
Search for dead transitions found 4 dead transitions in 27205ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 106/178 places, 140/492 transitions.
Graph (complete) has 349 edges and 106 vertex of which 102 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 102 /106 variables (removed 4) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-06-01 14:13:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:13:34] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 14:13:34] [INFO ] Invariant cache hit.
[2024-06-01 14:13:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 14:13:35] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 102/178 places, 140/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28716 ms. Remains : 102/178 places, 140/492 transitions.
Stuttering acceptance computed with spot in 403 ms :[p1, (NOT p0), (NOT p0), p1]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-00
Product exploration explored 100000 steps with 22478 reset in 686 ms.
Product exploration explored 100000 steps with 22422 reset in 409 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 345 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 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 142 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[p1, (NOT p0), (NOT p0), p1]
RANDOM walk for 40000 steps (8979 resets) in 306 ms. (130 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1887 resets) in 340 ms. (117 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1853 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1919 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1864066 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :2 out of 3
Probabilistic random walk after 1864066 steps, saw 794751 distinct states, run finished after 3001 ms. (steps per millisecond=621 ) properties seen :2
[2024-06-01 14:13:40] [INFO ] Invariant cache hit.
[2024-06-01 14:13:40] [INFO ] State equation strengthened by 68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 595ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 140/140 transitions.
Graph (complete) has 310 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 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 99 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 99 transition count 125
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 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 121
Applied a total of 11 rules in 13 ms. Remains 98 /102 variables (removed 4) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 98/102 places, 121/140 transitions.
RANDOM walk for 40000 steps (8938 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1867 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2364647 steps, run timeout after 3001 ms. (steps per millisecond=787 ) properties seen :0 out of 1
Probabilistic random walk after 2364647 steps, saw 1046490 distinct states, run finished after 3001 ms. (steps per millisecond=787 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 14:13:44] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 14:13:44] [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 193 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 334 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 542ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 497 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 6 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 10 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 14:13:45] [INFO ] Invariant cache hit.
[2024-06-01 14:13:45] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-01 14:13:45] [INFO ] Invariant cache hit.
[2024-06-01 14:13:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 14:13:46] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2024-06-01 14:13:46] [INFO ] Redundant transitions in 1 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 14:13:46] [INFO ] Invariant cache hit.
[2024-06-01 14:13:46] [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 5494 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 9358 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 15065ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 15068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15652 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 2 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 27 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 14:14:01] [INFO ] Computed 3 invariants in 5 ms
[2024-06-01 14:14:01] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:14:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:14:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:14:01] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:14:01] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:14:01] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 279 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 211 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 193 ms :[p1, (NOT p0), (NOT p0), p1]
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-06-01 14:14:02] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:14:02] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 14:14:02] [INFO ] Invariant cache hit.
[2024-06-01 14:14:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 14:14:02] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-01 14:14:02] [INFO ] Redundant transitions in 1 ms returned []
Running 139 sub problems to find dead transitions.
[2024-06-01 14:14:02] [INFO ] Invariant cache hit.
[2024-06-01 14:14:02] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 139 unsolved in 5813 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 139/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 313 constraints, problems are : Problem set: 0 solved, 139 unsolved in 11105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 17074ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 17076ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17484 ms. Remains : 102/102 places, 140/140 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 345 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[p1, (NOT p0), (NOT p0), p1]
RANDOM walk for 40000 steps (8957 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1849 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1552750 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :2 out of 3
Probabilistic random walk after 1552750 steps, saw 663161 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :2
[2024-06-01 14:14:23] [INFO ] Invariant cache hit.
[2024-06-01 14:14:23] [INFO ] State equation strengthened by 68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 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) 58/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/71 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/75 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 111/186 variables, 75/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 39/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 56/242 variables, 27/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 29/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/242 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 631ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 140/140 transitions.
Graph (complete) has 310 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 138
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 100 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 99 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 99 transition count 125
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 99 transition count 124
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 98 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 98 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 98 transition count 121
Applied a total of 11 rules in 23 ms. Remains 98 /102 variables (removed 4) and now considering 121/140 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 98/102 places, 121/140 transitions.
RANDOM walk for 40000 steps (9061 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1922 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1974450 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :0 out of 1
Probabilistic random walk after 1974450 steps, saw 874364 distinct states, run finished after 3001 ms. (steps per millisecond=657 ) properties seen :0
// Phase 1: matrix 121 rows 98 cols
[2024-06-01 14:14:26] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:14:26] [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 177 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 306 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 490ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 295 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 4 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 4 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 4 ms. Remains 98 /98 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-06-01 14:14:27] [INFO ] Invariant cache hit.
[2024-06-01 14:14:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 14:14:27] [INFO ] Invariant cache hit.
[2024-06-01 14:14:27] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-01 14:14:28] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-06-01 14:14:28] [INFO ] Redundant transitions in 2 ms returned []
Running 120 sub problems to find dead transitions.
[2024-06-01 14:14:28] [INFO ] Invariant cache hit.
[2024-06-01 14:14:28] [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 4812 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 9272 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 14300ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 14302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14804 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 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 14:14:42] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:14:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:14:42] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:14:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 14:14:42] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:14:42] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:14:42] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 252 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 212 ms :[p1, (NOT p0), (NOT p0), p1]
Stuttering acceptance computed with spot in 207 ms :[p1, (NOT p0), (NOT p0), p1]
Product exploration explored 100000 steps with 22566 reset in 350 ms.
Product exploration explored 100000 steps with 22290 reset in 369 ms.
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 140/140 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-06-01 14:14:44] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:14:44] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 14:14:44] [INFO ] Invariant cache hit.
[2024-06-01 14:14:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-01 14:14:44] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-06-01 14:14:44] [INFO ] Redundant transitions in 1 ms returned []
Running 139 sub problems to find dead transitions.
[2024-06-01 14:14:44] [INFO ] Invariant cache hit.
[2024-06-01 14:14:44] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 174 constraints, problems are : Problem set: 0 solved, 139 unsolved in 7031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (OVERLAPS) 1/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/242 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 68/174 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 139/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 9 (OVERLAPS) 0/242 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 313 constraints, problems are : Problem set: 0 solved, 139 unsolved in 11705 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 0/0 constraints]
After SMT, in 19008ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 19011ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19667 ms. Remains : 102/102 places, 140/140 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 finished in 117361 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((!p0&&(!p1||G(p2)))) U !p2)))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 157 transition count 246
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 157 transition count 246
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 136 transition count 225
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 136 transition count 225
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 103 place count 136 transition count 206
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 114 place count 125 transition count 185
Iterating global reduction 1 with 11 rules applied. Total rules applied 125 place count 125 transition count 185
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 125 transition count 179
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 121 transition count 175
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 121 transition count 175
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 143 place count 117 transition count 171
Iterating global reduction 2 with 4 rules applied. Total rules applied 147 place count 117 transition count 171
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 114 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 114 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 157 place count 114 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 111 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 111 transition count 161
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 164 place count 110 transition count 158
Iterating global reduction 3 with 1 rules applied. Total rules applied 165 place count 110 transition count 158
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 166 place count 109 transition count 157
Iterating global reduction 3 with 1 rules applied. Total rules applied 167 place count 109 transition count 157
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 108 transition count 156
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 108 transition count 156
Applied a total of 169 rules in 17 ms. Remains 108 /178 variables (removed 70) and now considering 156/492 (removed 336) transitions.
// Phase 1: matrix 156 rows 108 cols
[2024-06-01 14:15:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:15:04] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 14:15:04] [INFO ] Invariant cache hit.
[2024-06-01 14:15:04] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-06-01 14:15:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-06-01 14:15:04] [INFO ] Invariant cache hit.
[2024-06-01 14:15:04] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-06-01 14:15:07] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD139 is UNSAT
At refinement iteration 6 (OVERLAPS) 156/264 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 81/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 194 constraints, problems are : Problem set: 3 solved, 152 unsolved in 11205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 155/261 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 80/191 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/261 variables, 28/219 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/261 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 12 (OVERLAPS) 3/264 variables, 2/221 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 1/222 constraints. Problems are: Problem set: 3 solved, 152 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 124/346 constraints. Problems are: Problem set: 3 solved, 152 unsolved
[2024-06-01 14:15:28] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
Problem TDEAD142 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 1/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 0/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
At refinement iteration 17 (OVERLAPS) 0/264 variables, 0/347 constraints. Problems are: Problem set: 4 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 347 constraints, problems are : Problem set: 4 solved, 151 unsolved in 24285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 152/155 constraints, Known Traps: 2/2 constraints]
After SMT, in 35716ms problems are : Problem set: 4 solved, 151 unsolved
Search for dead transitions found 4 dead transitions in 35718ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/178 places, 152/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 152
Applied a total of 4 rules in 2 ms. Remains 104 /108 variables (removed 4) and now considering 152/152 (removed 0) transitions.
// Phase 1: matrix 152 rows 104 cols
[2024-06-01 14:15:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:15:40] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-01 14:15:40] [INFO ] Invariant cache hit.
[2024-06-01 14:15:40] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-06-01 14:15:40] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/178 places, 152/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36667 ms. Remains : 104/178 places, 152/492 transitions.
Stuttering acceptance computed with spot in 182 ms :[p2, p2, (OR p0 (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 436 ms.
Product exploration explored 100000 steps with 50000 reset in 383 ms.
Computed a total of 17 stabilizing places and 24 stable transitions
Graph (complete) has 360 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p2) p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (OR (AND p2 p0) (AND p2 p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 17 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-01 finished in 37716 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(p1))||p0)))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 122 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 107 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 105 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 105 transition count 131
Applied a total of 168 rules in 23 ms. Remains 105 /178 variables (removed 73) and now considering 131/492 (removed 361) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-06-01 14:15:41] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:15:41] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 14:15:41] [INFO ] Invariant cache hit.
[2024-06-01 14:15:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 14:15:42] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-01 14:15:42] [INFO ] Invariant cache hit.
[2024-06-01 14:15:42] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
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, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 14:15:43] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/236 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 58/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-06-01 14:15:47] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 4 ms to minimize.
[2024-06-01 14:15:47] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 127 unsolved in 8466 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: 3/3 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, 0/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/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) 1/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/233 variables, 103/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 27/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 3/236 variables, 2/196 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/236 variables, 1/197 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 100/297 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-06-01 14:15:59] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 17 (OVERLAPS) 0/236 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 298 constraints, problems are : Problem set: 4 solved, 126 unsolved in 19342 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: 4/4 constraints]
After SMT, in 28040ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 28042ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 105/178 places, 127/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 127
Applied a total of 4 rules in 2 ms. Remains 101 /105 variables (removed 4) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 101 cols
[2024-06-01 14:16:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:16:10] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 14:16:10] [INFO ] Invariant cache hit.
[2024-06-01 14:16:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 14:16:10] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/178 places, 127/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29062 ms. Remains : 101/178 places, 127/492 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 327 ms.
Product exploration explored 100000 steps with 50000 reset in 333 ms.
Computed a total of 17 stabilizing places and 22 stable transitions
Graph (complete) has 331 edges and 101 vertex of which 100 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 : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-03 finished in 29900 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)||(G(p2)&&p1))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 218
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 218
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 196
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 196
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 103 place count 134 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 114 place count 123 transition count 159
Iterating global reduction 1 with 11 rules applied. Total rules applied 125 place count 123 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 131 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 120 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 115 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 115 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 113 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 113 transition count 141
Applied a total of 153 rules in 43 ms. Remains 113 /178 variables (removed 65) and now considering 141/492 (removed 351) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-06-01 14:16:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:16:11] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-01 14:16:11] [INFO ] Invariant cache hit.
[2024-06-01 14:16:12] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-06-01 14:16:12] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-06-01 14:16:12] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 14:16:12] [INFO ] Invariant cache hit.
[2024-06-01 14:16:12] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 14:16:15] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 62/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 180 constraints, problems are : Problem set: 3 solved, 137 unsolved in 8744 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 140/251 variables, 111/116 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 61/177 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 30/207 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/207 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 3/254 variables, 2/209 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 1/210 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 107/317 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-06-01 14:16:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 14:16:29] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 2/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/254 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 17 (OVERLAPS) 0/254 variables, 0/319 constraints. Problems are: Problem set: 4 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 319 constraints, problems are : Problem set: 4 solved, 136 unsolved in 18971 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 3/3 constraints]
After SMT, in 27989ms problems are : Problem set: 4 solved, 136 unsolved
Search for dead transitions found 4 dead transitions in 27992ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 113/178 places, 137/492 transitions.
Graph (complete) has 361 edges and 113 vertex of which 109 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 109 /113 variables (removed 4) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 109 cols
[2024-06-01 14:16:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:16:40] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 14:16:40] [INFO ] Invariant cache hit.
[2024-06-01 14:16:40] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 14:16:40] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/178 places, 137/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29107 ms. Remains : 109/178 places, 137/492 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-05 finished in 29222 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(G(p1))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 113 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 111 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 110 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 110 transition count 150
Applied a total of 159 rules in 17 ms. Remains 110 /178 variables (removed 68) and now considering 150/492 (removed 342) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-06-01 14:16:40] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:16:41] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 14:16:41] [INFO ] Invariant cache hit.
[2024-06-01 14:16:41] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 14:16:41] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-01 14:16:41] [INFO ] Invariant cache hit.
[2024-06-01 14:16:41] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-06-01 14:16:47] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:16:47] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/260 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 8700 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (OVERLAPS) 3/260 variables, 2/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 118/338 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 2 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 1/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 18 (OVERLAPS) 0/260 variables, 0/339 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 339 constraints, problems are : Problem set: 4 solved, 145 unsolved in 20711 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 5/5 constraints]
After SMT, in 29574ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 29577ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/178 places, 146/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 1 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-06-01 14:17:11] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:17:11] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 14:17:11] [INFO ] Invariant cache hit.
[2024-06-01 14:17:11] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 14:17:11] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/178 places, 146/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30668 ms. Remains : 106/178 places, 146/492 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-06 finished in 30794 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 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 202
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 202
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 179
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 105 place count 132 transition count 166
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 117 place count 120 transition count 143
Iterating global reduction 1 with 12 rules applied. Total rules applied 129 place count 120 transition count 143
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 137 place count 120 transition count 135
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 141 place count 116 transition count 131
Iterating global reduction 2 with 4 rules applied. Total rules applied 145 place count 116 transition count 131
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 112 transition count 127
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 112 transition count 127
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 156 place count 109 transition count 124
Iterating global reduction 2 with 3 rules applied. Total rules applied 159 place count 109 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 161 place count 109 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 164 place count 106 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 167 place count 106 transition count 119
Applied a total of 167 rules in 9 ms. Remains 106 /178 variables (removed 72) and now considering 119/492 (removed 373) transitions.
// Phase 1: matrix 119 rows 106 cols
[2024-06-01 14:17:11] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:17:11] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 14:17:11] [INFO ] Invariant cache hit.
[2024-06-01 14:17:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 14:17:12] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-06-01 14:17:12] [INFO ] Invariant cache hit.
[2024-06-01 14:17:12] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-06-01 14:17:13] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD106 is UNSAT
At refinement iteration 6 (OVERLAPS) 119/225 variables, 106/111 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 45/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/156 constraints. Problems are: Problem set: 3 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 156 constraints, problems are : Problem set: 3 solved, 115 unsolved in 6290 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 118/222 variables, 104/109 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 44/153 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 28/181 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 3/225 variables, 2/183 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 115 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 87/271 constraints. Problems are: Problem set: 3 solved, 115 unsolved
[2024-06-01 14:17:25] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 1 ms to minimize.
[2024-06-01 14:17:25] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
Problem TDEAD109 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/225 variables, 2/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
At refinement iteration 16 (OVERLAPS) 0/225 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 273 constraints, problems are : Problem set: 4 solved, 114 unsolved in 14610 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 115/118 constraints, Known Traps: 3/3 constraints]
After SMT, in 21019ms problems are : Problem set: 4 solved, 114 unsolved
Search for dead transitions found 4 dead transitions in 21020ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/178 places, 115/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 115
Applied a total of 4 rules in 1 ms. Remains 102 /106 variables (removed 4) and now considering 115/115 (removed 0) transitions.
// Phase 1: matrix 115 rows 102 cols
[2024-06-01 14:17:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:17:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 14:17:33] [INFO ] Invariant cache hit.
[2024-06-01 14:17:33] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 14:17:33] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 102/178 places, 115/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21868 ms. Remains : 102/178 places, 115/492 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-07
Product exploration explored 100000 steps with 22192 reset in 472 ms.
Product exploration explored 100000 steps with 22492 reset in 244 ms.
Computed a total of 27 stabilizing places and 35 stable transitions
Graph (complete) has 323 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 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 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8976 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4145 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2324874 steps, run timeout after 3001 ms. (steps per millisecond=774 ) properties seen :0 out of 1
Probabilistic random walk after 2324874 steps, saw 1084306 distinct states, run finished after 3001 ms. (steps per millisecond=774 ) properties seen :0
[2024-06-01 14:17:37] [INFO ] Invariant cache hit.
[2024-06-01 14:17:37] [INFO ] State equation strengthened by 44 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) 57/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/78 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 100/178 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 29/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/217 variables, 24/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:17:37] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 1 ms to minimize.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 217/217 variables, and 151 constraints, problems are : Problem set: 1 solved, 0 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 102/102 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 145ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [p0, (X (X p0)), (G p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-07 finished in 26195 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(X(X(F(p0))))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 16 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-06-01 14:17:37] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:17:38] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 14:17:38] [INFO ] Invariant cache hit.
[2024-06-01 14:17:38] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 14:17:38] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 14:17:38] [INFO ] Invariant cache hit.
[2024-06-01 14:17:38] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 14:17:39] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 14:17:43] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-06-01 14:17:43] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 166 constraints, problems are : Problem set: 3 solved, 123 unsolved in 7603 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/163 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/192 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 14:17:51] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 4 solved, 122 unsolved in 13040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 20774ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 20775ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 1 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 14:17:59] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:17:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 14:17:59] [INFO ] Invariant cache hit.
[2024-06-01 14:17:59] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:17:59] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21539 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Product exploration explored 100000 steps with 26663 reset in 136 ms.
Product exploration explored 100000 steps with 26610 reset in 177 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8983 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1914 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 10 ms. (steps per millisecond=325 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 17 ms. (steps per millisecond=191 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 14:18:00] [INFO ] Invariant cache hit.
[2024-06-01 14:18:01] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 14:18:01] [INFO ] Invariant cache hit.
[2024-06-01 14:18:01] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:18:01] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 14:18:01] [INFO ] Invariant cache hit.
[2024-06-01 14:18:01] [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 4401 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 8124 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 12735ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 12738ms
Finished structural reductions in LTL mode , in 1 iterations and 13349 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8962 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 11 ms. (steps per millisecond=295 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 11 ms. (steps per millisecond=295 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26706 reset in 220 ms.
Product exploration explored 100000 steps with 26659 reset in 242 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (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 11 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 14:18:16] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 14:18:16] [INFO ] Invariant cache hit.
[2024-06-01 14:18:16] [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 4719 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 9189 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 14105ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 14108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14129 ms. Remains : 99/99 places, 123/123 transitions.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 14:18:30] [INFO ] Invariant cache hit.
[2024-06-01 14:18:30] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-06-01 14:18:30] [INFO ] Invariant cache hit.
[2024-06-01 14:18:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:18:31] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 14:18:31] [INFO ] Invariant cache hit.
[2024-06-01 14:18:31] [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 5366 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 9420 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 14975ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 14978ms
Finished structural reductions in LTL mode , in 1 iterations and 15625 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 68395 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(X((!(!G(F(p0)) U !X(p1))&&F(!p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 102 place count 134 transition count 181
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 113 place count 123 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 124 place count 123 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 131 place count 123 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 120 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 120 transition count 150
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 117 transition count 147
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 117 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 115 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 115 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 151 place count 113 transition count 141
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 113 transition count 141
Applied a total of 153 rules in 24 ms. Remains 113 /178 variables (removed 65) and now considering 141/492 (removed 351) transitions.
// Phase 1: matrix 141 rows 113 cols
[2024-06-01 14:18:46] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:18:46] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 14:18:46] [INFO ] Invariant cache hit.
[2024-06-01 14:18:46] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-01 14:18:46] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-06-01 14:18:46] [INFO ] Invariant cache hit.
[2024-06-01 14:18:46] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 14:18:49] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 6 (OVERLAPS) 141/254 variables, 113/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 61/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-06-01 14:18:53] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:18:53] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 2/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 181 constraints, problems are : Problem set: 3 solved, 137 unsolved in 11579 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 1/111 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 140/251 variables, 111/118 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 60/178 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 30/208 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/208 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 3/254 variables, 2/210 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 137 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 107/318 constraints. Problems are: Problem set: 3 solved, 137 unsolved
[2024-06-01 14:19:06] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-06-01 14:19:06] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/254 variables, 2/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/254 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
At refinement iteration 16 (OVERLAPS) 0/254 variables, 0/320 constraints. Problems are: Problem set: 4 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 320 constraints, problems are : Problem set: 4 solved, 136 unsolved in 22371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 137/140 constraints, Known Traps: 5/5 constraints]
After SMT, in 34118ms problems are : Problem set: 4 solved, 136 unsolved
Search for dead transitions found 4 dead transitions in 34121ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 113/178 places, 137/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 109 transition count 137
Applied a total of 4 rules in 2 ms. Remains 109 /113 variables (removed 4) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 109 cols
[2024-06-01 14:19:20] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:19:21] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 14:19:21] [INFO ] Invariant cache hit.
[2024-06-01 14:19:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-01 14:19:21] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 109/178 places, 137/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35230 ms. Remains : 109/178 places, 137/492 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, true, (NOT p1), p1, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-09 finished in 35547 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&&X(p1)))&&F(G(p2)))))'
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 114 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 114 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 114 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 111 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 109 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 108 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 108 transition count 145
Applied a total of 166 rules in 45 ms. Remains 108 /178 variables (removed 70) and now considering 145/492 (removed 347) transitions.
// Phase 1: matrix 145 rows 108 cols
[2024-06-01 14:19:21] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:19:22] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-06-01 14:19:22] [INFO ] Invariant cache hit.
[2024-06-01 14:19:22] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-01 14:19:22] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-06-01 14:19:22] [INFO ] Invariant cache hit.
[2024-06-01 14:19:22] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 14:19:25] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 145/253 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 70/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-06-01 14:19:30] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:19:30] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/253 variables, 2/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 185 constraints, problems are : Problem set: 3 solved, 141 unsolved in 12737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/250 variables, 106/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 69/182 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 28/210 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-06-01 14:19:40] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 3/253 variables, 2/213 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 113/327 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-06-01 14:19:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 328 constraints, problems are : Problem set: 4 solved, 140 unsolved in 24402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 141/144 constraints, Known Traps: 5/5 constraints]
After SMT, in 37295ms problems are : Problem set: 4 solved, 140 unsolved
Search for dead transitions found 4 dead transitions in 37297ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 108/178 places, 141/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 104 transition count 141
Applied a total of 4 rules in 1 ms. Remains 104 /108 variables (removed 4) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-06-01 14:19:59] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:20:00] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 14:20:00] [INFO ] Invariant cache hit.
[2024-06-01 14:20:00] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:20:00] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 104/178 places, 141/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38619 ms. Remains : 104/178 places, 141/492 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Product exploration explored 100000 steps with 37278 reset in 336 ms.
Product exploration explored 100000 steps with 37355 reset in 337 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 186 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (9017 resets) in 1068 ms. (37 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1834 resets) in 416 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 426 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (1846 resets) in 466 ms. (85 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4015 resets) in 764 ms. (52 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1801 resets) in 346 ms. (115 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 169660 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :1 out of 5
Probabilistic random walk after 169660 steps, saw 74312 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :1
[2024-06-01 14:20:06] [INFO ] Invariant cache hit.
[2024-06-01 14:20:06] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 1 solved, 3 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1059ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12936 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 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 103 transition count 139
Applied a total of 3 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8899 resets) in 612 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1859 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 321964 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 3
Probabilistic random walk after 321964 steps, saw 138789 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-06-01 14:20:23] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:20:23] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 604ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 20754 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 6 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 14:20:44] [INFO ] Invariant cache hit.
[2024-06-01 14:20:44] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 14:20:44] [INFO ] Invariant cache hit.
[2024-06-01 14:20:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 14:20:45] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-01 14:20:45] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 14:20:45] [INFO ] Invariant cache hit.
[2024-06-01 14:20:45] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7177 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 9922 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 17335ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 17337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17886 ms. Remains : 103/103 places, 139/139 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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 15 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-06-01 14:21:02] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:21:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:21:02] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 14:21:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 14:21:03] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 14:21:03] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 14:21:03] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 410 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 176 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-06-01 14:21:03] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:21:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 14:21:03] [INFO ] Invariant cache hit.
[2024-06-01 14:21:03] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:21:04] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-06-01 14:21:04] [INFO ] Redundant transitions in 0 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 14:21:04] [INFO ] Invariant cache hit.
[2024-06-01 14:21:04] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 12589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 19901ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 19902ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20313 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
RANDOM walk for 40000 steps (8910 resets) in 541 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1850 resets) in 370 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4206 resets) in 620 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1808 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4096 resets) in 523 ms. (76 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (4074 resets) in 528 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1923 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 341148 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :3 out of 6
Probabilistic random walk after 341148 steps, saw 146886 distinct states, run finished after 3008 ms. (steps per millisecond=113 ) properties seen :3
[2024-06-01 14:21:28] [INFO ] Invariant cache hit.
[2024-06-01 14:21:28] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1071ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12176 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 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 103 transition count 139
Applied a total of 3 rules in 5 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8904 resets) in 903 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1947 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1914 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1870 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 296727 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 3
Probabilistic random walk after 296727 steps, saw 128544 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-06-01 14:21:45] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 14:21:45] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 583 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 791ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 17838 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 17 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 14:22:04] [INFO ] Invariant cache hit.
[2024-06-01 14:22:04] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 14:22:04] [INFO ] Invariant cache hit.
[2024-06-01 14:22:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 14:22:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2024-06-01 14:22:04] [INFO ] Redundant transitions in 0 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 14:22:04] [INFO ] Invariant cache hit.
[2024-06-01 14:22:04] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7648 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 10906 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 18713ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 18715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19264 ms. Remains : 103/103 places, 139/139 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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 13 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-06-01 14:22:23] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:22:23] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 14:22:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 14:22:23] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 14:22:23] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 14:22:23] [INFO ] After 413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 576 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 250 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 22299 reset in 303 ms.
Product exploration explored 100000 steps with 22430 reset in 321 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-06-01 14:22:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:22:25] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 14:22:25] [INFO ] Invariant cache hit.
[2024-06-01 14:22:25] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:22:26] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-06-01 14:22:26] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 14:22:26] [INFO ] Invariant cache hit.
[2024-06-01 14:22:26] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7448 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 10683 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 18370ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 18373ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19068 ms. Remains : 104/104 places, 141/141 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 202889 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(F(p0))||G(p1))))'
Support contains 3 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 115 transition count 157
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 115 transition count 157
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 113 transition count 155
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 113 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 154 place count 112 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 112 transition count 152
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 156 place count 111 transition count 151
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 111 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 110 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 110 transition count 150
Applied a total of 159 rules in 20 ms. Remains 110 /178 variables (removed 68) and now considering 150/492 (removed 342) transitions.
// Phase 1: matrix 150 rows 110 cols
[2024-06-01 14:22:44] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:22:44] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 14:22:44] [INFO ] Invariant cache hit.
[2024-06-01 14:22:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-01 14:22:45] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 149 sub problems to find dead transitions.
[2024-06-01 14:22:45] [INFO ] Invariant cache hit.
[2024-06-01 14:22:45] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 1/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-06-01 14:22:48] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 149 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 6 (OVERLAPS) 150/260 variables, 110/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 74/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-06-01 14:22:53] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 3 ms to minimize.
[2024-06-01 14:22:53] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/260 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/260 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 191 constraints, problems are : Problem set: 3 solved, 146 unsolved in 12694 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/107 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 1/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 149/257 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 73/188 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 28/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/216 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 3/260 variables, 2/218 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 1/219 constraints. Problems are: Problem set: 3 solved, 146 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 118/337 constraints. Problems are: Problem set: 3 solved, 146 unsolved
[2024-06-01 14:23:06] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
Problem TDEAD136 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 1/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
At refinement iteration 17 (OVERLAPS) 0/260 variables, 0/338 constraints. Problems are: Problem set: 4 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 338 constraints, problems are : Problem set: 4 solved, 145 unsolved in 20111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 110/110 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 146/149 constraints, Known Traps: 4/4 constraints]
After SMT, in 32962ms problems are : Problem set: 4 solved, 145 unsolved
Search for dead transitions found 4 dead transitions in 32965ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/178 places, 146/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 146
Applied a total of 4 rules in 2 ms. Remains 106 /110 variables (removed 4) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 106 cols
[2024-06-01 14:23:18] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:23:18] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 14:23:18] [INFO ] Invariant cache hit.
[2024-06-01 14:23:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 14:23:18] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 106/178 places, 146/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34079 ms. Remains : 106/178 places, 146/492 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 280 ms.
Product exploration explored 100000 steps with 33333 reset in 299 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 358 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-11 finished in 34910 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 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 37 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-06-01 14:23:19] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:23:19] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 14:23:19] [INFO ] Invariant cache hit.
[2024-06-01 14:23:20] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 14:23:20] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2024-06-01 14:23:20] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2024-06-01 14:23:20] [INFO ] Invariant cache hit.
[2024-06-01 14:23:20] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 3 solved, 123 unsolved in 7059 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/287 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 14:23:35] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 288 constraints, problems are : Problem set: 4 solved, 122 unsolved in 17982 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 25244ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 25248ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Graph (complete) has 327 edges and 103 vertex of which 99 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 14:23:45] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:23:45] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 14:23:45] [INFO ] Invariant cache hit.
[2024-06-01 14:23:45] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:23:46] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26481 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-12
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-12 finished in 26609 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(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 27 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-06-01 14:23:46] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:23:46] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 14:23:46] [INFO ] Invariant cache hit.
[2024-06-01 14:23:46] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 14:23:46] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 14:23:46] [INFO ] Invariant cache hit.
[2024-06-01 14:23:46] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 14:23:49] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 164 constraints, problems are : Problem set: 3 solved, 123 unsolved in 8371 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/106 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/161 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/187 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/287 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 14:24:04] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/288 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 288 constraints, problems are : Problem set: 4 solved, 122 unsolved in 18721 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 27301ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 27303ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 99 transition count 123
Applied a total of 4 rules in 1 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 14:24:14] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:24:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 14:24:14] [INFO ] Invariant cache hit.
[2024-06-01 14:24:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:24:14] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28412 ms. Remains : 99/178 places, 123/492 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-13 finished in 28533 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||F(p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 217
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 217
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 195
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 101 place count 134 transition count 182
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 113 place count 122 transition count 159
Iterating global reduction 1 with 12 rules applied. Total rules applied 125 place count 122 transition count 159
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 132 place count 122 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 136 place count 118 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 140 place count 118 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 144 place count 114 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 148 place count 114 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 151 place count 111 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 154 place count 111 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 156 place count 111 transition count 139
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 108 transition count 136
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 107 transition count 133
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 107 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 105 transition count 131
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 105 transition count 131
Applied a total of 168 rules in 33 ms. Remains 105 /178 variables (removed 73) and now considering 131/492 (removed 361) transitions.
// Phase 1: matrix 131 rows 105 cols
[2024-06-01 14:24:14] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:24:15] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 14:24:15] [INFO ] Invariant cache hit.
[2024-06-01 14:24:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-01 14:24:15] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-06-01 14:24:15] [INFO ] Redundant transitions in 0 ms returned []
Running 130 sub problems to find dead transitions.
[2024-06-01 14:24:15] [INFO ] Invariant cache hit.
[2024-06-01 14:24:15] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
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, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-01 14:24:17] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 131/236 variables, 105/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 58/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-06-01 14:24:20] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 3 ms to minimize.
[2024-06-01 14:24:20] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/236 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/236 variables, 0/170 constraints. Problems are: Problem set: 3 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 170 constraints, problems are : Problem set: 3 solved, 127 unsolved in 8339 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: 3/3 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, 0/1 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/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) 1/103 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/233 variables, 103/110 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 57/167 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 27/194 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/195 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 13 (OVERLAPS) 3/236 variables, 2/197 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 127 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 100/298 constraints. Problems are: Problem set: 3 solved, 127 unsolved
[2024-06-01 14:24:34] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
Problem TDEAD118 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 1/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
At refinement iteration 18 (OVERLAPS) 0/236 variables, 0/299 constraints. Problems are: Problem set: 4 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 236/236 variables, and 299 constraints, problems are : Problem set: 4 solved, 126 unsolved in 19445 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: 5/5 constraints]
After SMT, in 28007ms problems are : Problem set: 4 solved, 126 unsolved
Search for dead transitions found 4 dead transitions in 28010ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 105/178 places, 127/492 transitions.
Graph (complete) has 335 edges and 105 vertex of which 101 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 101 /105 variables (removed 4) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 101 cols
[2024-06-01 14:24:43] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:24:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 14:24:43] [INFO ] Invariant cache hit.
[2024-06-01 14:24:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-01 14:24:43] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/178 places, 127/492 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29016 ms. Remains : 101/178 places, 127/492 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-14
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-14 finished in 29199 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((G(F(p0)) U !p1)))'
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(X(X(F(p0))))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 155 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 155 transition count 216
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 132 transition count 193
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 132 transition count 193
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 107 place count 132 transition count 178
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 119 place count 120 transition count 155
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 120 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 138 place count 120 transition count 148
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 142 place count 116 transition count 144
Iterating global reduction 2 with 4 rules applied. Total rules applied 146 place count 116 transition count 144
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 150 place count 112 transition count 140
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 112 transition count 140
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 157 place count 109 transition count 137
Iterating global reduction 2 with 3 rules applied. Total rules applied 160 place count 109 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 109 transition count 135
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 106 transition count 132
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 106 transition count 132
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 169 place count 105 transition count 129
Iterating global reduction 3 with 1 rules applied. Total rules applied 170 place count 105 transition count 129
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 171 place count 104 transition count 128
Iterating global reduction 3 with 1 rules applied. Total rules applied 172 place count 104 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 103 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 103 transition count 127
Applied a total of 174 rules in 38 ms. Remains 103 /178 variables (removed 75) and now considering 127/492 (removed 365) transitions.
// Phase 1: matrix 127 rows 103 cols
[2024-06-01 14:24:44] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:24:44] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-06-01 14:24:44] [INFO ] Invariant cache hit.
[2024-06-01 14:24:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-01 14:24:45] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-06-01 14:24:45] [INFO ] Invariant cache hit.
[2024-06-01 14:24:45] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-06-01 14:24:47] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/230 variables, 103/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 56/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 14:24:52] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:24:52] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/230 variables, 2/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (OVERLAPS) 0/230 variables, 0/166 constraints. Problems are: Problem set: 3 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 166 constraints, problems are : Problem set: 3 solved, 123 unsolved in 10160 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 1/101 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 126/227 variables, 101/108 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 55/163 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 26/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/227 variables, 0/189 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 12 (OVERLAPS) 3/230 variables, 2/191 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/230 variables, 1/192 constraints. Problems are: Problem set: 3 solved, 123 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/230 variables, 97/289 constraints. Problems are: Problem set: 3 solved, 123 unsolved
[2024-06-01 14:25:03] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/230 variables, 1/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
At refinement iteration 17 (OVERLAPS) 0/230 variables, 0/290 constraints. Problems are: Problem set: 4 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 230/230 variables, and 290 constraints, problems are : Problem set: 4 solved, 122 unsolved in 16672 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 103/103 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 123/126 constraints, Known Traps: 4/4 constraints]
After SMT, in 27060ms problems are : Problem set: 4 solved, 122 unsolved
Search for dead transitions found 4 dead transitions in 27062ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 103/178 places, 123/492 transitions.
Graph (complete) has 327 edges and 103 vertex of which 99 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 99 /103 variables (removed 4) and now considering 123/123 (removed 0) transitions.
// Phase 1: matrix 123 rows 99 cols
[2024-06-01 14:25:12] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:25:12] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 14:25:12] [INFO ] Invariant cache hit.
[2024-06-01 14:25:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:25:12] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 99/178 places, 123/492 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 28136 ms. Remains : 99/178 places, 123/492 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
Product exploration explored 100000 steps with 26636 reset in 155 ms.
Product exploration explored 100000 steps with 26656 reset in 253 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9008 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1867 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 11 ms. (steps per millisecond=295 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 11 ms. (steps per millisecond=295 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 14:25:14] [INFO ] Invariant cache hit.
[2024-06-01 14:25:14] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 14:25:14] [INFO ] Invariant cache hit.
[2024-06-01 14:25:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:25:14] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 14:25:14] [INFO ] Invariant cache hit.
[2024-06-01 14:25:14] [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 5600 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 9572 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 15371ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 15374ms
Finished structural reductions in LTL mode , in 1 iterations and 15970 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9088 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1955 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3252 steps, run visited all 1 properties in 11 ms. (steps per millisecond=295 )
Probabilistic random walk after 3252 steps, saw 1669 distinct states, run finished after 11 ms. (steps per millisecond=295 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26679 reset in 227 ms.
Product exploration explored 100000 steps with 26675 reset in 243 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 239 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (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 3 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 14:25:32] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 14:25:32] [INFO ] Invariant cache hit.
[2024-06-01 14:25:32] [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 5176 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 8894 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 14268ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 14271ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14284 ms. Remains : 99/99 places, 123/123 transitions.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 99/99 places, 123/123 transitions.
Applied a total of 0 rules in 1 ms. Remains 99 /99 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-06-01 14:25:46] [INFO ] Invariant cache hit.
[2024-06-01 14:25:46] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 14:25:46] [INFO ] Invariant cache hit.
[2024-06-01 14:25:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-01 14:25:47] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 122 sub problems to find dead transitions.
[2024-06-01 14:25:47] [INFO ] Invariant cache hit.
[2024-06-01 14:25:47] [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 5009 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 9920 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 15144ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 15147ms
Finished structural reductions in LTL mode , in 1 iterations and 15572 ms. Remains : 99/99 places, 123/123 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 finished in 78062 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&&X(p1)))&&F(G(p2)))))'
Found a Shortening insensitive property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 178/178 places, 492/492 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 156 transition count 231
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 156 transition count 231
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 134 transition count 209
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 134 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 105 place count 134 transition count 192
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 116 place count 123 transition count 171
Iterating global reduction 1 with 11 rules applied. Total rules applied 127 place count 123 transition count 171
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 133 place count 123 transition count 165
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 120 transition count 162
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 120 transition count 162
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 117 transition count 159
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 117 transition count 159
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 114 transition count 156
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 114 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 154 place count 114 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 157 place count 111 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 160 place count 111 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 161 place count 110 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 162 place count 110 transition count 147
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 163 place count 109 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 164 place count 109 transition count 146
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 108 transition count 145
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 108 transition count 145
Applied a total of 166 rules in 42 ms. Remains 108 /178 variables (removed 70) and now considering 145/492 (removed 347) transitions.
// Phase 1: matrix 145 rows 108 cols
[2024-06-01 14:26:02] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:26:02] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-06-01 14:26:02] [INFO ] Invariant cache hit.
[2024-06-01 14:26:03] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-01 14:26:03] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-06-01 14:26:03] [INFO ] Invariant cache hit.
[2024-06-01 14:26:03] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 6 (OVERLAPS) 145/253 variables, 108/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 70/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/183 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-06-01 14:26:11] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-06-01 14:26:12] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/253 variables, 2/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/253 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 185 constraints, problems are : Problem set: 3 solved, 141 unsolved in 13919 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/105 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 1/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 3/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 8 (OVERLAPS) 144/250 variables, 106/113 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 69/182 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 28/210 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-06-01 14:26:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/211 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 13 (OVERLAPS) 3/253 variables, 2/213 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 1/214 constraints. Problems are: Problem set: 3 solved, 141 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/253 variables, 113/327 constraints. Problems are: Problem set: 3 solved, 141 unsolved
[2024-06-01 14:26:29] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
At refinement iteration 16 (INCLUDED_ONLY) 0/253 variables, 1/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
At refinement iteration 18 (OVERLAPS) 0/253 variables, 0/328 constraints. Problems are: Problem set: 4 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 328 constraints, problems are : Problem set: 4 solved, 140 unsolved in 22714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 108/108 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 141/144 constraints, Known Traps: 5/5 constraints]
After SMT, in 36887ms problems are : Problem set: 4 solved, 140 unsolved
Search for dead transitions found 4 dead transitions in 36890ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LI_LTL mode, iteration 1 : 108/178 places, 141/492 transitions.
Graph (complete) has 354 edges and 108 vertex of which 104 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 104 /108 variables (removed 4) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-06-01 14:26:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:26:40] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 14:26:40] [INFO ] Invariant cache hit.
[2024-06-01 14:26:40] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:26:40] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 104/178 places, 141/492 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 38094 ms. Remains : 104/178 places, 141/492 transitions.
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m96-LTLFireability-10
Product exploration explored 100000 steps with 37353 reset in 251 ms.
Product exploration explored 100000 steps with 37458 reset in 262 ms.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 182 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
RANDOM walk for 40000 steps (8990 resets) in 462 ms. (86 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1885 resets) in 447 ms. (89 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1907 resets) in 530 ms. (75 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1926 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (4210 resets) in 568 ms. (70 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1894 resets) in 236 ms. (168 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 180476 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :1 out of 5
Probabilistic random walk after 180476 steps, saw 78873 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :1
[2024-06-01 14:26:45] [INFO ] Invariant cache hit.
[2024-06-01 14:26:45] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 1 solved, 3 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 1 solved, 3 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1049ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 12316 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 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 103 transition count 139
Applied a total of 3 rules in 4 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (9013 resets) in 297 ms. (134 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1933 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1873 resets) in 109 ms. (363 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1843 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 395438 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 3
Probabilistic random walk after 395438 steps, saw 170623 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-06-01 14:27:02] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 14:27:02] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 609ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 19503 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 14:27:22] [INFO ] Invariant cache hit.
[2024-06-01 14:27:22] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 14:27:22] [INFO ] Invariant cache hit.
[2024-06-01 14:27:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 14:27:22] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-06-01 14:27:22] [INFO ] Redundant transitions in 1 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 14:27:22] [INFO ] Invariant cache hit.
[2024-06-01 14:27:22] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6441 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 18811ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 18814ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19286 ms. Remains : 103/103 places, 139/139 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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 9 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-06-01 14:27:41] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:27:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 14:27:41] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 14:27:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 14:27:42] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 14:27:42] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 14:27:42] [INFO ] After 309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 461 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 207 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-06-01 14:27:43] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 14:27:43] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-06-01 14:27:43] [INFO ] Invariant cache hit.
[2024-06-01 14:27:43] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:27:43] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-06-01 14:27:43] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 14:27:43] [INFO ] Invariant cache hit.
[2024-06-01 14:27:43] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 7497 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 12491 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 20229ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 20233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20916 ms. Remains : 104/104 places, 141/141 transitions.
Computed a total of 17 stabilizing places and 23 stable transitions
Graph (complete) has 350 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 17 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
RANDOM walk for 40000 steps (9008 resets) in 707 ms. (56 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1872 resets) in 241 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4119 resets) in 303 ms. (131 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1878 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4027 resets) in 434 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4243 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1879 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 407704 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :3 out of 6
Probabilistic random walk after 407704 steps, saw 175939 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :3
[2024-06-01 14:28:08] [INFO ] Invariant cache hit.
[2024-06-01 14:28:08] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 3 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 60/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/74 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/78 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 124/202 variables, 78/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 52/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 43/245 variables, 26/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 17/177 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/245 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 180 constraints, problems are : Problem set: 0 solved, 3 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 934ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 16061 ms.
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 141/141 transitions.
Graph (complete) has 314 edges and 104 vertex of which 103 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 103 transition count 139
Applied a total of 3 rules in 15 ms. Remains 103 /104 variables (removed 1) and now considering 139/141 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 103/104 places, 139/141 transitions.
RANDOM walk for 40000 steps (8974 resets) in 684 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1853 resets) in 360 ms. (110 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1889 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 323245 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 3
Probabilistic random walk after 323245 steps, saw 139323 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
// Phase 1: matrix 139 rows 103 cols
[2024-06-01 14:28:28] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 14:28:28] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 6/242 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 6/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 3 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 96/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 24/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 137/236 variables, 94/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 6/242 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/242 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 176 constraints, problems are : Problem set: 0 solved, 3 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 17930 ms.
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 103/103 places, 139/139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 139/139 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 139/139 (removed 0) transitions.
[2024-06-01 14:28:47] [INFO ] Invariant cache hit.
[2024-06-01 14:28:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 14:28:47] [INFO ] Invariant cache hit.
[2024-06-01 14:28:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 14:28:47] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-06-01 14:28:47] [INFO ] Redundant transitions in 0 ms returned []
Running 138 sub problems to find dead transitions.
[2024-06-01 14:28:47] [INFO ] Invariant cache hit.
[2024-06-01 14:28:47] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 173 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6443 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/242 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 67/173 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 138/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 311 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12549 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 103/103 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 19243ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 19246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19660 ms. Remains : 103/103 places, 139/139 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 103 transition count 132
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 97 transition count 132
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 97 transition count 117
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 82 transition count 117
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 57 place count 75 transition count 110
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 59 place count 74 transition count 119
Applied a total of 59 rules in 12 ms. Remains 74 /103 variables (removed 29) and now considering 119/139 (removed 20) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 119 rows 74 cols
[2024-06-01 14:29:07] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 14:29:07] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 14:29:07] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 14:29:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 14:29:07] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 14:29:07] [INFO ] After 255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 14:29:07] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 620 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p0), (X (NOT (AND (NOT p2) p0 p1))), (X (AND p2 p0 p1)), (X p1), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR (NOT p1) p2 (NOT p0))))]
Knowledge based reduction with 11 factoid took 385 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), false, false]
Product exploration explored 100000 steps with 22480 reset in 181 ms.
Product exploration explored 100000 steps with 22341 reset in 203 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 141/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 104 cols
[2024-06-01 14:29:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 14:29:09] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 14:29:09] [INFO ] Invariant cache hit.
[2024-06-01 14:29:09] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-01 14:29:10] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-06-01 14:29:10] [INFO ] Redundant transitions in 1 ms returned []
Running 140 sub problems to find dead transitions.
[2024-06-01 14:29:10] [INFO ] Invariant cache hit.
[2024-06-01 14:29:10] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 177 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6671 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 141/245 variables, 104/108 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 140/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (OVERLAPS) 0/245 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/245 variables, and 317 constraints, problems are : Problem set: 0 solved, 140 unsolved in 11960 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 104/104 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 0/0 constraints]
After SMT, in 18879ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 18884ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19545 ms. Remains : 104/104 places, 141/141 transitions.
Treatment of property SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 finished in 206781 ms.
[2024-06-01 14:29:29] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:29:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 14:29:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 492 transitions and 1945 arcs took 15 ms.
Total runtime 1191648 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d2m96-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717252194691

--------------------
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-d2m96-LTLFireability-00
ltl formula formula --ltl=/tmp/2811/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 178 places, 492 transitions and 1945 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2811/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.020 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2811/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2811/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2811/ltl_0_
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 180 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 179, there are 508 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): ~248 levels ~10000 states ~23224 transitions
pnml2lts-mc( 3/ 4): ~258 levels ~20000 states ~44228 transitions
pnml2lts-mc( 3/ 4): ~864 levels ~40000 states ~96220 transitions
pnml2lts-mc( 3/ 4): ~2073 levels ~80000 states ~203040 transitions
pnml2lts-mc( 3/ 4): ~3222 levels ~160000 states ~392492 transitions
pnml2lts-mc( 3/ 4): ~7296 levels ~320000 states ~814068 transitions
pnml2lts-mc( 3/ 4): ~13294 levels ~640000 states ~1612380 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~15936!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 710412
pnml2lts-mc( 0/ 4): unique states count: 753656
pnml2lts-mc( 0/ 4): unique transitions count: 1748556
pnml2lts-mc( 0/ 4): - self-loop count: 642192
pnml2lts-mc( 0/ 4): - claim dead count: 90520
pnml2lts-mc( 0/ 4): - claim found count: 9201
pnml2lts-mc( 0/ 4): - claim success count: 753764
pnml2lts-mc( 0/ 4): - cum. max stack depth: 42599
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 753784 states 1749263 transitions, fanout: 2.321
pnml2lts-mc( 0/ 4): Total exploration time 6.110 sec (6.110 sec minimum, 6.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123369, Transitions per second: 286295
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 12.6MB, 13.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 12.6MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d2m96-LTLFireability-08
ltl formula formula --ltl=/tmp/2811/ltl_1_
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 178 places, 492 transitions and 1945 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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2811/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2811/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2811/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2811/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 180 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 179, there are 497 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( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 26
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26 states 32 transitions, fanout: 1.231
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, 68.8 B/state, compr.: 9.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 504 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-d2m96-LTLFireability-10
ltl formula formula --ltl=/tmp/2811/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 178 places, 492 transitions and 1945 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( 1/ 4): LTL layer: formula: /tmp/2811/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2811/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2811/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2811/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 179 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 179, there are 508 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): ~48 levels ~10000 states ~25240 transitions
pnml2lts-mc( 1/ 4): ~156 levels ~20000 states ~53384 transitions
pnml2lts-mc( 1/ 4): ~545 levels ~40000 states ~124512 transitions
pnml2lts-mc( 3/ 4): ~1753 levels ~80000 states ~254308 transitions
pnml2lts-mc( 3/ 4): ~3499 levels ~160000 states ~510236 transitions
pnml2lts-mc( 3/ 4): ~4926 levels ~320000 states ~964096 transitions
pnml2lts-mc( 3/ 4): ~5678 levels ~640000 states ~1817624 transitions
pnml2lts-mc( 3/ 4): ~7582 levels ~1280000 states ~3573608 transitions
pnml2lts-mc( 2/ 4): ~5927 levels ~2560000 states ~7876172 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~5913!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2537890
pnml2lts-mc( 0/ 4): unique states count: 2577079
pnml2lts-mc( 0/ 4): unique transitions count: 7776256
pnml2lts-mc( 0/ 4): - self-loop count: 1874078
pnml2lts-mc( 0/ 4): - claim dead count: 2852202
pnml2lts-mc( 0/ 4): - claim found count: 12607
pnml2lts-mc( 0/ 4): - claim success count: 2577239
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2577239 states 7777460 transitions, fanout: 3.018
pnml2lts-mc( 0/ 4): Total exploration time 17.960 sec (17.960 sec minimum, 17.960 sec on average)
pnml2lts-mc( 0/ 4): States per second: 143499, Transitions per second: 433043
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 37.4MB, 13.1 B/state, compr.: 1.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 37.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-d2m96"
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-d2m96, 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-171683810800140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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