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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 107K 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-10-LTLCardinality-00
FORMULA_NAME MedleyA-PT-10-LTLCardinality-01
FORMULA_NAME MedleyA-PT-10-LTLCardinality-02
FORMULA_NAME MedleyA-PT-10-LTLCardinality-03
FORMULA_NAME MedleyA-PT-10-LTLCardinality-04
FORMULA_NAME MedleyA-PT-10-LTLCardinality-05
FORMULA_NAME MedleyA-PT-10-LTLCardinality-06
FORMULA_NAME MedleyA-PT-10-LTLCardinality-07
FORMULA_NAME MedleyA-PT-10-LTLCardinality-08
FORMULA_NAME MedleyA-PT-10-LTLCardinality-09
FORMULA_NAME MedleyA-PT-10-LTLCardinality-10
FORMULA_NAME MedleyA-PT-10-LTLCardinality-11
FORMULA_NAME MedleyA-PT-10-LTLCardinality-12
FORMULA_NAME MedleyA-PT-10-LTLCardinality-13
FORMULA_NAME MedleyA-PT-10-LTLCardinality-14
FORMULA_NAME MedleyA-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717357769362

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 19:49:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:49:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:49:31] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-06-02 19:49:31] [INFO ] Transformed 149 places.
[2024-06-02 19:49:31] [INFO ] Transformed 340 transitions.
[2024-06-02 19:49:31] [INFO ] Found NUPN structural information;
[2024-06-02 19:49:31] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 113 transition count 302
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 113 transition count 302
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 113 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 111 transition count 291
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 111 transition count 291
Applied a total of 75 rules in 84 ms. Remains 111 /149 variables (removed 38) and now considering 291/340 (removed 49) transitions.
// Phase 1: matrix 291 rows 111 cols
[2024-06-02 19:49:32] [INFO ] Computed 10 invariants in 31 ms
[2024-06-02 19:49:32] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-06-02 19:49:32] [INFO ] Invariant cache hit.
[2024-06-02 19:49:32] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-06-02 19:49:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 290 unsolved
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/111 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 21 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 37 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:49:36] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:49:37] [INFO ] Deduced a trap composed of 46 places in 134 ms of which 2 ms to minimize.
[2024-06-02 19:49:37] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 5/15 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/16 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:49:39] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 1 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:49:40] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 4/20 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:49:41] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:49:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/22 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/22 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 291/402 variables, 111/133 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:49:44] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 1/134 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/134 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 0/402 variables, 0/134 constraints. Problems are: Problem set: 64 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 134 constraints, problems are : Problem set: 64 solved, 226 unsolved in 16217 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 64 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 4/10 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 13/23 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/23 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 291/402 variables, 111/134 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 226/360 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:49:54] [INFO ] Deduced a trap composed of 26 places in 149 ms of which 8 ms to minimize.
[2024-06-02 19:49:55] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-06-02 19:49:55] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 3/363 constraints. Problems are: Problem set: 64 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/363 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:50:05] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:50:06] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/402 variables, 2/365 constraints. Problems are: Problem set: 64 solved, 226 unsolved
[2024-06-02 19:50:16] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/402 variables, and 366 constraints, problems are : Problem set: 64 solved, 226 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 226/290 constraints, Known Traps: 19/19 constraints]
After SMT, in 47231ms problems are : Problem set: 64 solved, 226 unsolved
Search for dead transitions found 64 dead transitions in 47259ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 111/149 places, 227/340 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48193 ms. Remains : 111/149 places, 227/340 transitions.
Support contains 36 out of 111 places after structural reductions.
[2024-06-02 19:50:20] [INFO ] Flatten gal took : 80 ms
[2024-06-02 19:50:20] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:50:20] [INFO ] Input system was already deterministic with 227 transitions.
RANDOM walk for 40000 steps (1743 resets) in 2426 ms. (16 steps per ms) remains 8/23 properties
BEST_FIRST walk for 40004 steps (429 resets) in 403 ms. (99 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (415 resets) in 156 ms. (254 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (473 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (423 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (433 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (432 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (437 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (429 resets) in 98 ms. (404 steps per ms) remains 8/8 properties
// Phase 1: matrix 227 rows 111 cols
[2024-06-02 19:50:21] [INFO ] Computed 10 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 36/97 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 218/315 variables, 97/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 16/331 variables, 10/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 6/337 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/338 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/338 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 121 constraints, problems are : Problem set: 0 solved, 8 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 36/97 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:50:22] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:50:22] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 218/315 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 16/331 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/331 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 6/337 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/338 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/338 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 19:50:23] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/338 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/338 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/338 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 132 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1820 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 2373ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 331 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=165 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 749 ms.
FORMULA MedleyA-PT-10-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 11 stable transitions
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 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)||G(p1))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 109 transition count 214
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 98 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 97 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 27 place count 97 transition count 208
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 33 place count 94 transition count 208
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 44 place count 83 transition count 194
Iterating global reduction 3 with 11 rules applied. Total rules applied 55 place count 83 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 55 place count 83 transition count 192
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 59 place count 81 transition count 192
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 63 place count 77 transition count 183
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 77 transition count 183
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 3 with 32 rules applied. Total rules applied 99 place count 60 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 102 place count 60 transition count 165
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 57 transition count 160
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 57 transition count 160
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 126 place count 48 transition count 214
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 4 with 46 rules applied. Total rules applied 172 place count 48 transition count 168
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 4 with 4 rules applied. Total rules applied 176 place count 46 transition count 191
Applied a total of 176 rules in 95 ms. Remains 46 /111 variables (removed 65) and now considering 191/227 (removed 36) transitions.
// Phase 1: matrix 191 rows 46 cols
[2024-06-02 19:50:25] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:50:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 19:50:25] [INFO ] Invariant cache hit.
[2024-06-02 19:50:25] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-02 19:50:25] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-02 19:50:25] [INFO ] Redundant transitions in 10 ms returned []
Running 185 sub problems to find dead transitions.
[2024-06-02 19:50:25] [INFO ] Invariant cache hit.
[2024-06-02 19:50:25] [INFO ] State equation strengthened by 106 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 191/236 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 106/159 constraints. Problems are: Problem set: 0 solved, 185 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 1/237 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 160 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6674 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 191/236 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 106/159 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 185/344 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (OVERLAPS) 1/237 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/237 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 345 constraints, problems are : Problem set: 0 solved, 185 unsolved in 25384 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints]
After SMT, in 32409ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 32413ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/111 places, 191/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32780 ms. Remains : 46/111 places, 191/227 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-00 finished in 33107 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)))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 91 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 91 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 14 ms. Remains 88 /111 variables (removed 23) and now considering 182/227 (removed 45) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 19:50:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:50:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 19:50:58] [INFO ] Invariant cache hit.
[2024-06-02 19:50:58] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-06-02 19:50:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:51:00] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:51:00] [INFO ] Deduced a trap composed of 38 places in 51 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, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:51:03] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/270 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:51:04] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/270 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/270 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 0/270 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 104 constraints, problems are : Problem set: 0 solved, 181 unsolved in 12000 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/104 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/285 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 285 constraints, problems are : Problem set: 0 solved, 181 unsolved in 8537 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 6/6 constraints]
After SMT, in 20740ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 20744ms
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21027 ms. Remains : 88/111 places, 182/227 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 350 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-01 finished in 21653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (p1 U (G(p2) U p3))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 109 transition count 216
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 23 place count 100 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 98 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 25 place count 98 transition count 209
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 95 transition count 209
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 44 place count 82 transition count 192
Iterating global reduction 3 with 13 rules applied. Total rules applied 57 place count 82 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 57 place count 82 transition count 190
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 61 place count 80 transition count 190
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 65 place count 76 transition count 180
Iterating global reduction 3 with 4 rules applied. Total rules applied 69 place count 76 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 75 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 75 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 74 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 74 transition count 175
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 3 with 32 rules applied. Total rules applied 105 place count 57 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 109 place count 57 transition count 156
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 112 place count 54 transition count 151
Iterating global reduction 4 with 3 rules applied. Total rules applied 115 place count 54 transition count 151
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 125 place count 49 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 139 place count 49 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 47 transition count 184
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 46 transition count 183
Applied a total of 144 rules in 63 ms. Remains 46 /111 variables (removed 65) and now considering 183/227 (removed 44) transitions.
// Phase 1: matrix 183 rows 46 cols
[2024-06-02 19:51:20] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:51:20] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-02 19:51:20] [INFO ] Invariant cache hit.
[2024-06-02 19:51:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:51:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-06-02 19:51:20] [INFO ] Redundant transitions in 8 ms returned []
Running 177 sub problems to find dead transitions.
[2024-06-02 19:51:20] [INFO ] Invariant cache hit.
[2024-06-02 19:51:20] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 182/227 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 94/147 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 2/229 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/229 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 148 constraints, problems are : Problem set: 0 solved, 177 unsolved in 6153 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 182/227 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 94/147 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 176/323 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 2/229 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 11 (OVERLAPS) 0/229 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 325 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10475 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 46/46 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 16907ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 16909ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/111 places, 183/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17383 ms. Remains : 46/111 places, 183/227 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p3), true, (NOT p0), (NOT p2), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p2)), (AND p2 (NOT p3) (NOT p0) p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-03
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-03 finished in 17765 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 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 109 transition count 214
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 98 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 97 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 97 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 96 transition count 210
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 41 place count 84 transition count 195
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 84 transition count 195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 53 place count 84 transition count 193
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 57 place count 82 transition count 193
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 61 place count 78 transition count 182
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 78 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 77 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 77 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 76 transition count 177
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 76 transition count 177
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 3 with 32 rules applied. Total rules applied 101 place count 59 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 105 place count 59 transition count 158
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 109 place count 55 transition count 150
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 55 transition count 150
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 127 place count 48 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 155 place count 48 transition count 159
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 4 with 4 rules applied. Total rules applied 159 place count 46 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 160 place count 45 transition count 181
Applied a total of 160 rules in 68 ms. Remains 45 /111 variables (removed 66) and now considering 181/227 (removed 46) transitions.
// Phase 1: matrix 181 rows 45 cols
[2024-06-02 19:51:37] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:51:38] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 19:51:38] [INFO ] Invariant cache hit.
[2024-06-02 19:51:38] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-06-02 19:51:38] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-06-02 19:51:38] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 19:51:38] [INFO ] Invariant cache hit.
[2024-06-02 19:51:38] [INFO ] State equation strengthened by 95 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 181/225 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 95/147 constraints. Problems are: Problem set: 0 solved, 176 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 1/226 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/226 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/226 variables, and 148 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5677 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 181/225 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 95/147 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 175/322 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 1/226 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/226 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/226 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 226/226 variables, and 324 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12084 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 18005ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 18008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/111 places, 181/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 18480 ms. Remains : 45/111 places, 181/227 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-06 finished in 18620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||F(p1)))))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 91 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 91 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 11 ms. Remains 88 /111 variables (removed 23) and now considering 182/227 (removed 45) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 19:51:56] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:51:56] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 19:51:56] [INFO ] Invariant cache hit.
[2024-06-02 19:51:56] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-06-02 19:51:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:51:58] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:51:58] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:52:00] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 181 unsolved in 6873 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/282 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:52:06] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 283 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11297 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 4/4 constraints]
After SMT, in 18371ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 18374ms
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18645 ms. Remains : 88/111 places, 182/227 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-07
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-07 finished in 18796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!(p0 U p1) U p2) U X(p0)))'
Support contains 6 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 209
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 97 transition count 207
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 91 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 91 transition count 190
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 89 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 88 transition count 182
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 88 transition count 182
Applied a total of 48 rules in 7 ms. Remains 88 /111 variables (removed 23) and now considering 182/227 (removed 45) transitions.
// Phase 1: matrix 182 rows 88 cols
[2024-06-02 19:52:15] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 19:52:15] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:52:15] [INFO ] Invariant cache hit.
[2024-06-02 19:52:15] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-06-02 19:52:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:52:17] [INFO ] Deduced a trap composed of 38 places in 50 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, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:52:18] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 19:52:21] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:52:21] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/270 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/270 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 103 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/270 variables, 88/103 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 181/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 284 constraints, problems are : Problem set: 0 solved, 181 unsolved in 8483 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 88/88 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints]
After SMT, in 17743ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 17746ms
Starting structural reductions in LTL mode, iteration 1 : 88/111 places, 182/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18001 ms. Remains : 88/111 places, 182/227 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND p2 p1 (NOT p0)), true, (NOT p2), p1]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 350 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 19 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-08 finished in 18605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p1))||p0)))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 96 transition count 208
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 96 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 96 transition count 206
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 90 transition count 189
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 90 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 88 transition count 184
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 88 transition count 184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 87 transition count 181
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 87 transition count 181
Applied a total of 50 rules in 8 ms. Remains 87 /111 variables (removed 24) and now considering 181/227 (removed 46) transitions.
// Phase 1: matrix 181 rows 87 cols
[2024-06-02 19:52:33] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:52:34] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 19:52:34] [INFO ] Invariant cache hit.
[2024-06-02 19:52:34] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-06-02 19:52:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 19:52:35] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-02 19:52:35] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 19:52:37] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 100 constraints, problems are : Problem set: 0 solved, 180 unsolved in 6293 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 181/268 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 180/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 280 constraints, problems are : Problem set: 0 solved, 180 unsolved in 8487 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 87/87 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 3/3 constraints]
After SMT, in 14947ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 14950ms
Starting structural reductions in LTL mode, iteration 1 : 87/111 places, 181/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15242 ms. Remains : 87/111 places, 181/227 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLCardinality-10 finished in 15384 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 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 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 109 transition count 213
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 97 transition count 211
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 97 transition count 207
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 35 place count 93 transition count 207
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 45 place count 83 transition count 194
Iterating global reduction 2 with 10 rules applied. Total rules applied 55 place count 83 transition count 194
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 55 place count 83 transition count 192
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 59 place count 81 transition count 192
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 76 transition count 178
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 76 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 75 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 75 transition count 176
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 100 place count 60 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 104 place count 60 transition count 158
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 108 place count 56 transition count 150
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 56 transition count 150
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 128 place count 48 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 156 place count 48 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
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 160 place count 46 transition count 180
Applied a total of 160 rules in 47 ms. Remains 46 /111 variables (removed 65) and now considering 180/227 (removed 47) transitions.
// Phase 1: matrix 180 rows 46 cols
[2024-06-02 19:52:49] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 19:52:49] [INFO ] Implicit Places using invariants in 73 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/111 places, 180/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 45/111 places, 180/227 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-11
Product exploration explored 100000 steps with 12297 reset in 319 ms.
Product exploration explored 100000 steps with 12327 reset in 362 ms.
Computed a total of 11 stabilizing places and 104 stable transitions
Computed a total of 11 stabilizing places and 104 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 29155 steps (3587 resets) in 154 ms. (188 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 45 cols
[2024-06-02 19:52:50] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:52:51] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 19:52:51] [INFO ] Invariant cache hit.
[2024-06-02 19:52:51] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-02 19:52:51] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 19:52:51] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 19:52:51] [INFO ] Invariant cache hit.
[2024-06-02 19:52:51] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 180/224 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 100/152 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 153 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7152 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 180/224 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 100/152 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 176/328 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:53:01] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 1/225 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 330 constraints, problems are : Problem set: 0 solved, 176 unsolved in 12253 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 1/1 constraints]
After SMT, in 19637ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19639ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19903 ms. Remains : 45/45 places, 180/180 transitions.
Computed a total of 11 stabilizing places and 104 stable transitions
Computed a total of 11 stabilizing places and 104 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 35278 steps (4347 resets) in 118 ms. (296 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12298 reset in 247 ms.
Product exploration explored 100000 steps with 12353 reset in 534 ms.
Support contains 4 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-06-02 19:53:12] [INFO ] Invariant cache hit.
[2024-06-02 19:53:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:53:12] [INFO ] Invariant cache hit.
[2024-06-02 19:53:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-02 19:53:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-06-02 19:53:12] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 19:53:12] [INFO ] Invariant cache hit.
[2024-06-02 19:53:12] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 180/224 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 100/152 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 1/225 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 0/225 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 153 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 180/224 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 100/152 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 176/328 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-06-02 19:53:22] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 1/225 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/225 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (OVERLAPS) 0/225 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 330 constraints, problems are : Problem set: 0 solved, 176 unsolved in 11840 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 1/1 constraints]
After SMT, in 19127ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19386 ms. Remains : 45/45 places, 180/180 transitions.
Treatment of property MedleyA-PT-10-LTLCardinality-11 finished in 42664 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((X(p1)||p0))))'
Support contains 4 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 100 transition count 213
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 100 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 100 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 97 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 97 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 96 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 96 transition count 199
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 95 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 95 transition count 196
Applied a total of 33 rules in 8 ms. Remains 95 /111 variables (removed 16) and now considering 196/227 (removed 31) transitions.
// Phase 1: matrix 196 rows 95 cols
[2024-06-02 19:53:31] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:53:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 19:53:32] [INFO ] Invariant cache hit.
[2024-06-02 19:53:32] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-02 19:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 19:53:33] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:53:33] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:53:34] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/291 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-02 19:53:35] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 109 constraints, problems are : Problem set: 0 solved, 195 unsolved in 7430 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 196/291 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 195/304 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 304 constraints, problems are : Problem set: 0 solved, 195 unsolved in 9722 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 4/4 constraints]
After SMT, in 17335ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 17339ms
Starting structural reductions in LTL mode, iteration 1 : 95/111 places, 196/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17607 ms. Remains : 95/111 places, 196/227 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 374 edges and 95 vertex of which 94 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLCardinality-12 finished in 18258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 227/227 transitions.
Graph (complete) has 434 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 109 transition count 212
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 96 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 29 place count 96 transition count 207
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 35 place count 93 transition count 207
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 47 place count 81 transition count 191
Iterating global reduction 2 with 12 rules applied. Total rules applied 59 place count 81 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 59 place count 81 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 80 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 76 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 76 transition count 181
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 103 place count 58 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 58 transition count 161
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 111 place count 54 transition count 153
Iterating global reduction 3 with 4 rules applied. Total rules applied 115 place count 54 transition count 153
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 131 place count 46 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 161 place count 46 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 163 place count 45 transition count 175
Applied a total of 163 rules in 27 ms. Remains 45 /111 variables (removed 66) and now considering 175/227 (removed 52) transitions.
// Phase 1: matrix 175 rows 45 cols
[2024-06-02 19:53:50] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:53:50] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 19:53:50] [INFO ] Invariant cache hit.
[2024-06-02 19:53:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:53:50] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 19:53:50] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-02 19:53:50] [INFO ] Invariant cache hit.
[2024-06-02 19:53:50] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 175/219 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/220 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 147 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5759 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 175/219 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 171/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 318 constraints, problems are : Problem set: 0 solved, 171 unsolved in 9610 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 15593ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 15595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/111 places, 175/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15854 ms. Remains : 45/111 places, 175/227 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 14043 reset in 253 ms.
Product exploration explored 100000 steps with 14068 reset in 268 ms.
Computed a total of 6 stabilizing places and 68 stable transitions
Computed a total of 6 stabilizing places and 68 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 30765 steps (4352 resets) in 110 ms. (277 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 19:54:07] [INFO ] Invariant cache hit.
[2024-06-02 19:54:07] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 19:54:07] [INFO ] Invariant cache hit.
[2024-06-02 19:54:07] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:54:07] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-02 19:54:07] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-02 19:54:07] [INFO ] Invariant cache hit.
[2024-06-02 19:54:07] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 175/219 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/220 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 147 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6044 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 175/219 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 171/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 318 constraints, problems are : Problem set: 0 solved, 171 unsolved in 9901 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 16203ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16469 ms. Remains : 45/45 places, 175/175 transitions.
Computed a total of 6 stabilizing places and 68 stable transitions
Computed a total of 6 stabilizing places and 68 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 31944 steps (4463 resets) in 91 ms. (347 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13995 reset in 256 ms.
Product exploration explored 100000 steps with 14042 reset in 272 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 19:54:24] [INFO ] Invariant cache hit.
[2024-06-02 19:54:24] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 19:54:24] [INFO ] Invariant cache hit.
[2024-06-02 19:54:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 19:54:24] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 19:54:24] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2024-06-02 19:54:24] [INFO ] Invariant cache hit.
[2024-06-02 19:54:24] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 175/219 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 1/220 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (OVERLAPS) 0/220 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 147 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5554 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 1/44 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 175/219 variables, 44/52 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 94/146 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 171/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 8 (OVERLAPS) 1/220 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 10 (OVERLAPS) 0/220 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 318 constraints, problems are : Problem set: 0 solved, 171 unsolved in 10348 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints]
After SMT, in 16135ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 16137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16383 ms. Remains : 45/45 places, 175/175 transitions.
Treatment of property MedleyA-PT-10-LTLCardinality-14 finished in 50654 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)))))'
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)))'
[2024-06-02 19:54:41] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:54:41] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 19:54:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 227 transitions and 1077 arcs took 12 ms.
Total runtime 310165 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 111
TRANSITIONS: 227
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.003s]


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


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

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

Process ID: 1286
MODEL NAME: /home/mcc/execution/414/model
111 places, 227 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-10-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-10-LTLCardinality-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717358697994

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919500075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-10.tgz
mv MedleyA-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;