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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 12 19:26 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 57K 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-d0m06-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717241582815

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-d0m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:33:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 11:33:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:33:05] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-06-01 11:33:05] [INFO ] Transformed 262 places.
[2024-06-01 11:33:05] [INFO ] Transformed 73 transitions.
[2024-06-01 11:33:05] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 68 transition count 71
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 68 transition count 71
Applied a total of 6 rules in 36 ms. Remains 68 /72 variables (removed 4) and now considering 71/73 (removed 2) transitions.
// Phase 1: matrix 71 rows 68 cols
[2024-06-01 11:33:05] [INFO ] Computed 5 invariants in 25 ms
[2024-06-01 11:33:06] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-06-01 11:33:06] [INFO ] Invariant cache hit.
[2024-06-01 11:33:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-01 11:33:06] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-06-01 11:33:06] [INFO ] Invariant cache hit.
[2024-06-01 11:33:06] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 34 ms to minimize.
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:33:07] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:33:08] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:33:08] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:33:09] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 108 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4966 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/68 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 71/139 variables, 68/79 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 29/108 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 70/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-06-01 11:33:13] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5530 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 7/7 constraints]
After SMT, in 10769ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 10792ms
Starting structural reductions in LTL mode, iteration 1 : 68/72 places, 71/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11574 ms. Remains : 68/72 places, 71/73 transitions.
Support contains 29 out of 68 places after structural reductions.
[2024-06-01 11:33:17] [INFO ] Flatten gal took : 58 ms
[2024-06-01 11:33:17] [INFO ] Flatten gal took : 31 ms
[2024-06-01 11:33:17] [INFO ] Input system was already deterministic with 71 transitions.
RANDOM walk for 40000 steps (9027 resets) in 3606 ms. (11 steps per ms) remains 17/24 properties
BEST_FIRST walk for 4002 steps (201 resets) in 78 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (193 resets) in 77 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (124 resets) in 69 ms. (57 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (400 resets) in 92 ms. (43 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (389 resets) in 79 ms. (50 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (191 resets) in 50 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (396 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (181 resets) in 54 ms. (72 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4000 steps (390 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (188 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (183 resets) in 92 ms. (43 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (126 resets) in 50 ms. (78 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (415 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (419 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (208 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (193 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
[2024-06-01 11:33:19] [INFO ] Invariant cache hit.
[2024-06-01 11:33:19] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/55 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 3 (OVERLAPS) 8/63 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-06-01 11:33:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 70/133 variables, 63/69 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 28/97 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/97 constraints. Problems are: Problem set: 3 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/139 variables, 5/102 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/103 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 103 constraints, problems are : Problem set: 3 solved, 12 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 35/52 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 10/62 variables, 3/5 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 70/132 variables, 62/68 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 28/96 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 3/99 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 7/139 variables, 6/105 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 1/106 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 9/115 constraints. Problems are: Problem set: 3 solved, 12 unsolved
[2024-06-01 11:33:21] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 8 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 1/116 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/139 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 116 constraints, problems are : Problem set: 3 solved, 12 unsolved in 1314 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 68/68 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 12/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 2261ms problems are : Problem set: 3 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 3419 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 66 transition count 69
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 66 transition count 69
Applied a total of 4 rules in 14 ms. Remains 66 /68 variables (removed 2) and now considering 69/71 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 66/68 places, 69/71 transitions.
RANDOM walk for 40000 steps (8926 resets) in 264 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1929 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1219 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (4093 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (4131 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4145 resets) in 80 ms. (493 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1916 resets) in 52 ms. (754 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1892 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (4231 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (4051 resets) in 108 ms. (366 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1950 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (2019 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
Probably explored full state space saw : 24707 states, properties seen :11
Probabilistic random walk after 63878 steps, saw 24707 distinct states, run finished after 169 ms. (steps per millisecond=377 ) properties seen :11
Explored full state space saw : 24707 states, properties seen :0
Exhaustive walk after 63878 steps, saw 24707 distinct states, run finished after 51 ms. (steps per millisecond=1252 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 12 stable transitions
Graph (complete) has 208 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 25 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-06-01 11:33:26] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 11:33:26] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 11:33:26] [INFO ] Invariant cache hit.
[2024-06-01 11:33:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:33:27] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-01 11:33:27] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:33:27] [INFO ] Invariant cache hit.
[2024-06-01 11:33:27] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 3 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:33:28] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6096ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6475 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-00 finished in 6861 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((G(p0) U !p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Applied a total of 12 rules in 8 ms. Remains 62 /68 variables (removed 6) and now considering 65/71 (removed 6) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-06-01 11:33:33] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 11:33:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 11:33:33] [INFO ] Invariant cache hit.
[2024-06-01 11:33:33] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:33:33] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 11:33:33] [INFO ] Invariant cache hit.
[2024-06-01 11:33:33] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:33:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:35] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3051 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:37] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 165 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4471 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 7604ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7608ms
Starting structural reductions in LTL mode, iteration 1 : 62/68 places, 65/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7950 ms. Remains : 62/68 places, 65/71 transitions.
Stuttering acceptance computed with spot in 290 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-02
Product exploration explored 100000 steps with 28592 reset in 471 ms.
Product exploration explored 100000 steps with 28579 reset in 278 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 103 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[p1, p1, p1, p1, true, (NOT p0)]
RANDOM walk for 40000 steps (8909 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4116 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4116 resets) in 276 ms. (144 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40001 steps (4110 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
[2024-06-01 11:33:43] [INFO ] Invariant cache hit.
[2024-06-01 11:33:43] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 3 (OVERLAPS) 12/50 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 11:33:43] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 56/106 variables, 50/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 17/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 21/127 variables, 12/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 9/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 94 constraints, problems are : Problem set: 1 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/38 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/50 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 56/106 variables, 50/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 17/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/106 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 21/127 variables, 12/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 9/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/127 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 95 constraints, problems are : Problem set: 1 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 279ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 65/65 transitions.
Graph (complete) has 172 edges and 62 vertex of which 61 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 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 60 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 60 transition count 62
Applied a total of 5 rules in 18 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 60/62 places, 62/65 transitions.
RANDOM walk for 40000 steps (8900 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4098 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 299 steps, run visited all 1 properties in 5 ms. (steps per millisecond=59 )
Probabilistic random walk after 299 steps, saw 162 distinct states, run finished after 12 ms. (steps per millisecond=24 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 193 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-06-01 11:33:44] [INFO ] Invariant cache hit.
[2024-06-01 11:33:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 11:33:44] [INFO ] Invariant cache hit.
[2024-06-01 11:33:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:33:44] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-06-01 11:33:44] [INFO ] Invariant cache hit.
[2024-06-01 11:33:44] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (OVERLAPS) 1/62 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:45] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:33:45] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:33:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:46] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:33:46] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:33:46] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:46] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/74 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 100 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3458 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-06-01 11:33:48] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/62 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 65/127 variables, 62/75 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 26/101 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 64/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 165 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4385 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 8/8 constraints]
After SMT, in 7922ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7924ms
Finished structural reductions in LTL mode , in 1 iterations and 8229 ms. Remains : 62/62 places, 65/65 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 193 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p1)]
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 196 ms :[p1, p1, p1, p1, true]
RANDOM walk for 40000 steps (8977 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4175 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 142 steps, run visited all 1 properties in 4 ms. (steps per millisecond=35 )
Probabilistic random walk after 142 steps, saw 84 distinct states, run finished after 4 ms. (steps per millisecond=35 ) properties seen :1
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 1 factoid took 133 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 209 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 209 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 216 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 28585 reset in 171 ms.
Product exploration explored 100000 steps with 28588 reset in 169 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 197 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 60 transition count 62
Applied a total of 5 rules in 17 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
[2024-06-01 11:33:54] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-06-01 11:33:54] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 11:33:54] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:33:55] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:33:55] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:33:55] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:33:55] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:33:56] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:33:56] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3346 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 157 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7438ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7440ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/62 places, 62/65 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7467 ms. Remains : 60/62 places, 62/65 transitions.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 65/65 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 60 transition count 62
Applied a total of 5 rules in 14 ms. Remains 60 /62 variables (removed 2) and now considering 62/65 (removed 3) transitions.
[2024-06-01 11:34:02] [INFO ] Invariant cache hit.
[2024-06-01 11:34:02] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 11:34:02] [INFO ] Invariant cache hit.
[2024-06-01 11:34:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:34:02] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-06-01 11:34:02] [INFO ] Invariant cache hit.
[2024-06-01 11:34:02] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:34:03] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3297 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 157 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4284 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7627ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7629ms
Starting structural reductions in LTL mode, iteration 1 : 60/62 places, 62/65 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7892 ms. Remains : 60/62 places, 62/65 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 finished in 36568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X((G(p1)||X(X(F(p2))))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 62 transition count 65
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 61 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 61 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 61 transition count 63
Applied a total of 15 rules in 9 ms. Remains 61 /68 variables (removed 7) and now considering 63/71 (removed 8) transitions.
// Phase 1: matrix 63 rows 61 cols
[2024-06-01 11:34:10] [INFO ] Computed 5 invariants in 11 ms
[2024-06-01 11:34:10] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 11:34:10] [INFO ] Invariant cache hit.
[2024-06-01 11:34:10] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:34:10] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-06-01 11:34:10] [INFO ] Invariant cache hit.
[2024-06-01 11:34:10] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 3 ms to minimize.
[2024-06-01 11:34:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 63/124 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 99 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3534 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 63/124 variables, 61/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 26/99 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 62/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 161 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 7/7 constraints]
After SMT, in 6997ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 6999ms
Starting structural reductions in LTL mode, iteration 1 : 61/68 places, 63/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7327 ms. Remains : 61/68 places, 63/71 transitions.
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-03 finished in 7858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 6 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-06-01 11:34:17] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 11:34:18] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 11:34:18] [INFO ] Invariant cache hit.
[2024-06-01 11:34:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:34:18] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-06-01 11:34:18] [INFO ] Invariant cache hit.
[2024-06-01 11:34:18] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-06-01 11:34:19] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3811 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7054ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7055ms
Starting structural reductions in LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7306 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-04 finished in 7401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 9 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-06-01 11:34:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 11:34:25] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 11:34:25] [INFO ] Invariant cache hit.
[2024-06-01 11:34:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:34:25] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 11:34:25] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-06-01 11:34:25] [INFO ] Invariant cache hit.
[2024-06-01 11:34:25] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:25] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:26] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:34:26] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:27] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:27] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-06-01 11:34:28] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3913 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3571 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7530ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7532ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7731 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-05
Product exploration explored 100000 steps with 22431 reset in 255 ms.
Product exploration explored 100000 steps with 22358 reset in 279 ms.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
RANDOM walk for 37360 steps (8330 resets) in 69 ms. (533 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-06-01 11:34:34] [INFO ] Invariant cache hit.
[2024-06-01 11:34:34] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 11:34:34] [INFO ] Invariant cache hit.
[2024-06-01 11:34:34] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:34:34] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-06-01 11:34:34] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-06-01 11:34:34] [INFO ] Invariant cache hit.
[2024-06-01 11:34:34] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:34] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:35] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:34:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:36] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:36] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:34:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4087 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3841 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 7966ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7968ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8190 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 185 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8895 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1894 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 144 steps, run visited all 1 properties in 5 ms. (steps per millisecond=28 )
Probabilistic random walk after 144 steps, saw 85 distinct states, run finished after 5 ms. (steps per millisecond=28 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22326 reset in 184 ms.
Product exploration explored 100000 steps with 22414 reset in 404 ms.
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-06-01 11:34:43] [INFO ] Invariant cache hit.
[2024-06-01 11:34:43] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-01 11:34:43] [INFO ] Invariant cache hit.
[2024-06-01 11:34:43] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:34:43] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-06-01 11:34:43] [INFO ] Redundant transitions in 2 ms returned []
Running 61 sub problems to find dead transitions.
[2024-06-01 11:34:43] [INFO ] Invariant cache hit.
[2024-06-01 11:34:43] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:44] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:44] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:34:44] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-01 11:34:46] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 4504 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
After SMT, in 8196ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 8198ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8526 ms. Remains : 60/60 places, 62/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 finished in 26760 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&&X(F(p1)))))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 5 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-06-01 11:34:52] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 11:34:52] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-01 11:34:52] [INFO ] Invariant cache hit.
[2024-06-01 11:34:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:34:52] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-06-01 11:34:52] [INFO ] Invariant cache hit.
[2024-06-01 11:34:52] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:34:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 97 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/97 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 61/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2779 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 7/7 constraints]
After SMT, in 5955ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 5956ms
Starting structural reductions in LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6194 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-09 finished in 6420 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(p0))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 11 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-06-01 11:34:58] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 11:34:58] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 11:34:58] [INFO ] Invariant cache hit.
[2024-06-01 11:34:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:34:58] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-01 11:34:58] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:34:58] [INFO ] Invariant cache hit.
[2024-06-01 11:34:58] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:34:59] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:34:59] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:34:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:34:59] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-06-01 11:34:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:35:00] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3286 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7121ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7504 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-10 finished in 7575 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)) U (p1 U p2)))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 60 transition count 62
Applied a total of 17 rules in 10 ms. Remains 60 /68 variables (removed 8) and now considering 62/71 (removed 9) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-06-01 11:35:06] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 11:35:06] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 11:35:06] [INFO ] Invariant cache hit.
[2024-06-01 11:35:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:35:06] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2024-06-01 11:35:06] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-06-01 11:35:06] [INFO ] Invariant cache hit.
[2024-06-01 11:35:06] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:35:06] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:35:07] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:35:07] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:35:07] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:35:07] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 62/122 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 25/95 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:35:08] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3651 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-06-01 11:35:10] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:35:10] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 62/122 variables, 60/73 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 25/98 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 61/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 159 constraints, problems are : Problem set: 0 solved, 61 unsolved in 3557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 8/8 constraints]
After SMT, in 7257ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 7259ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 62/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7558 ms. Remains : 60/68 places, 62/71 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-12 finished in 7741 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)&&F(p1))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 61 transition count 64
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 61 transition count 64
Applied a total of 14 rules in 9 ms. Remains 61 /68 variables (removed 7) and now considering 64/71 (removed 7) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-06-01 11:35:13] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 11:35:14] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 11:35:14] [INFO ] Invariant cache hit.
[2024-06-01 11:35:14] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 11:35:14] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-06-01 11:35:14] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2024-06-01 11:35:14] [INFO ] Invariant cache hit.
[2024-06-01 11:35:14] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 1/61 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 2 ms to minimize.
[2024-06-01 11:35:15] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 64/125 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 98 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 1/61 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 64/125 variables, 61/72 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 26/98 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 63/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 161 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3599 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 6/6 constraints]
After SMT, in 6700ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 6702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/68 places, 64/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7036 ms. Remains : 61/68 places, 64/71 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-13 finished in 7271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 6 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-06-01 11:35:21] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 11:35:21] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 11:35:21] [INFO ] Invariant cache hit.
[2024-06-01 11:35:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:35:21] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-01 11:35:21] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:35:21] [INFO ] Invariant cache hit.
[2024-06-01 11:35:21] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:35:22] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3461 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3733 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7231ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7232ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7435 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-14
Product exploration explored 100000 steps with 22297 reset in 173 ms.
Product exploration explored 100000 steps with 22223 reset in 231 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:35:29] [INFO ] Invariant cache hit.
[2024-06-01 11:35:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 11:35:29] [INFO ] Invariant cache hit.
[2024-06-01 11:35:29] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:35:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-01 11:35:29] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:35:29] [INFO ] Invariant cache hit.
[2024-06-01 11:35:29] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 2 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
[2024-06-01 11:35:30] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:31] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:35:31] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3715 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7098ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7100ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7317 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22433 reset in 139 ms.
Product exploration explored 100000 steps with 22455 reset in 512 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:35:37] [INFO ] Invariant cache hit.
[2024-06-01 11:35:37] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 11:35:37] [INFO ] Invariant cache hit.
[2024-06-01 11:35:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:35:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-01 11:35:38] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:35:38] [INFO ] Invariant cache hit.
[2024-06-01 11:35:38] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:38] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:35:38] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:35:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:35:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:35:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:39] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:35:39] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 7515ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 7516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7764 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 finished in 24516 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)&&F(G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 71/71 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 60 transition count 63
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 59 transition count 61
Applied a total of 19 rules in 13 ms. Remains 59 /68 variables (removed 9) and now considering 61/71 (removed 10) transitions.
[2024-06-01 11:35:45] [INFO ] Invariant cache hit.
[2024-06-01 11:35:45] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 11:35:45] [INFO ] Invariant cache hit.
[2024-06-01 11:35:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:35:45] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-01 11:35:45] [INFO ] Redundant transitions in 2 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:35:45] [INFO ] Invariant cache hit.
[2024-06-01 11:35:45] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:46] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:35:46] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 2 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-01 11:35:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3532 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3173 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6767ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6769ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/68 places, 61/71 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7101 ms. Remains : 59/68 places, 61/71 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m06-LTLFireability-15
Product exploration explored 100000 steps with 22441 reset in 196 ms.
Product exploration explored 100000 steps with 22320 reset in 218 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8968 resets) in 118 ms. (336 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (1885 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-06-01 11:35:53] [INFO ] Invariant cache hit.
[2024-06-01 11:35:53] [INFO ] State equation strengthened by 25 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) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:35:53] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 355ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 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 58 transition count 59
Applied a total of 3 rules in 8 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8901 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1961 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 7 ms. (steps per millisecond=165 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 7 ms. (steps per millisecond=165 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:35:54] [INFO ] Invariant cache hit.
[2024-06-01 11:35:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 11:35:54] [INFO ] Invariant cache hit.
[2024-06-01 11:35:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:35:54] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-06-01 11:35:54] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:35:54] [INFO ] Invariant cache hit.
[2024-06-01 11:35:54] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:35:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-06-01 11:35:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3438 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 6562ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 6563ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6875 ms. Remains : 59/59 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 183 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8897 resets) in 57 ms. (689 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40001 steps (1961 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-06-01 11:36:01] [INFO ] Invariant cache hit.
[2024-06-01 11:36:01] [INFO ] State equation strengthened by 25 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) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:36:01] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/120 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/44 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 53/101 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 19/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 8/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 61/61 transitions.
Graph (complete) has 162 edges and 59 vertex of which 58 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 58 transition count 59
Applied a total of 3 rules in 5 ms. Remains 58 /59 variables (removed 1) and now considering 59/61 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 58/59 places, 59/61 transitions.
RANDOM walk for 40000 steps (8863 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1928 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1161 steps, run visited all 1 properties in 6 ms. (steps per millisecond=193 )
Probabilistic random walk after 1161 steps, saw 569 distinct states, run finished after 6 ms. (steps per millisecond=193 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 22427 reset in 189 ms.
Product exploration explored 100000 steps with 22351 reset in 210 ms.
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-01 11:36:03] [INFO ] Invariant cache hit.
[2024-06-01 11:36:03] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-01 11:36:03] [INFO ] Invariant cache hit.
[2024-06-01 11:36:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:36:03] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-06-01 11:36:03] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-06-01 11:36:03] [INFO ] Invariant cache hit.
[2024-06-01 11:36:03] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 2 ms to minimize.
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:36:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 96 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2843 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 60/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 156 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 7/7 constraints]
After SMT, in 5932ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5934ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6301 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 finished in 23762 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((G(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' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2024-06-01 11:36:10] [INFO ] Flatten gal took : 13 ms
[2024-06-01 11:36:10] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-01 11:36:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 71 transitions and 281 arcs took 8 ms.
Total runtime 185260 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA SieveSingleMsgMbox-PT-d0m06-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717241771090

--------------------
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-d0m06-LTLFireability-02
ltl formula formula --ltl=/tmp/1910/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 68 places, 71 transitions and 281 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/1910/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 70 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 84 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: 7
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 6
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 28 transitions, fanout: 1.400
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 2000, Transitions per second: 2800
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, 62.9 B/state, compr.: 22.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 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-d0m06-LTLFireability-05
ltl formula formula --ltl=/tmp/1910/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 68 places, 71 transitions and 281 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 77 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~85!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3176
pnml2lts-mc( 0/ 4): unique states count: 3442
pnml2lts-mc( 0/ 4): unique transitions count: 9201
pnml2lts-mc( 0/ 4): - self-loop count: 3470
pnml2lts-mc( 0/ 4): - claim dead count: 1869
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 3623
pnml2lts-mc( 0/ 4): - cum. max stack depth: 367
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3623 states 9830 transitions, fanout: 2.713
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 90575, Transitions per second: 245750
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, 11.2 B/state, compr.: 4.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 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-d0m06-LTLFireability-14
ltl formula formula --ltl=/tmp/1910/ltl_2_
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 68 places, 71 transitions and 281 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/1910/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 77 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): ~152 levels ~10000 states ~30452 transitions
pnml2lts-mc( 3/ 4): ~152 levels ~20000 states ~61400 transitions
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: 23500
pnml2lts-mc( 0/ 4): unique states count: 24708
pnml2lts-mc( 0/ 4): unique transitions count: 73540
pnml2lts-mc( 0/ 4): - self-loop count: 32259
pnml2lts-mc( 0/ 4): - claim dead count: 18920
pnml2lts-mc( 0/ 4): - claim found count: 1694
pnml2lts-mc( 0/ 4): - claim success count: 26732
pnml2lts-mc( 0/ 4): - cum. max stack depth: 534
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27112 states 84370 transitions, fanout: 3.112
pnml2lts-mc( 0/ 4): Total exploration time 0.240 sec (0.240 sec minimum, 0.240 sec on average)
pnml2lts-mc( 0/ 4): States per second: 112967, Transitions per second: 351542
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 9.6 B/state, compr.: 3.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name SieveSingleMsgMbox-PT-d0m06-LTLFireability-15
ltl formula formula --ltl=/tmp/1910/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 68 places, 71 transitions and 281 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1910/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1910/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1910/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1910/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 69 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 69, there are 81 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):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~87!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2176
pnml2lts-mc( 0/ 4): unique states count: 2475
pnml2lts-mc( 0/ 4): unique transitions count: 5426
pnml2lts-mc( 0/ 4): - self-loop count: 1473
pnml2lts-mc( 0/ 4): - claim dead count: 854
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2605
pnml2lts-mc( 0/ 4): - cum. max stack depth: 407
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2605 states 5874 transitions, fanout: 2.255
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 86833, Transitions per second: 195800
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, 12.1 B/state, compr.: 4.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 71 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)

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-d0m06"
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-d0m06, 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-171683810600012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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