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.r333-tall-171679077600044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is RingSingleMessageInMbox-PT-d0m080, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077600044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 23:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:46 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-d0m080-LTLFireability-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716792347190

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d0m080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 06:45:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 06:45:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 06:45:48] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-27 06:45:48] [INFO ] Transformed 385 places.
[2024-05-27 06:45:48] [INFO ] Transformed 59 transitions.
[2024-05-27 06:45:48] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 179 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 3 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 53 transition count 58
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 58
Applied a total of 4 rules in 18 ms. Remains 53 /56 variables (removed 3) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 53 cols
[2024-05-27 06:45:48] [INFO ] Computed 3 invariants in 10 ms
[2024-05-27 06:45:49] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 06:45:49] [INFO ] Invariant cache hit.
[2024-05-27 06:45:49] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-27 06:45:49] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-27 06:45:49] [INFO ] Invariant cache hit.
[2024-05-27 06:45:49] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD54 is UNSAT
At refinement iteration 4 (OVERLAPS) 58/111 variables, 53/56 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 27/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 83 constraints, problems are : Problem set: 5 solved, 52 unsolved in 895 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 2/50 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 3/53 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 58/111 variables, 53/56 constraints. Problems are: Problem set: 5 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 27/83 constraints. Problems are: Problem set: 5 solved, 52 unsolved
Problem TDEAD49 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 52/135 constraints. Problems are: Problem set: 6 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/135 constraints. Problems are: Problem set: 6 solved, 51 unsolved
[2024-05-27 06:45:51] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 8 ms to minimize.
[2024-05-27 06:45:51] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 3 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/111 variables, 2/137 constraints. Problems are: Problem set: 6 solved, 51 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 51 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 137 constraints, problems are : Problem set: 6 solved, 51 unsolved in 1864 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 53/53 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 52/57 constraints, Known Traps: 2/2 constraints]
After SMT, in 2844ms problems are : Problem set: 6 solved, 51 unsolved
Search for dead transitions found 6 dead transitions in 2858ms
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 : 53/56 places, 52/59 transitions.
Reduce places removed 4 places and 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 51
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 4 rules in 2 ms. Remains 49 /53 variables (removed 4) and now considering 51/52 (removed 1) transitions.
// Phase 1: matrix 51 rows 49 cols
[2024-05-27 06:45:51] [INFO ] Computed 4 invariants in 3 ms
[2024-05-27 06:45:52] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-27 06:45:52] [INFO ] Invariant cache hit.
[2024-05-27 06:45:52] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-27 06:45:52] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 49/56 places, 51/59 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3281 ms. Remains : 49/56 places, 51/59 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Support contains 29 out of 48 places after structural reductions.
[2024-05-27 06:45:52] [INFO ] Flatten gal took : 18 ms
[2024-05-27 06:45:52] [INFO ] Flatten gal took : 8 ms
[2024-05-27 06:45:52] [INFO ] Input system was already deterministic with 51 transitions.
Reduction of identical properties reduced properties to check from 27 to 25
RANDOM walk for 40000 steps (8520 resets) in 2387 ms. (16 steps per ms) remains 8/25 properties
BEST_FIRST walk for 40002 steps (3754 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1960 resets) in 100 ms. (396 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (2023 resets) in 106 ms. (373 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40001 steps (1914 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3901 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3786 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3852 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
// Phase 1: matrix 51 rows 48 cols
[2024-05-27 06:45:53] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 06:45:53] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/38 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 44/82 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/99 variables, 10/68 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 7/75 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-27 06:45:53] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
Problem AtomicPropp12 is UNSAT
[2024-05-27 06:45:53] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-27 06:45:53] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-27 06:45:53] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/99 variables, 4/79 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/99 variables, 0/79 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 79 constraints, problems are : Problem set: 2 solved, 4 unsolved in 250 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 7/28 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 8/36 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 40/76 variables, 36/39 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 13/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/52 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 22/98 variables, 11/63 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 11/74 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 4/78 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 2/80 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/98 variables, 0/80 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/99 variables, 1/81 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/99 variables, 2/83 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/99 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/99 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 83 constraints, problems are : Problem set: 2 solved, 4 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 48/48 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 405ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 2432 ms.
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 122 edges and 48 vertex of which 47 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 44 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 44 transition count 46
Applied a total of 7 rules in 23 ms. Remains 44 /48 variables (removed 4) and now considering 46/51 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 44/48 places, 46/51 transitions.
RANDOM walk for 40000 steps (8590 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2014 resets) in 91 ms. (434 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (2010 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (3697 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
// Phase 1: matrix 46 rows 44 cols
[2024-05-27 06:45:56] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 06:45:56] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 25/89 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/90 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/90 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 66 constraints, problems are : Problem set: 0 solved, 3 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 18/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 3/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/64 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 11/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 25/89 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/89 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/90 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 69 constraints, problems are : Problem set: 0 solved, 3 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 44/44 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 244ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 943 ms.
Support contains 4 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 46/46 transitions.
Graph (complete) has 114 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 42 transition count 42
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 42 transition count 42
Applied a total of 6 rules in 4 ms. Remains 42 /44 variables (removed 2) and now considering 42/46 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 42/44 places, 42/46 transitions.
RANDOM walk for 40000 steps (8722 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1942 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (1960 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1432 steps, run visited all 2 properties in 15 ms. (steps per millisecond=95 )
Probabilistic random walk after 1432 steps, saw 664 distinct states, run finished after 19 ms. (steps per millisecond=75 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 12 stable transitions
Graph (complete) has 143 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1&&F((G(F((p2 U (p3||G(p2)))))||(!p4&&F((p2 U (p3||G(p2))))))))||p0)))'
Support contains 9 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:45:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 06:45:58] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-27 06:45:58] [INFO ] Invariant cache hit.
[2024-05-27 06:45:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 06:45:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2024-05-27 06:45:58] [INFO ] Invariant cache hit.
[2024-05-27 06:45:58] [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 445 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 677 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 1154ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1154ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 120 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.1 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p4) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (OR (AND (NOT p0) p1 (NOT p3) (NOT p2)) (AND (NOT p0) p1 (NOT p3) (NOT p4))))), (X p1), (X (NOT (AND (NOT p0) p1 p4))), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT p3))), (X (X (NOT p4))), (X (X (OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p3) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 38 ms. Reduced automaton from 5 states, 9 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-01 finished in 2046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))||(G(p1)&&X(G(p2)))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-27 06:46:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:00] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-27 06:46:00] [INFO ] Invariant cache hit.
[2024-05-27 06:46:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:00] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:46:00] [INFO ] Invariant cache hit.
[2024-05-27 06:46:00] [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 510 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 703 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 1233ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1234ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1345 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-02
Entered a terminal (fully accepting) state of product in 510 steps with 105 reset in 5 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-02 finished in 1644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (X(G(!p0))||(!p1&&X((!p0&&G(!p2)))))))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 4 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
[2024-05-27 06:46:01] [INFO ] Invariant cache hit.
[2024-05-27 06:46:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 06:46:01] [INFO ] Invariant cache hit.
[2024-05-27 06:46:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:01] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:46:01] [INFO ] Invariant cache hit.
[2024-05-27 06:46:01] [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 455 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 1186ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1187ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1287 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, p0, p2, (AND p0 p2), p0, p0]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-04 finished in 1546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
[2024-05-27 06:46:03] [INFO ] Invariant cache hit.
[2024-05-27 06:46:03] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 06:46:03] [INFO ] Invariant cache hit.
[2024-05-27 06:46:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:03] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-05-27 06:46:03] [INFO ] Invariant cache hit.
[2024-05-27 06:46:03] [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 462 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 682 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 1163ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1164ms
Starting structural reductions in LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1278 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-05
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-05 finished in 1412 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||(p1 U X(p0))||(!p2&&F(p2)))))'
Support contains 3 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 47
Applied a total of 9 rules in 7 ms. Remains 43 /48 variables (removed 5) and now considering 47/51 (removed 4) transitions.
// Phase 1: matrix 47 rows 43 cols
[2024-05-27 06:46:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:04] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 06:46:04] [INFO ] Invariant cache hit.
[2024-05-27 06:46:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:46:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-27 06:46:04] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-27 06:46:04] [INFO ] Invariant cache hit.
[2024-05-27 06:46:04] [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 592 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 769 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 1381ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 47/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1493 ms. Remains : 43/48 places, 47/51 transitions.
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-07 finished in 1833 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 U p1)||(F(!p2) U p1)))'
Support contains 5 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 9 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:46:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-27 06:46:06] [INFO ] Invariant cache hit.
[2024-05-27 06:46:06] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:06] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-27 06:46:06] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:46:06] [INFO ] Invariant cache hit.
[2024-05-27 06:46:06] [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 465 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 730 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 1212ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1213ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1326 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), p2, (NOT p1)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-09 finished in 1465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))&&F((G(p2)&&p1))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 5 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:46:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:07] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 06:46:07] [INFO ] Invariant cache hit.
[2024-05-27 06:46:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:08] [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.
Running 44 sub problems to find dead transitions.
[2024-05-27 06:46:08] [INFO ] Invariant cache hit.
[2024-05-27 06:46:08] [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 500 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 780 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 1298ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1299ms
Starting structural reductions in LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1390 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p1) p0), p0, (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-11 finished in 1599 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 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 42 transition count 44
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 42 transition count 44
Applied a total of 11 rules in 9 ms. Remains 42 /48 variables (removed 6) and now considering 44/51 (removed 7) transitions.
// Phase 1: matrix 44 rows 42 cols
[2024-05-27 06:46:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 06:46:09] [INFO ] Invariant cache hit.
[2024-05-27 06:46:09] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:09] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-27 06:46:09] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-27 06:46:09] [INFO ] Invariant cache hit.
[2024-05-27 06:46:09] [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 460 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 669 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 1148ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/48 places, 44/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1266 ms. Remains : 42/48 places, 44/51 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-13 finished in 1326 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(((G(p1)&&F(G(p2)))||p0))))'
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Graph (complete) has 143 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 45
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 45
Applied a total of 9 rules in 8 ms. Remains 43 /48 variables (removed 5) and now considering 45/51 (removed 6) transitions.
// Phase 1: matrix 45 rows 43 cols
[2024-05-27 06:46:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-27 06:46:10] [INFO ] Invariant cache hit.
[2024-05-27 06:46:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-27 06:46:10] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:46:10] [INFO ] Invariant cache hit.
[2024-05-27 06:46:10] [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 498 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 802 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 1315ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/48 places, 45/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1418 ms. Remains : 43/48 places, 45/51 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-14
Product exploration explored 100000 steps with 21544 reset in 173 ms.
Product exploration explored 100000 steps with 21589 reset in 140 ms.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 131 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 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 142 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8657 resets) in 271 ms. (147 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (3696 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1952 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1956 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (3745 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
[2024-05-27 06:46:13] [INFO ] Invariant cache hit.
[2024-05-27 06:46:13] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 16/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 35/60 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf4 is UNSAT
At refinement iteration 8 (OVERLAPS) 27/87 variables, 17/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 10/63 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/88 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/88 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 64 constraints, problems are : Problem set: 3 solved, 1 unsolved in 64 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: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/21 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/59 variables, 24/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 9/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/87 variables, 18/53 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 10/63 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 1/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/87 variables, 0/64 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/88 variables, 1/65 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/88 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/88 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 65 constraints, problems are : Problem set: 3 solved, 1 unsolved in 51 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: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 619 steps, including 45 resets, run visited all 1 properties in 2 ms. (steps per millisecond=309 )
Parikh walk visited 1 properties in 7 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR (NOT p2) p0)), (G (OR p0 (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 p0))), (F p2), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 20 factoid took 325 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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-05-27 06:46:13] [INFO ] Invariant cache hit.
[2024-05-27 06:46:14] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-27 06:46:14] [INFO ] Invariant cache hit.
[2024-05-27 06:46:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:14] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-27 06:46:14] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:46:14] [INFO ] Invariant cache hit.
[2024-05-27 06:46:14] [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 490 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 768 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 1285ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1286ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1385 ms. Remains : 43/43 places, 45/45 transitions.
Computed a total of 4 stabilizing places and 9 stable transitions
Graph (complete) has 131 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8635 resets) in 94 ms. (421 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30196 steps (2840 resets) in 52 ms. (569 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21437 reset in 79 ms.
Product exploration explored 100000 steps with 21469 reset in 80 ms.
Support contains 2 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-05-27 06:46:16] [INFO ] Invariant cache hit.
[2024-05-27 06:46:16] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-27 06:46:16] [INFO ] Invariant cache hit.
[2024-05-27 06:46:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-27 06:46:16] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-27 06:46:16] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-27 06:46:16] [INFO ] Invariant cache hit.
[2024-05-27 06:46:16] [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 451 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 786 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 1255ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1256ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1379 ms. Remains : 43/43 places, 45/45 transitions.
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 finished in 6674 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((F(p0)&&(p0 U !p1))))))'
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 51/51 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 51
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 48
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 48
Applied a total of 7 rules in 2 ms. Remains 44 /48 variables (removed 4) and now considering 48/51 (removed 3) transitions.
// Phase 1: matrix 48 rows 44 cols
[2024-05-27 06:46:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 06:46:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 06:46:17] [INFO ] Invariant cache hit.
[2024-05-27 06:46:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-27 06:46:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-27 06:46:17] [INFO ] Invariant cache hit.
[2024-05-27 06:46:17] [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 489 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 771 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 1285ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1286ms
Starting structural reductions in LTL mode, iteration 1 : 44/48 places, 48/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1378 ms. Remains : 44/48 places, 48/51 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLFireability-15 finished in 1617 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(((G(p1)&&F(G(p2)))||p0))))'
[2024-05-27 06:46:19] [INFO ] Flatten gal took : 4 ms
[2024-05-27 06:46:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-27 06:46:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 51 transitions and 199 arcs took 3 ms.
Total runtime 31021 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d0m080

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1081
MODEL NAME: /home/mcc/execution/406/model
48 places, 51 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716792740524

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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-d0m080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is RingSingleMessageInMbox-PT-d0m080, 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 r333-tall-171679077600044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d0m080.tgz
mv RingSingleMessageInMbox-PT-d0m080 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;