About the Execution of LTSMin+red for RingSingleMessageInMbox-PT-d0m160
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
487.928 | 50172.00 | 127709.00 | 222.30 | F?FFFFTTFFFFFFFF | normal |
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.r524-tall-171679079500052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is RingSingleMessageInMbox-PT-d0m160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r524-tall-171679079500052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 23:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 12 23:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 23:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 23:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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 RingSingleMessageInMbox-PT-d0m160-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m160-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717218063124
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:01:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:01:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:01:04] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-01 05:01:04] [INFO ] Transformed 385 places.
[2024-06-01 05:01:04] [INFO ] Transformed 59 transitions.
[2024-06-01 05:01:04] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 51 transition count 56
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 51 transition count 56
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 50 transition count 55
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 50 transition count 55
Applied a total of 10 rules in 24 ms. Remains 50 /56 variables (removed 6) and now considering 55/59 (removed 4) transitions.
// Phase 1: matrix 55 rows 50 cols
[2024-06-01 05:01:04] [INFO ] Computed 3 invariants in 8 ms
[2024-06-01 05:01:04] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 05:01:04] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 4 (OVERLAPS) 55/105 variables, 50/53 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 25/78 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/78 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/105 variables, 0/78 constraints. Problems are: Problem set: 5 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 78 constraints, problems are : Problem set: 5 solved, 49 unsolved in 855 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 2/47 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 3/50 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 55/105 variables, 50/53 constraints. Problems are: Problem set: 5 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 25/78 constraints. Problems are: Problem set: 5 solved, 49 unsolved
Problem TDEAD47 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 49/127 constraints. Problems are: Problem set: 6 solved, 48 unsolved
[2024-06-01 05:01:06] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 1/128 constraints. Problems are: Problem set: 6 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/128 constraints. Problems are: Problem set: 6 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/128 constraints. Problems are: Problem set: 6 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 128 constraints, problems are : Problem set: 6 solved, 48 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 49/54 constraints, Known Traps: 1/1 constraints]
After SMT, in 2231ms problems are : Problem set: 6 solved, 48 unsolved
Search for dead transitions found 6 dead transitions in 2243ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 50/56 places, 49/59 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 47 /50 variables (removed 3) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 47 cols
[2024-06-01 05:01:07] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:01:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 05:01:07] [INFO ] Invariant cache hit.
[2024-06-01 05:01:07] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 05:01:07] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 47/56 places, 49/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2666 ms. Remains : 47/56 places, 49/59 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 26 out of 46 places after structural reductions.
[2024-06-01 05:01:07] [INFO ] Flatten gal took : 27 ms
[2024-06-01 05:01:07] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:01:07] [INFO ] Input system was already deterministic with 49 transitions.
Support contains 25 out of 46 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (8484 resets) in 1072 ms. (37 steps per ms) remains 8/21 properties
BEST_FIRST walk for 40003 steps (3756 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1929 resets) in 141 ms. (281 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (3786 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1952 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3738 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (3769 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
// Phase 1: matrix 49 rows 46 cols
[2024-06-01 05:01:08] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 05:01:08] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/34 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 37/71 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 11/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 23/94 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/95 variables, 1/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 05:01:08] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:01:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/95 variables, 2/74 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/95 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/95 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 74 constraints, problems are : Problem set: 1 solved, 4 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/24 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 9/33 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 36/69 variables, 33/36 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 10/46 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 1/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 25/94 variables, 12/59 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 13/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 3/75 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/95 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/95 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 78 constraints, problems are : Problem set: 1 solved, 4 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 470ms problems are : Problem set: 1 solved, 4 unsolved
Parikh walk visited 1 properties in 1443 ms.
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 118 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 44 transition count 46
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 42 transition count 42
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 42 transition count 42
Applied a total of 8 rules in 27 ms. Remains 42 /46 variables (removed 4) and now considering 42/49 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 42/46 places, 42/49 transitions.
RANDOM walk for 40000 steps (8723 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2030 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3808 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3785 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 433 steps, run visited all 3 properties in 15 ms. (steps per millisecond=28 )
Probabilistic random walk after 433 steps, saw 236 distinct states, run finished after 37 ms. (steps per millisecond=11 ) properties seen :3
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 138 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 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' '!(((p0||X(p1)) U p2))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 42 transition count 44
Applied a total of 7 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 44/49 (removed 5) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-06-01 05:01:10] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:01:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 05:01:10] [INFO ] Invariant cache hit.
[2024-06-01 05:01:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:10] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:10] [INFO ] Invariant cache hit.
[2024-06-01 05:01:10] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1272ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1273ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 44/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1367 ms. Remains : 42/46 places, 44/49 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-00 finished in 1648 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 138 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 42 transition count 44
Applied a total of 7 rules in 5 ms. Remains 42 /46 variables (removed 4) and now considering 44/49 (removed 5) transitions.
[2024-06-01 05:01:12] [INFO ] Invariant cache hit.
[2024-06-01 05:01:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 05:01:12] [INFO ] Invariant cache hit.
[2024-06-01 05:01:12] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:12] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-06-01 05:01:12] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:12] [INFO ] Invariant cache hit.
[2024-06-01 05:01:12] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1259ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1260ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/46 places, 44/49 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1348 ms. Remains : 42/46 places, 44/49 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-01
Product exploration explored 100000 steps with 21635 reset in 258 ms.
Product exploration explored 100000 steps with 21443 reset in 166 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 128 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 163 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8621 resets) in 382 ms. (104 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (1436 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2024-06-01 05:01:14] [INFO ] Invariant cache hit.
[2024-06-01 05:01:14] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/85 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf6 is UNSAT
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 1 solved, 0 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) p2)))), (G (OR (NOT p0) (NOT p2) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR (NOT p2) (NOT p1))))), (F p2), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p0), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 394 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 44/44 transitions.
Applied a total of 0 rules in 7 ms. Remains 42 /42 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-01 05:01:15] [INFO ] Invariant cache hit.
[2024-06-01 05:01:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 05:01:15] [INFO ] Invariant cache hit.
[2024-06-01 05:01:15] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-06-01 05:01:15] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:15] [INFO ] Invariant cache hit.
[2024-06-01 05:01:15] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1197ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1313 ms. Remains : 42/42 places, 44/44 transitions.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 128 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 113 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p2 p0), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8664 resets) in 131 ms. (303 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40003 steps (1445 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
[2024-06-01 05:01:17] [INFO ] Invariant cache hit.
[2024-06-01 05:01:17] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 10/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 25/85 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (X (X p1)), (G (OR p1 (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 p0))), (F p0), (F (NOT (OR p1 p2 (NOT p0)))), (F p2), (F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 22 factoid took 368 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p2 p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p2 p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p2 p0), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 21687 reset in 139 ms.
Product exploration explored 100000 steps with 21457 reset in 160 ms.
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-01 05:01:18] [INFO ] Invariant cache hit.
[2024-06-01 05:01:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 05:01:18] [INFO ] Invariant cache hit.
[2024-06-01 05:01:18] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:18] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-01 05:01:18] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:18] [INFO ] Invariant cache hit.
[2024-06-01 05:01:18] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1160ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1249 ms. Remains : 42/42 places, 44/44 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-01 finished in 7092 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 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 138 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 42 transition count 44
Applied a total of 7 rules in 5 ms. Remains 42 /46 variables (removed 4) and now considering 44/49 (removed 5) transitions.
[2024-06-01 05:01:19] [INFO ] Invariant cache hit.
[2024-06-01 05:01:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 05:01:19] [INFO ] Invariant cache hit.
[2024-06-01 05:01:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-01 05:01:19] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:19] [INFO ] Invariant cache hit.
[2024-06-01 05:01:19] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1168ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/46 places, 44/49 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1267 ms. Remains : 42/46 places, 44/49 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-03
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-03 finished in 1321 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (p1||G(p2))))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 49
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 43 transition count 45
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 43 transition count 45
Applied a total of 5 rules in 3 ms. Remains 43 /46 variables (removed 3) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-06-01 05:01:20] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:01:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 05:01:20] [INFO ] Invariant cache hit.
[2024-06-01 05:01:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:20] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-06-01 05:01:20] [INFO ] Invariant cache hit.
[2024-06-01 05:01:20] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 19/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1188ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1189ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 45/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1277 ms. Remains : 43/46 places, 45/49 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-09 finished in 1464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 138 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 43 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 43 transition count 45
Applied a total of 5 rules in 6 ms. Remains 43 /46 variables (removed 3) and now considering 45/49 (removed 4) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-06-01 05:01:22] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 05:01:22] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 05:01:22] [INFO ] Invariant cache hit.
[2024-06-01 05:01:22] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:01:22] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-06-01 05:01:22] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 05:01:22] [INFO ] Invariant cache hit.
[2024-06-01 05:01:22] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1225ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1225ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/46 places, 45/49 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1333 ms. Remains : 43/46 places, 45/49 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-10
Product exploration explored 100000 steps with 21681 reset in 133 ms.
Product exploration explored 100000 steps with 21894 reset in 131 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 130 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 82 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 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 37520 steps (8093 resets) in 61 ms. (605 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 120 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 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-01 05:01:24] [INFO ] Invariant cache hit.
[2024-06-01 05:01:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 05:01:24] [INFO ] Invariant cache hit.
[2024-06-01 05:01:24] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:01:24] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-01 05:01:24] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 05:01:24] [INFO ] Invariant cache hit.
[2024-06-01 05:01:24] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1147ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1247 ms. Remains : 43/43 places, 45/45 transitions.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 130 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 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 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (8518 resets) in 47 ms. (833 steps per ms) remains 1/2 properties
BEST_FIRST walk for 35907 steps (1753 resets) in 20 ms. (1709 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 116 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 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 21822 reset in 81 ms.
Product exploration explored 100000 steps with 21907 reset in 91 ms.
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-01 05:01:26] [INFO ] Invariant cache hit.
[2024-06-01 05:01:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 05:01:26] [INFO ] Invariant cache hit.
[2024-06-01 05:01:26] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:01:26] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-06-01 05:01:26] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-01 05:01:26] [INFO ] Invariant cache hit.
[2024-06-01 05:01:26] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 109 constraints, problems are : Problem set: 0 solved, 44 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
After SMT, in 1171ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1172ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1280 ms. Remains : 43/43 places, 45/45 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-10 finished in 5781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 42 transition count 44
Applied a total of 7 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 44/49 (removed 5) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-06-01 05:01:27] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 05:01:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 05:01:27] [INFO ] Invariant cache hit.
[2024-06-01 05:01:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:28] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:28] [INFO ] Invariant cache hit.
[2024-06-01 05:01:28] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1157ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1157ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 44/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 42/46 places, 44/49 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-12 finished in 1333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 42 transition count 44
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 42 transition count 44
Applied a total of 7 rules in 4 ms. Remains 42 /46 variables (removed 4) and now considering 44/49 (removed 5) transitions.
[2024-06-01 05:01:29] [INFO ] Invariant cache hit.
[2024-06-01 05:01:29] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 05:01:29] [INFO ] Invariant cache hit.
[2024-06-01 05:01:29] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-06-01 05:01:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 05:01:29] [INFO ] Invariant cache hit.
[2024-06-01 05:01:29] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/86 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 458 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 44/86 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 43/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/86 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1138ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1138ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 44/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1241 ms. Remains : 42/46 places, 44/49 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-13
Entered a terminal (fully accepting) state of product in 26 steps with 2 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-13 finished in 1369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(F(p1))||p0)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 49
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 43 transition count 47
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 43 transition count 47
Applied a total of 5 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 47/49 (removed 2) transitions.
// Phase 1: matrix 47 rows 43 cols
[2024-06-01 05:01:30] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 05:01:30] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 05:01:30] [INFO ] Invariant cache hit.
[2024-06-01 05:01:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:01:30] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-06-01 05:01:30] [INFO ] Invariant cache hit.
[2024-06-01 05:01:30] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/90 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/90 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 67 constraints, problems are : Problem set: 0 solved, 46 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 47/90 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 22/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 113 constraints, problems are : Problem set: 0 solved, 46 unsolved in 738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 1262ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1263ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 47/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1354 ms. Remains : 43/46 places, 47/49 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-14 finished in 1510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&X(F(!p1)))) U p2))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 44 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 44 transition count 48
Applied a total of 3 rules in 3 ms. Remains 44 /46 variables (removed 2) and now considering 48/49 (removed 1) transitions.
// Phase 1: matrix 48 rows 44 cols
[2024-06-01 05:01:32] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 05:01:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 05:01:32] [INFO ] Invariant cache hit.
[2024-06-01 05:01:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 05:01:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-06-01 05:01:32] [INFO ] Invariant cache hit.
[2024-06-01 05:01:32] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/92 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 0/92 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 68 constraints, problems are : Problem set: 0 solved, 47 unsolved in 521 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 48/92 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 22/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 47/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 115 constraints, problems are : Problem set: 0 solved, 47 unsolved in 723 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 1267ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1269ms
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 48/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1358 ms. Remains : 44/46 places, 48/49 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (OR p1 p0), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m160-LTLFireability-15
Stuttering criterion allowed to conclude after 7 steps with 2 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m160-LTLFireability-15 finished in 1497 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2024-06-01 05:01:33] [INFO ] Flatten gal took : 6 ms
[2024-06-01 05:01:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-06-01 05:01:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 49 transitions and 191 arcs took 1 ms.
Total runtime 29771 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : RingSingleMessageInMbox-PT-d0m160-LTLFireability-01
FORMULA RingSingleMessageInMbox-PT-d0m160-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717218113296
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name RingSingleMessageInMbox-PT-d0m160-LTLFireability-01
ltl formula formula --ltl=/tmp/1157/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 49 transitions and 191 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1157/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1157/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1157/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1157/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 46 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 47, there are 77 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~109 levels ~10000 states ~28316 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~20000 states ~58900 transitions
pnml2lts-mc( 2/ 4): ~119 levels ~40000 states ~120936 transitions
pnml2lts-mc( 1/ 4): ~971 levels ~80000 states ~233248 transitions
pnml2lts-mc( 1/ 4): ~1392 levels ~160000 states ~469388 transitions
pnml2lts-mc( 1/ 4): ~2389 levels ~320000 states ~944700 transitions
pnml2lts-mc( 1/ 4): ~3692 levels ~640000 states ~1899300 transitions
pnml2lts-mc( 1/ 4): ~5755 levels ~1280000 states ~3820652 transitions
pnml2lts-mc( 1/ 4): ~9116 levels ~2560000 states ~7683884 transitions
pnml2lts-mc( 2/ 4): ~3235 levels ~5120000 states ~16914332 transitions
pnml2lts-mc( 2/ 4): ~3863 levels ~10240000 states ~34104560 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8867536
pnml2lts-mc( 0/ 4): unique states count: 12563825
pnml2lts-mc( 0/ 4): unique transitions count: 40030552
pnml2lts-mc( 0/ 4): - self-loop count: 12145087
pnml2lts-mc( 0/ 4): - claim dead count: 8287576
pnml2lts-mc( 0/ 4): - claim found count: 7603229
pnml2lts-mc( 0/ 4): - claim success count: 12671345
pnml2lts-mc( 0/ 4): - cum. max stack depth: 302551
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12895779 states 41725775 transitions, fanout: 3.236
pnml2lts-mc( 0/ 4): Total exploration time 18.670 sec (18.640 sec minimum, 18.655 sec on average)
pnml2lts-mc( 0/ 4): States per second: 690722, Transitions per second: 2234910
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 160.1MB, 13.3 B/state, compr.: 7.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 37.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 49 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 160.1MB (~256.0MB paged-in)
ltl formula name RingSingleMessageInMbox-PT-d0m160-LTLFireability-10
ltl formula formula --ltl=/tmp/1157/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 49 transitions and 191 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1157/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1157/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1157/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1157/ltl_1_
pnml2lts-mc( 0/ 4): There are 46 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 47, there are 59 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~38!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 137
pnml2lts-mc( 0/ 4): unique states count: 234
pnml2lts-mc( 0/ 4): unique transitions count: 526
pnml2lts-mc( 0/ 4): - self-loop count: 82
pnml2lts-mc( 0/ 4): - claim dead count: 20
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 252
pnml2lts-mc( 0/ 4): - cum. max stack depth: 110
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 252 states 568 transitions, fanout: 2.254
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 19.6 B/state, compr.: 10.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 49 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d0m160"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is RingSingleMessageInMbox-PT-d0m160, 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 r524-tall-171679079500052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m160.tgz
mv RingSingleMessageInMbox-PT-d0m160 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 '
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 ;