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.r576-smll-171734919800012.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 itstools
Input is MedleyA-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 48K Jun 2 16:33 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 MedleyA-PT-02-LTLFireability-00
FORMULA_NAME MedleyA-PT-02-LTLFireability-01
FORMULA_NAME MedleyA-PT-02-LTLFireability-02
FORMULA_NAME MedleyA-PT-02-LTLFireability-03
FORMULA_NAME MedleyA-PT-02-LTLFireability-04
FORMULA_NAME MedleyA-PT-02-LTLFireability-05
FORMULA_NAME MedleyA-PT-02-LTLFireability-06
FORMULA_NAME MedleyA-PT-02-LTLFireability-07
FORMULA_NAME MedleyA-PT-02-LTLFireability-08
FORMULA_NAME MedleyA-PT-02-LTLFireability-09
FORMULA_NAME MedleyA-PT-02-LTLFireability-10
FORMULA_NAME MedleyA-PT-02-LTLFireability-11
FORMULA_NAME MedleyA-PT-02-LTLFireability-12
FORMULA_NAME MedleyA-PT-02-LTLFireability-13
FORMULA_NAME MedleyA-PT-02-LTLFireability-14
FORMULA_NAME MedleyA-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717351978188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 18:13:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 18:13:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:13:00] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-02 18:13:00] [INFO ] Transformed 69 places.
[2024-06-02 18:13:00] [INFO ] Transformed 168 transitions.
[2024-06-02 18:13:00] [INFO ] Found NUPN structural information;
[2024-06-02 18:13:00] [INFO ] Parsed PT model containing 69 places and 168 transitions and 765 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
FORMULA MedleyA-PT-02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-02-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 162/162 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 57 transition count 146
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 57 transition count 146
Applied a total of 24 rules in 46 ms. Remains 57 /69 variables (removed 12) and now considering 146/162 (removed 16) transitions.
// Phase 1: matrix 146 rows 57 cols
[2024-06-02 18:13:01] [INFO ] Computed 9 invariants in 14 ms
[2024-06-02 18:13:01] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-02 18:13:01] [INFO ] Invariant cache hit.
[2024-06-02 18:13:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 18:13:02] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-06-02 18:13:02] [INFO ] Invariant cache hit.
[2024-06-02 18:13:02] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 16 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:13:04] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:13:05] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:13:05] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:13:05] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-06-02 18:13:05] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:13:05] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 146/203 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/203 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 138 constraints, problems are : Problem set: 0 solved, 145 unsolved in 7730 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 146/203 variables, 57/78 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 145/283 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:13:16] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 0/203 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 286 constraints, problems are : Problem set: 0 solved, 145 unsolved in 12418 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 15/15 constraints]
After SMT, in 20592ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 20634ms
Starting structural reductions in LTL mode, iteration 1 : 57/69 places, 146/162 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21438 ms. Remains : 57/69 places, 146/162 transitions.
Support contains 28 out of 57 places after structural reductions.
[2024-06-02 18:13:23] [INFO ] Flatten gal took : 90 ms
[2024-06-02 18:13:23] [INFO ] Flatten gal took : 42 ms
[2024-06-02 18:13:23] [INFO ] Input system was already deterministic with 146 transitions.
Support contains 25 out of 57 places (down from 28) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40000 steps (3979 resets) in 3025 ms. (13 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40004 steps (925 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (744 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (934 resets) in 97 ms. (408 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (920 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (918 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (907 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (758 resets) in 140 ms. (283 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (840 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (893 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (901 resets) in 297 ms. (134 steps per ms) remains 10/10 properties
[2024-06-02 18:13:24] [INFO ] Invariant cache hit.
[2024-06-02 18:13:24] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 30/45 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/52 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/54 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:13:25] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:13:25] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:13:25] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 144/198 variables, 54/66 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 60/126 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 5/203 variables, 3/129 constraints. Problems are: Problem set: 1 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/129 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 129 constraints, problems are : Problem set: 1 solved, 9 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 32/45 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 7/52 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/54 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 144/198 variables, 54/66 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 60/126 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 2/128 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 5/203 variables, 3/131 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/203 variables, 7/138 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/203 variables, 0/138 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-06-02 18:13:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/203 variables, 1/139 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/203 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 0/203 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 139 constraints, problems are : Problem set: 1 solved, 9 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 57/57 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 9/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 2274ms problems are : Problem set: 1 solved, 9 unsolved
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 5 properties in 1194 ms.
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 254 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 51 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 51 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 50 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 15 place count 48 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 24 place count 48 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 24 place count 48 transition count 136
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 47 transition count 136
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 37 place count 47 transition count 136
Applied a total of 37 rules in 65 ms. Remains 47 /57 variables (removed 10) and now considering 136/146 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 47/57 places, 136/146 transitions.
RANDOM walk for 40000 steps (5199 resets) in 1037 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1375 resets) in 108 ms. (367 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1232 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1132 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
// Phase 1: matrix 136 rows 47 cols
[2024-06-02 18:13:29] [INFO ] Computed 9 invariants in 11 ms
[2024-06-02 18:13:29] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/44 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 136/182 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/183 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 120 constraints, problems are : Problem set: 0 solved, 3 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 64/64 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/38 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/44 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 136/182 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 64/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/183 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/183 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 123 constraints, problems are : Problem set: 0 solved, 3 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 47/47 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 440ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 702 steps, including 42 resets, run visited all 1 properties in 3 ms. (steps per millisecond=234 )
Parikh walk visited 3 properties in 38 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 10 stabilizing places and 57 stable transitions
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 49 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 49 transition count 129
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 13 place count 47 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 47 transition count 119
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 17 place count 45 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 45 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 23 place count 43 transition count 109
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 33 place count 38 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 0 with 24 rules applied. Total rules applied 57 place count 38 transition count 98
Applied a total of 57 rules in 41 ms. Remains 38 /57 variables (removed 19) and now considering 98/146 (removed 48) transitions.
// Phase 1: matrix 98 rows 38 cols
[2024-06-02 18:13:29] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:13:29] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 18:13:29] [INFO ] Invariant cache hit.
[2024-06-02 18:13:30] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 18:13:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 18:13:30] [INFO ] Redundant transitions in 4 ms returned []
Running 92 sub problems to find dead transitions.
[2024-06-02 18:13:30] [INFO ] Invariant cache hit.
[2024-06-02 18:13:30] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:13:31] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:13:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 98/136 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/136 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 63 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 98/136 variables, 38/49 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 92/155 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 18:13:35] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/136 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 156 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4578 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 3/3 constraints]
After SMT, in 7812ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 7815ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/57 places, 98/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8094 ms. Remains : 38/57 places, 98/146 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-01 finished in 8535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((p0||G(p1)))&&G(p2))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 52 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 52 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 124
Applied a total of 14 rules in 10 ms. Remains 50 /57 variables (removed 7) and now considering 124/146 (removed 22) transitions.
// Phase 1: matrix 124 rows 50 cols
[2024-06-02 18:13:38] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:13:38] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:13:38] [INFO ] Invariant cache hit.
[2024-06-02 18:13:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 18:13:38] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-02 18:13:38] [INFO ] Invariant cache hit.
[2024-06-02 18:13:38] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:13:39] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:13:39] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:13:39] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:13:40] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:13:40] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/174 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 119 constraints, problems are : Problem set: 0 solved, 123 unsolved in 6224 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 123/242 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:13:47] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:13:48] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 244 constraints, problems are : Problem set: 0 solved, 123 unsolved in 7613 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 7/7 constraints]
After SMT, in 13976ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 13982ms
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 124/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14229 ms. Remains : 50/57 places, 124/146 transitions.
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-03
Stuttering criterion allowed to conclude after 2145 steps with 219 reset in 66 ms.
FORMULA MedleyA-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-03 finished in 14671 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(p0)||X(G(p1))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 50 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 50 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 49 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 49 transition count 120
Applied a total of 16 rules in 7 ms. Remains 49 /57 variables (removed 8) and now considering 120/146 (removed 26) transitions.
// Phase 1: matrix 120 rows 49 cols
[2024-06-02 18:13:52] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:13:53] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:13:53] [INFO ] Invariant cache hit.
[2024-06-02 18:13:53] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-06-02 18:13:53] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2024-06-02 18:13:53] [INFO ] Invariant cache hit.
[2024-06-02 18:13:53] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:13:54] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 4 ms to minimize.
[2024-06-02 18:13:54] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-02 18:13:54] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:13:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:13:54] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 120/169 variables, 49/63 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 117 constraints, problems are : Problem set: 0 solved, 119 unsolved in 3898 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
[2024-06-02 18:13:57] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 120/169 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 54/118 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 119/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/169 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 237 constraints, problems are : Problem set: 0 solved, 119 unsolved in 6613 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 6/6 constraints]
After SMT, in 10630ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 10633ms
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 120/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10879 ms. Remains : 49/57 places, 120/146 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-05 finished in 11066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 49 transition count 125
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 49 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 48 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 48 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 47 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 47 transition count 116
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 45 transition count 114
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 27 place count 41 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 46 place count 41 transition count 104
Applied a total of 46 rules in 21 ms. Remains 41 /57 variables (removed 16) and now considering 104/146 (removed 42) transitions.
// Phase 1: matrix 104 rows 41 cols
[2024-06-02 18:14:04] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:14:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 18:14:04] [INFO ] Invariant cache hit.
[2024-06-02 18:14:04] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 18:14:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-02 18:14:04] [INFO ] Redundant transitions in 3 ms returned []
Running 98 sub problems to find dead transitions.
[2024-06-02 18:14:04] [INFO ] Invariant cache hit.
[2024-06-02 18:14:04] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:14:05] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:14:05] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:14:05] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 104/145 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 67 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3725 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 2/41 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:14:08] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 104/145 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 98/166 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-02 18:14:09] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/145 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 12 (OVERLAPS) 0/145 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 167 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3941 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 5/5 constraints]
After SMT, in 7740ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7741ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/57 places, 104/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7914 ms. Remains : 41/57 places, 104/146 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-06 finished in 7977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 49 transition count 124
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 49 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 47 transition count 114
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 47 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 19 place count 45 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 25 place count 43 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 37 place count 37 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 67 place count 37 transition count 109
Applied a total of 67 rules in 37 ms. Remains 37 /57 variables (removed 20) and now considering 109/146 (removed 37) transitions.
// Phase 1: matrix 109 rows 37 cols
[2024-06-02 18:14:12] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:14:12] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 18:14:12] [INFO ] Invariant cache hit.
[2024-06-02 18:14:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 18:14:12] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-06-02 18:14:12] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2024-06-02 18:14:12] [INFO ] Invariant cache hit.
[2024-06-02 18:14:12] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-02 18:14:13] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 109/146 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 56/103 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 103 constraints, problems are : Problem set: 0 solved, 105 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 109/146 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 56/103 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 105/208 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 208 constraints, problems are : Problem set: 0 solved, 105 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 1/1 constraints]
After SMT, in 8047ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 8051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/57 places, 109/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8319 ms. Remains : 37/57 places, 109/146 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-07 finished in 8401 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)||(p1&&F(G(p2))))))'
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Graph (complete) has 319 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 50 transition count 125
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 50 transition count 125
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 15 place count 48 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 48 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 47 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 47 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 44 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 35 place count 39 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 60 place count 39 transition count 114
Applied a total of 60 rules in 31 ms. Remains 39 /57 variables (removed 18) and now considering 114/146 (removed 32) transitions.
// Phase 1: matrix 114 rows 39 cols
[2024-06-02 18:14:20] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 18:14:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:14:20] [INFO ] Invariant cache hit.
[2024-06-02 18:14:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-06-02 18:14:20] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 18:14:20] [INFO ] Redundant transitions in 6 ms returned []
Running 110 sub problems to find dead transitions.
[2024-06-02 18:14:20] [INFO ] Invariant cache hit.
[2024-06-02 18:14:20] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/153 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 106 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/153 variables, 39/49 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 57/106 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 110/216 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 216 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5566 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 1/1 constraints]
After SMT, in 9164ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 9166ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/57 places, 114/146 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9447 ms. Remains : 39/57 places, 114/146 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-09
Stuttering criterion allowed to conclude after 22 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-09 finished in 9591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X(X(p0))) U (X(p1)||G(p2))))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 52 transition count 133
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 52 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 51 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 51 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 50 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 124
Applied a total of 14 rules in 4 ms. Remains 50 /57 variables (removed 7) and now considering 124/146 (removed 22) transitions.
// Phase 1: matrix 124 rows 50 cols
[2024-06-02 18:14:30] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:14:30] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 18:14:30] [INFO ] Invariant cache hit.
[2024-06-02 18:14:30] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-06-02 18:14:30] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-06-02 18:14:30] [INFO ] Invariant cache hit.
[2024-06-02 18:14:30] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-06-02 18:14:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/174 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 119 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 124/174 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 55/119 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 123/242 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 242 constraints, problems are : Problem set: 0 solved, 123 unsolved in 5286 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints]
After SMT, in 9499ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 9500ms
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 124/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9666 ms. Remains : 50/57 places, 124/146 transitions.
Stuttering acceptance computed with spot in 742 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), true, (NOT p0), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-10
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-10 finished in 10444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 5 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 51 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 51 transition count 127
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 50 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 50 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 49 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 49 transition count 118
Applied a total of 16 rules in 6 ms. Remains 49 /57 variables (removed 8) and now considering 118/146 (removed 28) transitions.
// Phase 1: matrix 118 rows 49 cols
[2024-06-02 18:14:40] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:14:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:14:40] [INFO ] Invariant cache hit.
[2024-06-02 18:14:40] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 18:14:40] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2024-06-02 18:14:40] [INFO ] Invariant cache hit.
[2024-06-02 18:14:40] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
[2024-06-02 18:14:41] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:14:41] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:14:41] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-02 18:14:41] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 3 ms to minimize.
[2024-06-02 18:14:42] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:14:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:14:42] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/167 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 118 constraints, problems are : Problem set: 0 solved, 117 unsolved in 4433 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (OVERLAPS) 118/167 variables, 49/65 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 53/118 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 117/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 0/167 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 235 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5278 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 7/7 constraints]
After SMT, in 9819ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 9821ms
Starting structural reductions in LTL mode, iteration 1 : 49/57 places, 118/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10049 ms. Remains : 49/57 places, 118/146 transitions.
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-13
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-13 finished in 10214 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((X((!p1 U (p2||G(!p1))))&&p0))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 146/146 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 51 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 51 transition count 131
Applied a total of 12 rules in 3 ms. Remains 51 /57 variables (removed 6) and now considering 131/146 (removed 15) transitions.
// Phase 1: matrix 131 rows 51 cols
[2024-06-02 18:14:50] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:14:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 18:14:50] [INFO ] Invariant cache hit.
[2024-06-02 18:14:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 18:14:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 18:14:50] [INFO ] Invariant cache hit.
[2024-06-02 18:14:50] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 18:14:51] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:14:51] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:14:51] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 5 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 4 ms to minimize.
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 18:14:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-02 18:14:54] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 131/182 variables, 51/75 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 58/133 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 133 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5845 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 131/182 variables, 51/75 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 58/133 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 130/263 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 263 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5819 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 15/15 constraints]
After SMT, in 11752ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 11755ms
Starting structural reductions in LTL mode, iteration 1 : 51/57 places, 131/146 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11924 ms. Remains : 51/57 places, 131/146 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-02-LTLFireability-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-02-LTLFireability-14 finished in 12067 ms.
All properties solved by simple procedures.
Total runtime 122284 ms.

BK_STOP 1717352102768

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="MedleyA-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MedleyA-PT-02, 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 r576-smll-171734919800012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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