Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r377-smll-171683809500028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is SieveSingleMsgMbox-PT-d0m36, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809500028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 19:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 19:34 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-d0m36-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716880322443

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:12:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 07:12:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:12:04] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-28 07:12:04] [INFO ] Transformed 262 places.
[2024-05-28 07:12:04] [INFO ] Transformed 73 transitions.
[2024-05-28 07:12:04] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 64 transition count 67
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 64 transition count 67
Applied a total of 14 rules in 50 ms. Remains 64 /72 variables (removed 8) and now considering 67/73 (removed 6) transitions.
// Phase 1: matrix 67 rows 64 cols
[2024-05-28 07:12:04] [INFO ] Computed 5 invariants in 19 ms
[2024-05-28 07:12:05] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-28 07:12:05] [INFO ] Invariant cache hit.
[2024-05-28 07:12:05] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 07:12:05] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-28 07:12:05] [INFO ] Invariant cache hit.
[2024-05-28 07:12:05] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-28 07:12:06] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 16 ms to minimize.
[2024-05-28 07:12:06] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/131 variables, 64/71 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/131 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 97 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2818 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 67/131 variables, 64/71 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 26/97 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 66/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 163 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2707 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 2/2 constraints]
After SMT, in 5707ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 5754ms
Starting structural reductions in LTL mode, iteration 1 : 64/72 places, 67/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6394 ms. Remains : 64/72 places, 67/73 transitions.
Support contains 21 out of 64 places after structural reductions.
[2024-05-28 07:12:11] [INFO ] Flatten gal took : 40 ms
[2024-05-28 07:12:11] [INFO ] Flatten gal took : 18 ms
[2024-05-28 07:12:11] [INFO ] Input system was already deterministic with 67 transitions.
Reduction of identical properties reduced properties to check from 21 to 16
RANDOM walk for 40000 steps (8915 resets) in 2329 ms. (17 steps per ms) remains 10/16 properties
BEST_FIRST walk for 40003 steps (1952 resets) in 562 ms. (71 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1917 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1918 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (4216 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1968 resets) in 116 ms. (341 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40001 steps (4151 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (1935 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1913 resets) in 104 ms. (380 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (4007 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
[2024-05-28 07:12:12] [INFO ] Invariant cache hit.
[2024-05-28 07:12:12] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/55 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 07:12:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
[2024-05-28 07:12:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 62/117 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 14/131 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 07:12:13] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-28 07:12:13] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 07:12:13] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/131 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 100 constraints, problems are : Problem set: 0 solved, 9 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 32/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 11/55 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 62/117 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 21/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 14/131 variables, 9/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/131 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/131 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 109 constraints, problems are : Problem set: 0 solved, 9 unsolved in 514 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 64/64 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 1314ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 22587 ms.
Support contains 12 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 65
Applied a total of 4 rules in 16 ms. Remains 62 /64 variables (removed 2) and now considering 65/67 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 62/64 places, 65/67 transitions.
RANDOM walk for 40000 steps (9050 resets) in 258 ms. (154 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (1965 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1979 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4204 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1887 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (4194 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (1919 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (1969 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4184 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
Finished probabilistic random walk after 1406 steps, run visited all 9 properties in 22 ms. (steps per millisecond=63 )
Probabilistic random walk after 1406 steps, saw 711 distinct states, run finished after 28 ms. (steps per millisecond=50 ) properties seen :9
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 199 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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((X(p0)&&(p1||G(F(((!p1&&X(!p0))||G(!p0))))))))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Applied a total of 8 rules in 5 ms. Remains 60 /64 variables (removed 4) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 60 cols
[2024-05-28 07:12:37] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 07:12:37] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-28 07:12:37] [INFO ] Invariant cache hit.
[2024-05-28 07:12:37] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 07:12:38] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-28 07:12:38] [INFO ] Invariant cache hit.
[2024-05-28 07:12:38] [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, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-28 07:12:38] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-05-28 07:12:38] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/123 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 93 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1885 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: 62/62 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 63/123 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 62/155 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 155 constraints, problems are : Problem set: 0 solved, 62 unsolved in 2323 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: 62/62 constraints, Known Traps: 2/2 constraints]
After SMT, in 4278ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 4280ms
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 63/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4551 ms. Remains : 60/64 places, 63/67 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-00
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 2 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-00 finished in 4921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p1&&X((X(F(!p2))||G(!p1))))||p0))))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 13 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 07:12:42] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:12:42] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 07:12:42] [INFO ] Invariant cache hit.
[2024-05-28 07:12:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:12:42] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 07:12:42] [INFO ] Invariant cache hit.
[2024-05-28 07:12:42] [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-05-28 07:12:43] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2024-05-28 07:12:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1952 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2171 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: 2/2 constraints]
After SMT, in 4187ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4189ms
Starting structural reductions in LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4453 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 351 ms.
Product exploration explored 100000 steps with 50000 reset in 228 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 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-02 finished in 5295 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 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 17 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
[2024-05-28 07:12:47] [INFO ] Invariant cache hit.
[2024-05-28 07:12:47] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 07:12:48] [INFO ] Invariant cache hit.
[2024-05-28 07:12:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:12:48] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-28 07:12:48] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:12:48] [INFO ] Invariant cache hit.
[2024-05-28 07:12:48] [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-05-28 07:12:48] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 07:12:48] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1892 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2105 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: 2/2 constraints]
After SMT, in 4048ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4050ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4328 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-03
Product exploration explored 100000 steps with 22395 reset in 263 ms.
Product exploration explored 100000 steps with 22330 reset in 208 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8857 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1882 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1213 steps, run visited all 1 properties in 8 ms. (steps per millisecond=151 )
Probabilistic random walk after 1213 steps, saw 597 distinct states, run finished after 8 ms. (steps per millisecond=151 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 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 35 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 6 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 07:12:53] [INFO ] Invariant cache hit.
[2024-05-28 07:12:53] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 07:12:53] [INFO ] Invariant cache hit.
[2024-05-28 07:12:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:12:53] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-28 07:12:53] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:12:53] [INFO ] Invariant cache hit.
[2024-05-28 07:12:53] [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-05-28 07:12:54] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-05-28 07:12:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1766 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2130 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: 2/2 constraints]
After SMT, in 3940ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3942ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4182 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8895 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1930 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1213 steps, run visited all 1 properties in 9 ms. (steps per millisecond=134 )
Probabilistic random walk after 1213 steps, saw 597 distinct states, run finished after 9 ms. (steps per millisecond=134 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22330 reset in 103 ms.
Product exploration explored 100000 steps with 22242 reset in 117 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 9 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 07:12:58] [INFO ] Invariant cache hit.
[2024-05-28 07:12:58] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 07:12:58] [INFO ] Invariant cache hit.
[2024-05-28 07:12:58] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:12:58] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-28 07:12:58] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:12:58] [INFO ] Invariant cache hit.
[2024-05-28 07:12: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-05-28 07:12:58] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:12:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1877 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2127 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: 2/2 constraints]
After SMT, in 4044ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4290 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 finished in 14516 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((F(p1)&&p0)))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 13 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
[2024-05-28 07:13:02] [INFO ] Invariant cache hit.
[2024-05-28 07:13:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 07:13:02] [INFO ] Invariant cache hit.
[2024-05-28 07:13:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:02] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-28 07:13:02] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:13:02] [INFO ] Invariant cache hit.
[2024-05-28 07:13:02] [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-05-28 07:13:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-05-28 07:13:03] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1864 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2147 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: 2/2 constraints]
After SMT, in 4047ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4049ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4300 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-05 finished in 4476 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))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 12 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
[2024-05-28 07:13:06] [INFO ] Invariant cache hit.
[2024-05-28 07:13:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 07:13:06] [INFO ] Invariant cache hit.
[2024-05-28 07:13:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:07] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-28 07:13:07] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:13:07] [INFO ] Invariant cache hit.
[2024-05-28 07:13:07] [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-05-28 07:13:07] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:13:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1843 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2073 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: 2/2 constraints]
After SMT, in 3955ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4164 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-06 finished in 4216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 9 place count 60 transition count 62
Applied a total of 9 rules in 16 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 07:13:11] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 07:13:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 07:13:11] [INFO ] Invariant cache hit.
[2024-05-28 07:13:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:11] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-28 07:13:11] [INFO ] Redundant transitions in 0 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 07:13:11] [INFO ] Invariant cache hit.
[2024-05-28 07:13:11] [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-05-28 07:13:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-05-28 07:13:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1824 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2102 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: 2/2 constraints]
After SMT, in 3965ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3967ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4213 ms. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-07
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-07 finished in 4297 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 (G(p2)&&p1)))'
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 62 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 65
Applied a total of 4 rules in 6 ms. Remains 62 /64 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 62 cols
[2024-05-28 07:13:15] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:13:15] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 07:13:15] [INFO ] Invariant cache hit.
[2024-05-28 07:13:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 07:13:15] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-28 07:13:15] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2024-05-28 07:13:15] [INFO ] Invariant cache hit.
[2024-05-28 07:13:15] [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-05-28 07:13:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:13:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 95 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2032 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 65/127 variables, 62/69 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 26/95 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 64/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 159 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2623 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: 2/2 constraints]
After SMT, in 4697ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 4698ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/64 places, 65/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4953 ms. Remains : 62/64 places, 65/67 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-08 finished in 5128 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 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 9 place count 60 transition count 62
Applied a total of 9 rules in 11 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 07:13:20] [INFO ] Computed 5 invariants in 3 ms
[2024-05-28 07:13:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 07:13:20] [INFO ] Invariant cache hit.
[2024-05-28 07:13:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:20] [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-05-28 07:13:20] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 07:13:20] [INFO ] Invariant cache hit.
[2024-05-28 07:13:20] [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-05-28 07:13:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 07:13:21] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1883 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2254 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: 2/2 constraints]
After SMT, in 4174ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4403 ms. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-09 finished in 4527 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 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 60 transition count 63
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 11 place count 59 transition count 61
Applied a total of 11 rules in 13 ms. Remains 59 /64 variables (removed 5) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 07:13:25] [INFO ] Computed 5 invariants in 2 ms
[2024-05-28 07:13:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 07:13:25] [INFO ] Invariant cache hit.
[2024-05-28 07:13:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-28 07:13:25] [INFO ] Redundant transitions in 0 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:13:25] [INFO ] Invariant cache hit.
[2024-05-28 07:13:25] [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-05-28 07:13:25] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 07:13:25] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1882 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2058 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: 2/2 constraints]
After SMT, in 3978ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3979ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/64 places, 61/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4224 ms. Remains : 59/64 places, 61/67 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-11
Product exploration explored 100000 steps with 22440 reset in 120 ms.
Product exploration explored 100000 steps with 22391 reset in 123 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 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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)]
RANDOM walk for 40000 steps (8928 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1904 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 4 ms. (steps per millisecond=72 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 4 ms. (steps per millisecond=72 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 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 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 07:13:29] [INFO ] Invariant cache hit.
[2024-05-28 07:13:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 07:13:30] [INFO ] Invariant cache hit.
[2024-05-28 07:13:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:30] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-28 07:13:30] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:13:30] [INFO ] Invariant cache hit.
[2024-05-28 07:13:30] [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-05-28 07:13:30] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 07:13:30] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1838 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2111 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: 2/2 constraints]
After SMT, in 3990ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3991ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4230 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8957 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1923 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 288 steps, run visited all 1 properties in 4 ms. (steps per millisecond=72 )
Probabilistic random walk after 288 steps, saw 153 distinct states, run finished after 4 ms. (steps per millisecond=72 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22382 reset in 108 ms.
Product exploration explored 100000 steps with 22288 reset in 181 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 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-28 07:13:34] [INFO ] Invariant cache hit.
[2024-05-28 07:13:34] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 07:13:34] [INFO ] Invariant cache hit.
[2024-05-28 07:13:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:35] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-28 07:13:35] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:13:35] [INFO ] Invariant cache hit.
[2024-05-28 07:13:35] [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-05-28 07:13:35] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:13:35] [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, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1829 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2134 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: 2/2 constraints]
After SMT, in 4006ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4007ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4241 ms. Remains : 59/59 places, 61/61 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 finished in 14068 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&&F(p1)))&&X(G(p2))))'
Support contains 5 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 9 place count 60 transition count 62
Applied a total of 9 rules in 4 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 07:13:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:13:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 07:13:39] [INFO ] Invariant cache hit.
[2024-05-28 07:13:39] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:39] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 07:13:39] [INFO ] Invariant cache hit.
[2024-05-28 07:13:39] [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-05-28 07:13:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 07:13:39] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1856 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2187 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: 2/2 constraints]
After SMT, in 4085ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4087ms
Starting structural reductions in LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4283 ms. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-12
Product exploration explored 100000 steps with 22544 reset in 174 ms.
Product exploration explored 100000 steps with 22426 reset in 217 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 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 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (AND p0 p2))), (X p1), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 136 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
RANDOM walk for 40000 steps (8901 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4213 resets) in 41 ms. (952 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 5 ms. (steps per millisecond=28 ) properties seen :1
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (AND (NOT p0) p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p1 p2)), (X (NOT p0)), (X (NOT (AND p0 p2))), (X p1), (X (X p2)), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 17 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-12 finished in 5280 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(p0)&&G((G(p2)||p1))))'
Support contains 7 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Applied a total of 6 rules in 2 ms. Remains 61 /64 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-28 07:13:44] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:13:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 07:13:44] [INFO ] Invariant cache hit.
[2024-05-28 07:13:44] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 07:13:44] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-28 07:13:44] [INFO ] Invariant cache hit.
[2024-05-28 07:13:44] [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-05-28 07:13:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:13:45] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 94 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1944 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 63/157 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 157 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2051 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: 2/2 constraints]
After SMT, in 4037ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4040ms
Starting structural reductions in LTL mode, iteration 1 : 61/64 places, 64/67 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4274 ms. Remains : 61/64 places, 64/67 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-13
Product exploration explored 100000 steps with 31064 reset in 129 ms.
Product exploration explored 100000 steps with 31001 reset in 145 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 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 p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 130 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (8971 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1950 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4067 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1974 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4050 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2645828 steps, run timeout after 3001 ms. (steps per millisecond=881 ) properties seen :3 out of 4
Probabilistic random walk after 2645828 steps, saw 1199715 distinct states, run finished after 3007 ms. (steps per millisecond=879 ) properties seen :3
[2024-05-28 07:13:52] [INFO ] Invariant cache hit.
[2024-05-28 07:13:52] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 51/125 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/61 constraints, ReadFeed: 0/26 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 255 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 81 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 61 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-28 07:13:53] [INFO ] Invariant cache hit.
[2024-05-28 07:13:53] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 07:13:53] [INFO ] Invariant cache hit.
[2024-05-28 07:13:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 07:13:53] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-28 07:13:53] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
[2024-05-28 07:13:53] [INFO ] Invariant cache hit.
[2024-05-28 07:13:53] [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-05-28 07:13:53] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 07:13:53] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/125 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 94 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1892 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 64/125 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 26/94 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 63/157 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 157 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2176 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: 2/2 constraints]
After SMT, in 4115ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 4117ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4340 ms. Remains : 61/61 places, 64/64 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 190 edges and 61 vertex of which 60 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 p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 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 80 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (8910 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4117 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1902 resets) in 63 ms. (625 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (1934 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
[2024-05-28 07:13:57] [INFO ] Invariant cache hit.
[2024-05-28 07:13:57] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
At refinement iteration 5 (OVERLAPS) 12/51 variables, 3/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/108 variables, 51/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 19/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/125 variables, 10/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 7/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 92 constraints, problems are : Problem set: 1 solved, 1 unsolved in 96 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: 2/2 constraints, Known Traps: 0/0 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) 29/31 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/45 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/50 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 57/107 variables, 50/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 19/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/125 variables, 11/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 7/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 1/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/125 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 93 constraints, problems are : Problem set: 1 solved, 1 unsolved in 115 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: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 64/64 transitions.
Graph (complete) has 169 edges and 61 vertex of which 60 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 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 58 transition count 59
Applied a total of 8 rules in 11 ms. Remains 58 /61 variables (removed 3) and now considering 59/64 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 58/61 places, 59/64 transitions.
RANDOM walk for 40000 steps (8899 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1989 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 364 steps, run visited all 1 properties in 4 ms. (steps per millisecond=91 )
Probabilistic random walk after 364 steps, saw 208 distinct states, run finished after 4 ms. (steps per millisecond=91 ) properties seen :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p2))]
Knowledge based reduction with 10 factoid took 296 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 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 22493 reset in 124 ms.
Product exploration explored 100000 steps with 22334 reset in 130 ms.
Support contains 4 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 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 5 place count 59 transition count 61
Applied a total of 5 rules in 6 ms. Remains 59 /61 variables (removed 2) and now considering 61/64 (removed 3) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 07:13:59] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:13:59] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 07:13:59] [INFO ] Invariant cache hit.
[2024-05-28 07:13:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:13:59] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-28 07:13:59] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:13:59] [INFO ] Invariant cache hit.
[2024-05-28 07:13:59] [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-05-28 07:13:59] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
[2024-05-28 07:13:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1802 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2094 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: 2/2 constraints]
After SMT, in 3931ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3932ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/61 places, 61/64 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4159 ms. Remains : 59/61 places, 61/64 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 finished in 18775 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&&(X(G(p2))||p1)))))'
Support contains 4 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 67/67 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 61 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 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 9 place count 60 transition count 62
Applied a total of 9 rules in 9 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 07:14:03] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:14:03] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-28 07:14:03] [INFO ] Invariant cache hit.
[2024-05-28 07:14:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:14:03] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-28 07:14:03] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 07:14:03] [INFO ] Invariant cache hit.
[2024-05-28 07:14:03] [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-05-28 07:14:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 07:14:04] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1863 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2239 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: 2/2 constraints]
After SMT, in 4144ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 4145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/64 places, 62/67 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4401 ms. Remains : 60/64 places, 62/67 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m36-LTLFireability-14
Product exploration explored 100000 steps with 22306 reset in 118 ms.
Product exploration explored 100000 steps with 22375 reset in 126 ms.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 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 7 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (AND p1 p0)), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 140 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (8957 resets) in 149 ms. (266 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4096 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4084 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4087 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4108 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (4125 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4132 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4156 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 715433 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :5 out of 7
Probabilistic random walk after 715433 steps, saw 367642 distinct states, run finished after 3001 ms. (steps per millisecond=238 ) properties seen :5
[2024-05-28 07:14:11] [INFO ] Invariant cache hit.
[2024-05-28 07:14:11] [INFO ] State equation strengthened by 25 read => feed constraints.
Problem apf1 is UNSAT
Problem apf4 is UNSAT
After SMT solving in domain Real declared 4/122 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 0/3 constraints, State Equation: 0/60 constraints, ReadFeed: 0/25 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (AND p1 p0)), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p0), (X (NOT (AND p0 p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 p0))), (X (X (OR (AND p1 (NOT p2)) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 p2)))), (X (X p1)), (G (OR (NOT p0) p2 p1)), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 19 factoid took 355 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 62/62 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-28 07:14:12] [INFO ] Invariant cache hit.
[2024-05-28 07:14:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 07:14:12] [INFO ] Invariant cache hit.
[2024-05-28 07:14:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:14:12] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-28 07:14:12] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-28 07:14:12] [INFO ] Invariant cache hit.
[2024-05-28 07:14:12] [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-05-28 07:14:12] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-05-28 07:14:12] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 92 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1799 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 25/92 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 61/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 153 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2070 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: 2/2 constraints]
After SMT, in 3912ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3913ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4118 ms. Remains : 60/60 places, 62/62 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 186 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 7 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 32 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8908 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4074 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 286 steps, run visited all 1 properties in 4 ms. (steps per millisecond=71 )
Probabilistic random walk after 286 steps, saw 152 distinct states, run finished after 4 ms. (steps per millisecond=71 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22314 reset in 92 ms.
Product exploration explored 100000 steps with 22403 reset in 115 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.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 61
Applied a total of 2 rules in 3 ms. Remains 59 /60 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 07:14:16] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 07:14:16] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 07:14:16] [INFO ] Invariant cache hit.
[2024-05-28 07:14:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 07:14:16] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-28 07:14:17] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
[2024-05-28 07:14:17] [INFO ] Invariant cache hit.
[2024-05-28 07:14:17] [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-05-28 07:14:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 07:14:17] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1745 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: 2/2 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, 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
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1939 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: 2/2 constraints]
After SMT, in 3719ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 3720ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/60 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3931 ms. Remains : 59/60 places, 61/62 transitions.
Treatment of property SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 finished in 17574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G((G(p2)||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&&(X(G(p2))||p1)))))'
[2024-05-28 07:14:21] [INFO ] Flatten gal took : 9 ms
[2024-05-28 07:14:21] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-05-28 07:14:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 64 places, 67 transitions and 265 arcs took 5 ms.
Total runtime 137265 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d0m36

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1541
MODEL NAME: /home/mcc/execution/411/model
64 places, 67 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-03 CANNOT_COMPUTE
FORMULA SieveSingleMsgMbox-PT-d0m36-LTLFireability-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716881061865

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SieveSingleMsgMbox-PT-d0m36"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d0m36, 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 r377-smll-171683809500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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