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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 90K 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-08-LTLFireability-00
FORMULA_NAME MedleyA-PT-08-LTLFireability-01
FORMULA_NAME MedleyA-PT-08-LTLFireability-02
FORMULA_NAME MedleyA-PT-08-LTLFireability-03
FORMULA_NAME MedleyA-PT-08-LTLFireability-04
FORMULA_NAME MedleyA-PT-08-LTLFireability-05
FORMULA_NAME MedleyA-PT-08-LTLFireability-06
FORMULA_NAME MedleyA-PT-08-LTLFireability-07
FORMULA_NAME MedleyA-PT-08-LTLFireability-08
FORMULA_NAME MedleyA-PT-08-LTLFireability-09
FORMULA_NAME MedleyA-PT-08-LTLFireability-10
FORMULA_NAME MedleyA-PT-08-LTLFireability-11
FORMULA_NAME MedleyA-PT-08-LTLFireability-12
FORMULA_NAME MedleyA-PT-08-LTLFireability-13
FORMULA_NAME MedleyA-PT-08-LTLFireability-14
FORMULA_NAME MedleyA-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717357668065

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-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-06-02 19:47:50] [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 19:47:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:47:50] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2024-06-02 19:47:50] [INFO ] Transformed 147 places.
[2024-06-02 19:47:50] [INFO ] Transformed 312 transitions.
[2024-06-02 19:47:50] [INFO ] Found NUPN structural information;
[2024-06-02 19:47:50] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 519 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 109 transition count 268
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 109 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 109 transition count 265
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 106 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 106 transition count 262
Applied a total of 83 rules in 105 ms. Remains 106 /147 variables (removed 41) and now considering 262/312 (removed 50) transitions.
// Phase 1: matrix 262 rows 106 cols
[2024-06-02 19:47:51] [INFO ] Computed 10 invariants in 36 ms
[2024-06-02 19:47:51] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-06-02 19:47:51] [INFO ] Invariant cache hit.
[2024-06-02 19:47:52] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 261 sub problems to find dead transitions.
[2024-06-02 19:47:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 261 unsolved
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD224 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 213 unsolved
[2024-06-02 19:47:55] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 25 ms to minimize.
[2024-06-02 19:47:55] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 2 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:47:56] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/18 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 262/368 variables, 106/124 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 0/124 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/368 variables, 0/124 constraints. Problems are: Problem set: 48 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 124 constraints, problems are : Problem set: 48 solved, 213 unsolved in 11660 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 261/261 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 48 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/106 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 8/18 constraints. Problems are: Problem set: 48 solved, 213 unsolved
[2024-06-02 19:48:06] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-06-02 19:48:06] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 2/20 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 6 (OVERLAPS) 262/368 variables, 106/126 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 213/339 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/339 constraints. Problems are: Problem set: 48 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 0/368 variables, 0/339 constraints. Problems are: Problem set: 48 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 368/368 variables, and 339 constraints, problems are : Problem set: 48 solved, 213 unsolved in 18960 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 213/261 constraints, Known Traps: 10/10 constraints]
After SMT, in 31394ms problems are : Problem set: 48 solved, 213 unsolved
Search for dead transitions found 48 dead transitions in 31423ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/147 places, 214/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32270 ms. Remains : 106/147 places, 214/312 transitions.
Support contains 40 out of 106 places after structural reductions.
[2024-06-02 19:48:23] [INFO ] Flatten gal took : 82 ms
[2024-06-02 19:48:23] [INFO ] Flatten gal took : 45 ms
[2024-06-02 19:48:24] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 39 out of 106 places (down from 40) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 33 to 32
RANDOM walk for 40000 steps (1977 resets) in 2911 ms. (13 steps per ms) remains 24/32 properties
BEST_FIRST walk for 4002 steps (64 resets) in 86 ms. (46 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (52 resets) in 77 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (54 resets) in 87 ms. (45 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (58 resets) in 127 ms. (31 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (46 resets) in 95 ms. (41 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (51 resets) in 83 ms. (47 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (54 resets) in 94 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (52 resets) in 93 ms. (42 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (52 resets) in 88 ms. (44 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (48 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (59 resets) in 56 ms. (70 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (60 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (56 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (50 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (53 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (49 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (51 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (59 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (58 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (51 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (49 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (49 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (55 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (58 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
// Phase 1: matrix 214 rows 106 cols
[2024-06-02 19:48:25] [INFO ] Computed 10 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/63 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/92 variables, 5/9 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:48:25] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/10 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 199/291 variables, 92/102 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 20/311 variables, 8/110 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:48:26] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-06-02 19:48:26] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 2/112 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 2/313 variables, 1/113 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 2/115 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/313 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 6/319 variables, 3/118 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/319 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 1/320 variables, 1/119 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 0/320 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 119 constraints, problems are : Problem set: 3 solved, 21 unsolved in 2106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 3 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 35/61 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 21 unsolved
[2024-06-02 19:48:27] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:48:27] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 21 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (OVERLAPS) 31/92 variables, 5/11 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 3/14 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/14 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 199/291 variables, 92/106 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 8/114 constraints. Problems are: Problem set: 4 solved, 20 unsolved
[2024-06-02 19:48:28] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:48:28] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/116 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/116 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 20/311 variables, 8/124 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 12/136 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 0/136 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 2/313 variables, 1/137 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 2/139 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/313 variables, 0/139 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 6/319 variables, 3/142 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/319 variables, 0/142 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 1/320 variables, 1/143 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/320 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 0/320 variables, 0/143 constraints. Problems are: Problem set: 4 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 143 constraints, problems are : Problem set: 4 solved, 20 unsolved in 3557 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 20/24 constraints, Known Traps: 7/7 constraints]
After SMT, in 5718ms problems are : Problem set: 4 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 16 properties in 17025 ms.
Support contains 10 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 101 transition count 192
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 31 place count 91 transition count 191
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 31 place count 91 transition count 187
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 39 place count 87 transition count 187
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 47 place count 79 transition count 168
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 79 transition count 168
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 77 transition count 163
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 77 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 76 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 76 transition count 160
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 79 place count 67 transition count 151
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 81 place count 67 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 66 transition count 146
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 66 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 93 place count 61 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 129 place count 61 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 129 place count 61 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 59 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 139 place count 56 transition count 165
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 56 transition count 160
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 51 transition count 160
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 150 place count 51 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 50 transition count 161
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 50 transition count 161
Applied a total of 152 rules in 111 ms. Remains 50 /106 variables (removed 56) and now considering 161/214 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 50/106 places, 161/214 transitions.
RANDOM walk for 40000 steps (4580 resets) in 316 ms. (126 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (1330 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
// Phase 1: matrix 161 rows 50 cols
[2024-06-02 19:48:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:48:48] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/48 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 160/208 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 40/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/211 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/211 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 17/48 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 160/208 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 40/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/211 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/211 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 161/161 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 49 transition count 159
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 49 transition count 159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 48 transition count 157
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 48 transition count 157
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 41 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 39 transition count 149
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 39 transition count 149
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 39 transition count 147
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 39 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 38 transition count 146
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 38 transition count 146
Applied a total of 28 rules in 42 ms. Remains 38 /50 variables (removed 12) and now considering 146/161 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 38/50 places, 146/161 transitions.
RANDOM walk for 40000 steps (53 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (275 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 82 steps, run visited all 1 properties in 13 ms. (steps per millisecond=6 )
Probabilistic random walk after 82 steps, saw 56 distinct states, run finished after 20 ms. (steps per millisecond=4 ) properties seen :1
FORMULA MedleyA-PT-08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
FORMULA MedleyA-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 193
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 96 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 91 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 91 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 89 transition count 173
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 88 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 88 transition count 170
Applied a total of 37 rules in 21 ms. Remains 88 /106 variables (removed 18) and now considering 170/214 (removed 44) transitions.
// Phase 1: matrix 170 rows 88 cols
[2024-06-02 19:48:49] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:48:49] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:48:49] [INFO ] Invariant cache hit.
[2024-06-02 19:48:49] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-06-02 19:48:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 19:48:51] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:48:51] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 100 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7185 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/258 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 169/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-06-02 19:49:02] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/258 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 270 constraints, problems are : Problem set: 0 solved, 169 unsolved in 13029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints]
After SMT, in 20408ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 20413ms
Starting structural reductions in LTL mode, iteration 1 : 88/106 places, 170/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20716 ms. Remains : 88/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 506 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 544 ms.
Product exploration explored 100000 steps with 33333 reset in 209 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 314 edges and 88 vertex of which 83 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/88 stabilizing places and 8/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 27 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLFireability-00 finished in 22124 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(F(((!p0&&X(F(!p1)))||G(F(!p1)))))||(X((p1||X(p2)))&&F(((!p0&&X(F(!p1)))||G(F(!p1))))))))'
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 94 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 94 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 93 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 93 transition count 187
Applied a total of 27 rules in 11 ms. Remains 93 /106 variables (removed 13) and now considering 187/214 (removed 27) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 19:49:11] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:49:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:49:11] [INFO ] Invariant cache hit.
[2024-06-02 19:49:11] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:49:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:49:13] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:49:13] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:49:13] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:49:13] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7522 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 293 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9967 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 17740ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 17744ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 187/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18036 ms. Remains : 93/106 places, 187/214 transitions.
Stuttering acceptance computed with spot in 335 ms :[p1, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-01
Product exploration explored 100000 steps with 33356 reset in 116 ms.
Product exploration explored 100000 steps with 33285 reset in 203 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 147 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1985 resets) in 280 ms. (142 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40001 steps (555 resets) in 179 ms. (222 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (564 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (545 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (552 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (555 resets) in 661 ms. (60 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (546 resets) in 43 ms. (909 steps per ms) remains 6/6 properties
[2024-06-02 19:49:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/265 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 12/277 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/280 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 103 constraints, problems are : Problem set: 0 solved, 6 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/277 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/280 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 109 constraints, problems are : Problem set: 0 solved, 6 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1188ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1129 ms.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 88 transition count 164
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 32 place count 78 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 78 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 76 transition count 161
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 59 place count 64 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 64 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 63 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 63 transition count 148
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 58 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 121 place count 58 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 121 place count 58 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 56 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 54 transition count 155
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 54 transition count 151
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 137 place count 50 transition count 151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 50 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 48 transition count 198
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 144 place count 48 transition count 198
Applied a total of 144 rules in 64 ms. Remains 48 /93 variables (removed 45) and now considering 198/187 (removed -11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 48/93 places, 198/187 transitions.
RANDOM walk for 40000 steps (162 resets) in 614 ms. (65 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40002 steps (151 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (110 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (165 resets) in 77 ms. (512 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (111 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
[2024-06-02 19:49:34] [INFO ] Flow matrix only has 194 transitions (discarded 4 similar events)
// Phase 1: matrix 194 rows 48 cols
[2024-06-02 19:49:34] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:49:34] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 6/38 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/48 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 194/242 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 78 constraints, problems are : Problem set: 0 solved, 4 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 23/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/38 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/48 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 194/242 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/242 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 82 constraints, problems are : Problem set: 0 solved, 4 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 621ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 818 steps, including 69 resets, run visited all 4 properties in 17 ms. (steps per millisecond=48 )
Parikh walk visited 4 properties in 23 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (F p1)]
Knowledge based reduction with 16 factoid took 594 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 344 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 19:49:36] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:49:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:49:36] [INFO ] Invariant cache hit.
[2024-06-02 19:49:36] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:49:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:49:38] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:49:38] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:49:38] [INFO ] Deduced a trap composed of 46 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:49:38] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7520 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 293 constraints, problems are : Problem set: 0 solved, 186 unsolved in 11240 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 18965ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 18969ms
Finished structural reductions in LTL mode , in 1 iterations and 19247 ms. Remains : 93/93 places, 187/187 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
RANDOM walk for 40000 steps (1975 resets) in 728 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (571 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (564 resets) in 162 ms. (245 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (553 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (539 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (528 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (548 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (555 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (555 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (525 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (550 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 507082 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :4 out of 10
Probabilistic random walk after 507082 steps, saw 91256 distinct states, run finished after 3007 ms. (steps per millisecond=168 ) properties seen :4
[2024-06-02 19:49:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 4/265 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 12/277 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/277 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/280 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/280 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 103 constraints, problems are : Problem set: 0 solved, 6 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 37/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 27/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 165/238 variables, 73/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 23/261 variables, 9/90 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 4/265 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 12/277 variables, 9/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 3/280 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/280 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 109 constraints, problems are : Problem set: 0 solved, 6 unsolved in 849 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 15349 steps, including 639 resets, run visited all 6 properties in 297 ms. (steps per millisecond=51 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 297 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))), (F (NOT (OR p2 (NOT p0)))), (F p2), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2 (NOT p0)))), (F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
Knowledge based reduction with 7 factoid took 602 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 315 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 385 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 20057 reset in 104 ms.
Product exploration explored 100000 steps with 19952 reset in 122 ms.
Applying partial POR strategy [false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 333 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 88 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 88 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 88 transition count 185
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 88 transition count 185
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 85 transition count 182
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 85 transition count 182
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 85 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 85 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 36 place count 81 transition count 177
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 81 transition count 177
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 81 transition count 231
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 80 transition count 229
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 80 transition count 229
Deduced a syphon composed of 21 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 97 place count 80 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 97 place count 80 transition count 181
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 80 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 80 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 79 transition count 189
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 79 transition count 189
Deduced a syphon composed of 23 places in 1 ms
Applied a total of 102 rules in 34 ms. Remains 79 /93 variables (removed 14) and now considering 189/187 (removed -2) transitions.
[2024-06-02 19:50:03] [INFO ] Redundant transitions in 29 ms returned [162]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 186 sub problems to find dead transitions.
// Phase 1: matrix 188 rows 79 cols
[2024-06-02 19:50:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:50:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:50:05] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:50:05] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 19:50:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-02 19:50:05] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
[2024-06-02 19:50:05] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD123 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 5/13 constraints. Problems are: Problem set: 30 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/13 constraints. Problems are: Problem set: 30 solved, 156 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 5 (OVERLAPS) 188/267 variables, 79/92 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 8/100 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/100 constraints. Problems are: Problem set: 34 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 100 constraints, problems are : Problem set: 34 solved, 152 unsolved in 5799 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 34 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 14/69 variables, 4/4 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 2/6 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 5/11 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/11 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 7/76 variables, 2/13 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 187/263 variables, 76/89 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 8/97 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 152/249 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 0/249 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 11 (OVERLAPS) 4/267 variables, 3/252 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/267 variables, 0/252 constraints. Problems are: Problem set: 34 solved, 152 unsolved
At refinement iteration 13 (OVERLAPS) 0/267 variables, 0/252 constraints. Problems are: Problem set: 34 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 252 constraints, problems are : Problem set: 34 solved, 152 unsolved in 13808 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 79/79 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 152/186 constraints, Known Traps: 5/5 constraints]
After SMT, in 19794ms problems are : Problem set: 34 solved, 152 unsolved
Search for dead transitions found 34 dead transitions in 19796ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 79/93 places, 154/187 transitions.
Graph (complete) has 288 edges and 79 vertex of which 56 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 14 ms. Remains 55 /79 variables (removed 24) and now considering 168/154 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/93 places, 168/187 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19880 ms. Remains : 55/93 places, 168/187 transitions.
Built C files in :
/tmp/ltsmin15578980686407226324
[2024-06-02 19:50:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15578980686407226324
Running compilation step : cd /tmp/ltsmin15578980686407226324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 973 ms.
Running link step : cd /tmp/ltsmin15578980686407226324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin15578980686407226324;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased83835653594638709.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 19:50:38] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 19:50:38] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 19:50:38] [INFO ] Invariant cache hit.
[2024-06-02 19:50:38] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2024-06-02 19:50:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-06-02 19:50:41] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:50:41] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:50:41] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:50:41] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 107 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9064 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/280 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 186/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 293 constraints, problems are : Problem set: 0 solved, 186 unsolved in 10264 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 4/4 constraints]
After SMT, in 19742ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 19746ms
Finished structural reductions in LTL mode , in 1 iterations and 20054 ms. Remains : 93/93 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin1826842330025495401
[2024-06-02 19:50:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1826842330025495401
Running compilation step : cd /tmp/ltsmin1826842330025495401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 851 ms.
Running link step : cd /tmp/ltsmin1826842330025495401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin1826842330025495401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11471246479014512478.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 19:51:13] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:51:13] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:51:13] [INFO ] Time to serialize gal into /tmp/LTL2372833316450276706.gal : 8 ms
[2024-06-02 19:51:13] [INFO ] Time to serialize properties into /tmp/LTL11686945722711396832.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2372833316450276706.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15781911945488056911.hoa' '-atoms' '/tmp/LTL11686945722711396832.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11686945722711396832.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15781911945488056911.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t32, t33, t35, t38, t3...538
Computing Next relation with stutter on 1196 deadlock states
Detected timeout of ITS tools.
[2024-06-02 19:51:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:51:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:51:29] [INFO ] Time to serialize gal into /tmp/LTL12870028083586287149.gal : 5 ms
[2024-06-02 19:51:29] [INFO ] Time to serialize properties into /tmp/LTL18180283195647430274.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12870028083586287149.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18180283195647430274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G(F("(((p83!=1)||(p89!=1))||(p103!=1))")))||(("(((p22!=1)||(p37!=1))||(p47!=1))")&&(X(F("(((p83!=1)||(p89!=1))||(p103!=1))"...399
Formula 0 simplified : G(FG!"(((p83!=1)||(p89!=1))||(p103!=1))" & (G(FG!"(((p83!=1)||(p89!=1))||(p103!=1))" & (!"(((p22!=1)||(p37!=1))||(p47!=1))" | XG!"((...284
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t32, t33, t35, t38, t3...538
Computing Next relation with stutter on 1196 deadlock states
Detected timeout of ITS tools.
[2024-06-02 19:51:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:51:44] [INFO ] Applying decomposition
[2024-06-02 19:51:44] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11396222877157924892.txt' '-o' '/tmp/graph11396222877157924892.bin' '-w' '/tmp/graph11396222877157924892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11396222877157924892.bin' '-l' '-1' '-v' '-w' '/tmp/graph11396222877157924892.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:51:44] [INFO ] Decomposing Gal with order
[2024-06-02 19:51:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:51:44] [INFO ] Removed a total of 328 redundant transitions.
[2024-06-02 19:51:44] [INFO ] Flatten gal took : 99 ms
[2024-06-02 19:51:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 15 ms.
[2024-06-02 19:51:44] [INFO ] Time to serialize gal into /tmp/LTL6126372893160808326.gal : 5 ms
[2024-06-02 19:51:44] [INFO ] Time to serialize properties into /tmp/LTL10601058577287569139.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6126372893160808326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10601058577287569139.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G(F("(((i4.u11.p83!=1)||(i6.u17.p89!=1))||(i4.u18.p103!=1))")))||(("(((i3.u3.p22!=1)||(i2.u5.p37!=1))||(i3.u9.p47!=1))")&&(...566
Formula 0 simplified : G(FG!"(((i4.u11.p83!=1)||(i6.u17.p89!=1))||(i4.u18.p103!=1))" & (G(FG!"(((i4.u11.p83!=1)||(i6.u17.p89!=1))||(i4.u18.p103!=1))" & (!"...412
Reverse transition relation is NOT exact ! Due to transitions t26, t67, t103, t110, t182, t183, t184, t185, t200, t201, t202, t203, i1.u4.t97, i2.t87, i2.t...768
Computing Next relation with stutter on 1196 deadlock states
158 unique states visited
0 strongly connected components in search stack
210 transitions explored
46 items max in DFS search stack
376 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.79394,109260,1,0,178283,5441,2463,347740,554,45479,278924
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-08-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property MedleyA-PT-08-LTLFireability-01 finished in 157370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((p2||G(p3))&&p1))))'
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 92 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 92 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 178
Applied a total of 31 rules in 5 ms. Remains 91 /106 variables (removed 15) and now considering 178/214 (removed 36) transitions.
// Phase 1: matrix 178 rows 91 cols
[2024-06-02 19:51:48] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:51:48] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:51:48] [INFO ] Invariant cache hit.
[2024-06-02 19:51:49] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-06-02 19:51:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-02 19:51:51] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 4 ms to minimize.
[2024-06-02 19:51:51] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:51:51] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/269 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 104 constraints, problems are : Problem set: 0 solved, 177 unsolved in 8387 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/269 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 177/281 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 281 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9778 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 3/3 constraints]
After SMT, in 18337ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 18341ms
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 178/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18628 ms. Remains : 91/106 places, 178/214 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-06
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-06 finished in 18930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 100 transition count 199
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 89 transition count 198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 89 transition count 195
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 86 transition count 195
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 37 place count 79 transition count 181
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 79 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 76 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 76 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 75 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 75 transition count 172
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 60 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 60 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 58 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 58 transition count 154
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 51 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 149 place count 51 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 149 place count 51 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 49 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 47 transition count 170
Applied a total of 157 rules in 67 ms. Remains 47 /106 variables (removed 59) and now considering 170/214 (removed 44) transitions.
// Phase 1: matrix 170 rows 47 cols
[2024-06-02 19:52:07] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 19:52:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:52:07] [INFO ] Invariant cache hit.
[2024-06-02 19:52:08] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 19:52:08] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-02 19:52:08] [INFO ] Redundant transitions in 29 ms returned []
Running 164 sub problems to find dead transitions.
[2024-06-02 19:52:08] [INFO ] Invariant cache hit.
[2024-06-02 19:52:08] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-02 19:52:09] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 169/215 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 53/106 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 2/217 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/217 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 107 constraints, problems are : Problem set: 0 solved, 164 unsolved in 8686 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 169/215 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 53/106 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 2/217 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (OVERLAPS) 0/217 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 271 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11861 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 1/1 constraints]
After SMT, in 20864ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 20868ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/106 places, 170/214 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21230 ms. Remains : 47/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-07 finished in 21400 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)) U p1))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 101 transition count 199
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 89 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 89 transition count 193
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 85 transition count 193
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 44 place count 76 transition count 173
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 76 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 73 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 73 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 71 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 71 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 70 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 70 transition count 157
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 53 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 50 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 50 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 121 place count 43 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 147 place count 43 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 40 transition count 167
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 40 transition count 165
Applied a total of 155 rules in 54 ms. Remains 40 /106 variables (removed 66) and now considering 165/214 (removed 49) transitions.
// Phase 1: matrix 165 rows 40 cols
[2024-06-02 19:52:29] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 19:52:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 19:52:29] [INFO ] Invariant cache hit.
[2024-06-02 19:52:29] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 19:52:29] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-06-02 19:52:29] [INFO ] Redundant transitions in 26 ms returned [93]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 162 sub problems to find dead transitions.
// Phase 1: matrix 164 rows 40 cols
[2024-06-02 19:52:29] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 19:52:29] [INFO ] State equation strengthened by 82 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 164/204 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/204 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 128 constraints, problems are : Problem set: 0 solved, 162 unsolved in 6141 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (OVERLAPS) 164/204 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 82/128 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 162/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 290 constraints, problems are : Problem set: 0 solved, 162 unsolved in 8710 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 40/40 constraints, ReadFeed: 82/82 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 15137ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 15143ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/106 places, 164/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15503 ms. Remains : 40/106 places, 164/214 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-08
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-08 finished in 15594 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((G(p0)||X((p1||X((p2||F(p3))))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 194
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 92 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 92 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 175
Applied a total of 31 rules in 9 ms. Remains 91 /106 variables (removed 15) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 91 cols
[2024-06-02 19:52:44] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:52:44] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:52:44] [INFO ] Invariant cache hit.
[2024-06-02 19:52:45] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:52:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:52:47] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:52:47] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:52:47] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:52:47] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-02 19:52:47] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 106 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7857 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 174/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 280 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7386 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
After SMT, in 15352ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15355ms
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15628 ms. Remains : 91/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-09
Product exploration explored 100000 steps with 24920 reset in 155 ms.
Product exploration explored 100000 steps with 25019 reset in 196 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 185 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (1981 resets) in 519 ms. (76 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (532 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (529 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (545 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (537 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (502 resets) in 69 ms. (571 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (518 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (517 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (521 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
[2024-06-02 19:53:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:53:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 17/39 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 153/224 variables, 71/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 23/247 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 4/251 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 12/263 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 3/266 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 102 constraints, problems are : Problem set: 0 solved, 8 unsolved in 881 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf8 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 17/39 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 153/224 variables, 71/80 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 1/81 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 23/247 variables, 9/90 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 5/95 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/247 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 4/251 variables, 2/97 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 12/263 variables, 9/106 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/263 variables, 0/106 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 3/266 variables, 2/108 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/266 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/266 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 108 constraints, problems are : Problem set: 2 solved, 6 unsolved in 664 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1554ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 7421 steps, including 267 resets, run visited all 6 properties in 426 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 433 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X p0)), (G (OR p0 p2 p3)), (G (OR p0 p3))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT (OR p2 p3))), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p3))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p3)))]
Knowledge based reduction with 13 factoid took 483 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 91 /91 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 19:53:05] [INFO ] Invariant cache hit.
[2024-06-02 19:53:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:53:05] [INFO ] Invariant cache hit.
[2024-06-02 19:53:05] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:53:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-02 19:53:07] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 106 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8112 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 174/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 280 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9726 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
After SMT, in 18007ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 18010ms
Finished structural reductions in LTL mode , in 1 iterations and 18340 ms. Remains : 91/91 places, 175/175 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
RANDOM walk for 40000 steps (1976 resets) in 149 ms. (266 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40001 steps (529 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (539 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (524 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (542 resets) in 57 ms. (689 steps per ms) remains 1/4 properties
[2024-06-02 19:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/224 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/247 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/251 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/263 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/263 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/266 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/266 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/266 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/39 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 153/224 variables, 71/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/247 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/251 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/263 variables, 9/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/266 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/266 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 457ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 79 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F p2), (F p1), (F (NOT p3))]
Knowledge based reduction with 7 factoid took 354 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 33426 reset in 120 ms.
Product exploration explored 100000 steps with 33356 reset in 161 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 86 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 86 transition count 172
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 86 transition count 172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 83 transition count 169
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 83 transition count 169
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 83 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 83 transition count 169
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 77 transition count 161
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 77 transition count 161
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 77 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 74 transition count 193
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 74 transition count 193
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 74 transition count 181
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 80 rules in 36 ms. Remains 74 /91 variables (removed 17) and now considering 181/175 (removed -6) transitions.
[2024-06-02 19:53:26] [INFO ] Redundant transitions in 30 ms returned [177]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 178 sub problems to find dead transitions.
// Phase 1: matrix 180 rows 74 cols
[2024-06-02 19:53:26] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:53:26] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/74 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-06-02 19:53:28] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 9/17 constraints. Problems are: Problem set: 29 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/17 constraints. Problems are: Problem set: 29 solved, 149 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 5 (OVERLAPS) 180/254 variables, 74/91 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 72/163 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/163 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/163 constraints. Problems are: Problem set: 33 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 163 constraints, problems are : Problem set: 33 solved, 145 unsolved in 7149 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 74/74 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 33 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 14/59 variables, 4/4 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 9/13 constraints. Problems are: Problem set: 33 solved, 145 unsolved
[2024-06-02 19:53:34] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:53:34] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 2/15 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 12/71 variables, 4/19 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/19 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 179/250 variables, 71/90 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 72/162 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 145/307 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/307 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 4/254 variables, 3/310 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/310 constraints. Problems are: Problem set: 33 solved, 145 unsolved
At refinement iteration 13 (OVERLAPS) 0/254 variables, 0/310 constraints. Problems are: Problem set: 33 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 310 constraints, problems are : Problem set: 33 solved, 145 unsolved in 9802 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 74/74 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 145/178 constraints, Known Traps: 11/11 constraints]
After SMT, in 17190ms problems are : Problem set: 33 solved, 145 unsolved
Search for dead transitions found 33 dead transitions in 17194ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 74/91 places, 147/175 transitions.
Graph (complete) has 267 edges and 74 vertex of which 46 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 45 /74 variables (removed 29) and now considering 161/147 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/91 places, 161/175 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 17278 ms. Remains : 45/91 places, 161/175 transitions.
Built C files in :
/tmp/ltsmin11275208173266571803
[2024-06-02 19:53:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11275208173266571803
Running compilation step : cd /tmp/ltsmin11275208173266571803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 795 ms.
Running link step : cd /tmp/ltsmin11275208173266571803;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11275208173266571803;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4162773488100969770.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 175/175 (removed 0) transitions.
// Phase 1: matrix 175 rows 91 cols
[2024-06-02 19:53:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:53:58] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 19:53:58] [INFO ] Invariant cache hit.
[2024-06-02 19:53:59] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:53:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:54:01] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:54:01] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:54:01] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:54:01] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:54:01] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/266 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 106 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7836 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/266 variables, 91/106 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 174/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/266 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 280 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7862 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 5/5 constraints]
After SMT, in 15817ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 15819ms
Finished structural reductions in LTL mode , in 1 iterations and 16029 ms. Remains : 91/91 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin17818983277931086457
[2024-06-02 19:54:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17818983277931086457
Running compilation step : cd /tmp/ltsmin17818983277931086457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 729 ms.
Running link step : cd /tmp/ltsmin17818983277931086457;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17818983277931086457;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9142383534315521421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 19:54:30] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:54:30] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:54:30] [INFO ] Time to serialize gal into /tmp/LTL11434126979785254327.gal : 3 ms
[2024-06-02 19:54:30] [INFO ] Time to serialize properties into /tmp/LTL10808458563198461579.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11434126979785254327.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10379526276949261626.hoa' '-atoms' '/tmp/LTL10808458563198461579.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10808458563198461579.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10379526276949261626.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t32, t33, t34, t35, t3...447
Computing Next relation with stutter on 976 deadlock states
94 unique states visited
0 strongly connected components in search stack
142 transitions explored
35 items max in DFS search stack
664 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.67159,165344,1,0,475,592188,388,291,4856,735344,996
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-08-LTLFireability-09 finished in 112571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 196
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 195
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 93 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 93 transition count 183
Applied a total of 27 rules in 5 ms. Remains 93 /106 variables (removed 13) and now considering 183/214 (removed 31) transitions.
// Phase 1: matrix 183 rows 93 cols
[2024-06-02 19:54:37] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:54:37] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:54:37] [INFO ] Invariant cache hit.
[2024-06-02 19:54:37] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-06-02 19:54:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-06-02 19:54:39] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:54:39] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:54:39] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:54:39] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/276 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 107 constraints, problems are : Problem set: 0 solved, 182 unsolved in 8604 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 183/276 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 182/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 289 constraints, problems are : Problem set: 0 solved, 182 unsolved in 10404 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 4/4 constraints]
After SMT, in 19119ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 19122ms
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 183/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19326 ms. Remains : 93/106 places, 183/214 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-11 finished in 19456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F((p1&&G(p0))))||X(G(p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 196
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 91 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 91 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 90 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 90 transition count 177
Applied a total of 33 rules in 8 ms. Remains 90 /106 variables (removed 16) and now considering 177/214 (removed 37) transitions.
// Phase 1: matrix 177 rows 90 cols
[2024-06-02 19:54:56] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:54:56] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:54:56] [INFO ] Invariant cache hit.
[2024-06-02 19:54:57] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-06-02 19:54:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:54:58] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:54:58] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:54:59] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:54:59] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/267 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 104 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7207 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/267 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 176/280 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/267 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 280 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10094 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 4/4 constraints]
After SMT, in 17409ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 17411ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 177/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17640 ms. Remains : 90/106 places, 177/214 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-12 finished in 17838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1) U G(p2))&&X(G(p2)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 200
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 192
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 192
Applied a total of 23 rules in 4 ms. Remains 95 /106 variables (removed 11) and now considering 192/214 (removed 22) transitions.
// Phase 1: matrix 192 rows 95 cols
[2024-06-02 19:55:14] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:55:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 19:55:14] [INFO ] Invariant cache hit.
[2024-06-02 19:55:15] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-06-02 19:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-02 19:55:17] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:55:17] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:55:17] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:55:17] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/287 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 109 constraints, problems are : Problem set: 0 solved, 191 unsolved in 9310 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (OVERLAPS) 192/287 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 191/300 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:55:32] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:55:32] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:55:32] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/287 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-06-02 19:55:35] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 11 (OVERLAPS) 0/287 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 305 constraints, problems are : Problem set: 0 solved, 191 unsolved in 22364 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 9/9 constraints]
After SMT, in 31882ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 31886ms
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 192/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32225 ms. Remains : 95/106 places, 192/214 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-13 finished in 32583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 91 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 91 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 90 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 90 transition count 172
Applied a total of 33 rules in 8 ms. Remains 90 /106 variables (removed 16) and now considering 172/214 (removed 42) transitions.
// Phase 1: matrix 172 rows 90 cols
[2024-06-02 19:55:47] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:55:47] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 19:55:47] [INFO ] Invariant cache hit.
[2024-06-02 19:55:47] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 19:55:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:55:49] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:55:49] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 102 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7844 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 171/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8210 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
After SMT, in 16222ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16226ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 172/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16567 ms. Remains : 90/106 places, 172/214 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-14
Product exploration explored 100000 steps with 4992 reset in 304 ms.
Product exploration explored 100000 steps with 4971 reset in 382 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1963 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (528 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 135 ms. (steps per millisecond=681 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 136 ms. (steps per millisecond=676 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-06-02 19:56:05] [INFO ] Invariant cache hit.
[2024-06-02 19:56:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:56:05] [INFO ] Invariant cache hit.
[2024-06-02 19:56:05] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-06-02 19:56:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-06-02 19:56:07] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:56:08] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 102 constraints, problems are : Problem set: 0 solved, 171 unsolved in 7725 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 172/262 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 171/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 273 constraints, problems are : Problem set: 0 solved, 171 unsolved in 8161 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 2/2 constraints]
After SMT, in 16024ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16027ms
Finished structural reductions in LTL mode , in 1 iterations and 16286 ms. Remains : 90/90 places, 172/172 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1993 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (541 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 204 ms. (steps per millisecond=451 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 204 ms. (steps per millisecond=451 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4967 reset in 198 ms.
Product exploration explored 100000 steps with 4965 reset in 210 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 85 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 85 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 85 transition count 170
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 85 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 82 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 82 transition count 167
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 82 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 76 transition count 159
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 76 transition count 159
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 76 transition count 197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 73 transition count 191
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 73 transition count 191
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 73 transition count 177
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 82 rules in 24 ms. Remains 73 /90 variables (removed 17) and now considering 177/172 (removed -5) transitions.
[2024-06-02 19:56:24] [INFO ] Redundant transitions in 17 ms returned [173]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 174 sub problems to find dead transitions.
// Phase 1: matrix 176 rows 73 cols
[2024-06-02 19:56:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:56:24] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:56:25] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-02 19:56:25] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-02 19:56:25] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:56:25] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
[2024-06-02 19:56:25] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
[2024-06-02 19:56:25] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 2 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-02 19:56:26] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
[2024-06-02 19:56:26] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 8/16 constraints. Problems are: Problem set: 30 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 30 solved, 144 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 5 (OVERLAPS) 176/249 variables, 73/89 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 70/159 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/159 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/159 constraints. Problems are: Problem set: 34 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 159 constraints, problems are : Problem set: 34 solved, 140 unsolved in 6949 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 34 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 14/58 variables, 4/4 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/12 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 12/70 variables, 4/16 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 0/16 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 6 (OVERLAPS) 175/245 variables, 70/86 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 70/156 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 140/296 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/296 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 4/249 variables, 3/299 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/249 variables, 0/299 constraints. Problems are: Problem set: 34 solved, 140 unsolved
At refinement iteration 12 (OVERLAPS) 0/249 variables, 0/299 constraints. Problems are: Problem set: 34 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 299 constraints, problems are : Problem set: 34 solved, 140 unsolved in 9371 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 73/73 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 140/174 constraints, Known Traps: 8/8 constraints]
After SMT, in 16517ms problems are : Problem set: 34 solved, 140 unsolved
Search for dead transitions found 34 dead transitions in 16518ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 142/172 transitions.
Graph (complete) has 263 edges and 73 vertex of which 45 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 156
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 8 ms. Remains 44 /73 variables (removed 29) and now considering 156/142 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/90 places, 156/172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16573 ms. Remains : 44/90 places, 156/172 transitions.
Built C files in :
/tmp/ltsmin14834562702171179549
[2024-06-02 19:56:40] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14834562702171179549
Running compilation step : cd /tmp/ltsmin14834562702171179549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 524 ms.
Running link step : cd /tmp/ltsmin14834562702171179549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14834562702171179549;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5511043029432426136.hoa' '--buchi-type=spotba'
LTSmin run took 2007 ms.
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLFireability-14 finished in 55992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 93 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 93 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 91 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 91 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 90 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 90 transition count 175
Applied a total of 32 rules in 3 ms. Remains 90 /106 variables (removed 16) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 90 cols
[2024-06-02 19:56:43] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:56:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 19:56:43] [INFO ] Invariant cache hit.
[2024-06-02 19:56:43] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-06-02 19:56:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-06-02 19:56:45] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:56:45] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 102 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7562 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/265 variables, 90/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 174/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/265 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 276 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
After SMT, in 14890ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 14892ms
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15095 ms. Remains : 90/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-15
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-15 finished in 15297 ms.
All properties solved by simple procedures.
Total runtime 548167 ms.

BK_STOP 1717358218620

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

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