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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 150K 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-23-LTLCardinality-00
FORMULA_NAME MedleyA-PT-23-LTLCardinality-01
FORMULA_NAME MedleyA-PT-23-LTLCardinality-02
FORMULA_NAME MedleyA-PT-23-LTLCardinality-03
FORMULA_NAME MedleyA-PT-23-LTLCardinality-04
FORMULA_NAME MedleyA-PT-23-LTLCardinality-05
FORMULA_NAME MedleyA-PT-23-LTLCardinality-06
FORMULA_NAME MedleyA-PT-23-LTLCardinality-07
FORMULA_NAME MedleyA-PT-23-LTLCardinality-08
FORMULA_NAME MedleyA-PT-23-LTLCardinality-09
FORMULA_NAME MedleyA-PT-23-LTLCardinality-10
FORMULA_NAME MedleyA-PT-23-LTLCardinality-11
FORMULA_NAME MedleyA-PT-23-LTLCardinality-12
FORMULA_NAME MedleyA-PT-23-LTLCardinality-13
FORMULA_NAME MedleyA-PT-23-LTLCardinality-14
FORMULA_NAME MedleyA-PT-23-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717365922375

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 22:05:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:05:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:05:24] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-06-02 22:05:24] [INFO ] Transformed 378 places.
[2024-06-02 22:05:24] [INFO ] Transformed 614 transitions.
[2024-06-02 22:05:24] [INFO ] Found NUPN structural information;
[2024-06-02 22:05:24] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MedleyA-PT-23-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 96 place count 282 transition count 521
Iterating global reduction 1 with 93 rules applied. Total rules applied 189 place count 282 transition count 521
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 257 place count 214 transition count 453
Iterating global reduction 1 with 68 rules applied. Total rules applied 325 place count 214 transition count 453
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 351 place count 188 transition count 407
Iterating global reduction 1 with 26 rules applied. Total rules applied 377 place count 188 transition count 407
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 389 place count 176 transition count 373
Iterating global reduction 1 with 12 rules applied. Total rules applied 401 place count 176 transition count 373
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 404 place count 176 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 171 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 171 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 419 place count 171 transition count 353
Applied a total of 419 rules in 173 ms. Remains 171 /378 variables (removed 207) and now considering 353/614 (removed 261) transitions.
// Phase 1: matrix 353 rows 171 cols
[2024-06-02 22:05:25] [INFO ] Computed 8 invariants in 31 ms
[2024-06-02 22:05:25] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-06-02 22:05:25] [INFO ] Invariant cache hit.
[2024-06-02 22:05:26] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Running 352 sub problems to find dead transitions.
[2024-06-02 22:05:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (OVERLAPS) 353/524 variables, 171/179 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-02 22:05:34] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (OVERLAPS) 0/524 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 180 constraints, problems are : Problem set: 0 solved, 352 unsolved in 18857 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (OVERLAPS) 353/524 variables, 171/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 352/532 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-02 22:05:51] [INFO ] Deduced a trap composed of 49 places in 104 ms of which 3 ms to minimize.
[2024-06-02 22:05:52] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 352 unsolved
[2024-06-02 22:06:07] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/524 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 535 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 352/352 constraints, Known Traps: 4/4 constraints]
After SMT, in 49315ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 49343ms
Starting structural reductions in LTL mode, iteration 1 : 171/378 places, 353/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50536 ms. Remains : 171/378 places, 353/614 transitions.
Support contains 14 out of 171 places after structural reductions.
[2024-06-02 22:06:15] [INFO ] Flatten gal took : 99 ms
[2024-06-02 22:06:15] [INFO ] Flatten gal took : 46 ms
[2024-06-02 22:06:15] [INFO ] Input system was already deterministic with 353 transitions.
RANDOM walk for 40000 steps (32 resets) in 1424 ms. (28 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40002 steps (23 resets) in 289 ms. (137 steps per ms) remains 1/1 properties
[2024-06-02 22:06:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/60 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/297 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/480 variables, 87/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 35/515 variables, 18/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/524 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/524 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 179 constraints, problems are : Problem set: 0 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/60 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 237/297 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 183/480 variables, 87/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 35/515 variables, 18/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 9/524 variables, 6/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/524 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 180 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 439ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 340 steps, including 15 resets, run visited all 1 properties in 10 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 20 ms.
FORMULA MedleyA-PT-23-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 17 / 171 are part of one of the 3 SCC in 6 ms
Free SCC test removed 14 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 156 transition count 320
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 146 transition count 320
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 146 transition count 311
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 137 transition count 311
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 53 place count 123 transition count 291
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 123 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 67 place count 123 transition count 290
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 122 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 118 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 118 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 118 transition count 276
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 129 place count 93 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 133 place count 93 transition count 247
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 142 place count 84 transition count 220
Iterating global reduction 4 with 9 rules applied. Total rules applied 151 place count 84 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 84 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 83 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 174 place count 74 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 185 place count 74 transition count 220
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 71 transition count 211
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 71 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 71 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 69 transition count 206
Applied a total of 196 rules in 147 ms. Remains 69 /171 variables (removed 102) and now considering 206/353 (removed 147) transitions.
[2024-06-02 22:06:17] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
// Phase 1: matrix 196 rows 69 cols
[2024-06-02 22:06:17] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:06:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 22:06:17] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:17] [INFO ] Invariant cache hit.
[2024-06-02 22:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:06:17] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-06-02 22:06:17] [INFO ] Redundant transitions in 10 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 22:06:17] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:17] [INFO ] Invariant cache hit.
[2024-06-02 22:06:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 192/258 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/264 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 78 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4651 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 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/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 192/258 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/264 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 176/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5683 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 10491ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 10496ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/171 places, 206/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10929 ms. Remains : 69/171 places, 206/353 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-03
Product exploration explored 100000 steps with 4 reset in 317 ms.
Product exploration explored 100000 steps with 10 reset in 229 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13366 steps (13 resets) in 107 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 206/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 69 /69 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-02 22:06:29] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:29] [INFO ] Invariant cache hit.
[2024-06-02 22:06:29] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 22:06:29] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:29] [INFO ] Invariant cache hit.
[2024-06-02 22:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:06:29] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 22:06:29] [INFO ] Redundant transitions in 9 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 22:06:29] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:29] [INFO ] Invariant cache hit.
[2024-06-02 22:06:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 192/258 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/264 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 78 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4557 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 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/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 192/258 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/264 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 176/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5787 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 10480ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 10483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10755 ms. Remains : 69/69 places, 206/206 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 16725 steps (12 resets) in 33 ms. (491 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 110 ms.
Product exploration explored 100000 steps with 1 reset in 216 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 206/206 transitions.
Applied a total of 0 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-02 22:06:41] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:41] [INFO ] Invariant cache hit.
[2024-06-02 22:06:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 22:06:41] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:41] [INFO ] Invariant cache hit.
[2024-06-02 22:06:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:06:41] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 22:06:41] [INFO ] Redundant transitions in 3 ms returned []
Running 176 sub problems to find dead transitions.
[2024-06-02 22:06:41] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:06:41] [INFO ] Invariant cache hit.
[2024-06-02 22:06:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 192/258 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/264 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/264 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 78 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4677 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 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/66 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 192/258 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 6/264 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 176/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 254 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6158 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 69/69 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 10934ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 10937ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11271 ms. Remains : 69/69 places, 206/206 transitions.
Treatment of property MedleyA-PT-23-LTLCardinality-03 finished in 35591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 138 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 155 transition count 317
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 145 transition count 317
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 145 transition count 308
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 136 transition count 308
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 53 place count 122 transition count 287
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 122 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 67 place count 122 transition count 286
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 69 place count 121 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 116 transition count 271
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 116 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 116 transition count 268
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 132 place count 91 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 91 transition count 239
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 83 transition count 215
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 83 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 83 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 82 transition count 211
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 175 place count 73 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 184 place count 73 transition count 217
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 187 place count 70 transition count 208
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 70 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 193 place count 70 transition count 205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 68 transition count 203
Applied a total of 195 rules in 80 ms. Remains 68 /171 variables (removed 103) and now considering 203/353 (removed 150) transitions.
[2024-06-02 22:06:52] [INFO ] Flow matrix only has 193 transitions (discarded 10 similar events)
// Phase 1: matrix 193 rows 68 cols
[2024-06-02 22:06:52] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:06:53] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-06-02 22:06:53] [INFO ] Flow matrix only has 193 transitions (discarded 10 similar events)
[2024-06-02 22:06:53] [INFO ] Invariant cache hit.
[2024-06-02 22:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:06:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-06-02 22:06:53] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2024-06-02 22:06:53] [INFO ] Flow matrix only has 193 transitions (discarded 10 similar events)
[2024-06-02 22:06:53] [INFO ] Invariant cache hit.
[2024-06-02 22:06:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 189/254 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 6/260 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/261 variables, and 77 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 189/254 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 6/260 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 175/252 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/260 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/261 variables, and 252 constraints, problems are : Problem set: 0 solved, 175 unsolved in 5714 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 10346ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 10349ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/171 places, 203/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10815 ms. Remains : 68/171 places, 203/353 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-04 finished in 10907 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 U p1) U (G((p0 U p1))||((p0 U p1)&&G(p0)))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 136 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 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 155 transition count 318
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 146 transition count 318
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 19 place count 146 transition count 309
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 37 place count 137 transition count 309
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 124 transition count 289
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 124 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 63 place count 124 transition count 288
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 123 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 119 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 119 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 119 transition count 273
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 122 place count 96 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 96 transition count 246
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 134 place count 88 transition count 222
Iterating global reduction 4 with 8 rules applied. Total rules applied 142 place count 88 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 145 place count 88 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 87 transition count 218
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 165 place count 78 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 174 place count 78 transition count 224
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 177 place count 75 transition count 215
Iterating global reduction 5 with 3 rules applied. Total rules applied 180 place count 75 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 183 place count 75 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 73 transition count 210
Applied a total of 185 rules in 60 ms. Remains 73 /171 variables (removed 98) and now considering 210/353 (removed 143) transitions.
[2024-06-02 22:07:03] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
// Phase 1: matrix 200 rows 73 cols
[2024-06-02 22:07:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:07:03] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-06-02 22:07:03] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:03] [INFO ] Invariant cache hit.
[2024-06-02 22:07:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:07:04] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 22:07:04] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-06-02 22:07:04] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:04] [INFO ] Invariant cache hit.
[2024-06-02 22:07:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 196/266 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 6/272 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/273 variables, and 82 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4973 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 196/266 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 6/272 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 179/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/273 variables, and 264 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5873 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 10949ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 10952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/171 places, 210/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11337 ms. Remains : 73/171 places, 210/353 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-09
Product exploration explored 100000 steps with 15 reset in 172 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (16 resets) in 268 ms. (148 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (28 resets) in 138 ms. (287 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (18 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (17 resets) in 213 ms. (186 steps per ms) remains 3/3 properties
[2024-06-02 22:07:16] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:16] [INFO ] Invariant cache hit.
[2024-06-02 22:07:16] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 173/205 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 63/268 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/272 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/273 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 173/205 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 63/268 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/269 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 3/272 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/272 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/272 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/273 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 399ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 793 steps, including 68 resets, run visited all 3 properties in 4 ms. (steps per millisecond=198 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 387 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 210/210 transitions.
Applied a total of 0 rules in 12 ms. Remains 73 /73 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-02 22:07:17] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:17] [INFO ] Invariant cache hit.
[2024-06-02 22:07:17] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:07:17] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:17] [INFO ] Invariant cache hit.
[2024-06-02 22:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:07:17] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-06-02 22:07:17] [INFO ] Redundant transitions in 1 ms returned []
Running 182 sub problems to find dead transitions.
[2024-06-02 22:07:17] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:17] [INFO ] Invariant cache hit.
[2024-06-02 22:07:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 196/266 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (OVERLAPS) 6/272 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/273 variables, and 82 constraints, problems are : Problem set: 0 solved, 182 unsolved in 4875 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 196/266 variables, 70/78 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (OVERLAPS) 6/272 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 179/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/273 variables, and 264 constraints, problems are : Problem set: 0 solved, 182 unsolved in 5846 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 0/0 constraints]
After SMT, in 10826ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 10829ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11075 ms. Remains : 73/73 places, 210/210 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 236 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (63 resets) in 195 ms. (204 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (50 resets) in 215 ms. (185 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (26 resets) in 168 ms. (236 steps per ms) remains 1/3 properties
[2024-06-02 22:07:29] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:07:29] [INFO ] Invariant cache hit.
[2024-06-02 22:07:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/205 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/268 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/272 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/273 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/32 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 173/205 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/268 variables, 39/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/269 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/272 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/272 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/273 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 210/210 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 73 transition count 201
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 29 place count 73 transition count 181
Reduce places removed 21 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 52 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 49 transition count 172
Applied a total of 62 rules in 12 ms. Remains 49 /73 variables (removed 24) and now considering 172/210 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 49/73 places, 172/210 transitions.
RANDOM walk for 393 steps (4 resets) in 7 ms. (49 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 395 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4 reset in 153 ms.
Stuttering criterion allowed to conclude after 37 steps with 4 reset in 1 ms.
FORMULA MedleyA-PT-23-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-09 finished in 27154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 163 transition count 343
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 163 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 163 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 157 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 157 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 157 transition count 327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 155 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 155 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 154 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 154 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 153 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 153 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 153 transition count 317
Applied a total of 39 rules in 14 ms. Remains 153 /171 variables (removed 18) and now considering 317/353 (removed 36) transitions.
// Phase 1: matrix 317 rows 153 cols
[2024-06-02 22:07:30] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:07:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:07:30] [INFO ] Invariant cache hit.
[2024-06-02 22:07:31] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 316 sub problems to find dead transitions.
[2024-06-02 22:07:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (OVERLAPS) 317/470 variables, 153/161 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 22:07:37] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 2 ms to minimize.
[2024-06-02 22:07:39] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 6 (OVERLAPS) 0/470 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 316 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 163 constraints, problems are : Problem set: 0 solved, 316 unsolved in 15370 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 316 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (OVERLAPS) 317/470 variables, 153/163 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 316/479 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 22:07:51] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:07:51] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 22:07:57] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 22:08:10] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/470 variables, 1/483 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-02 22:08:14] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 484 constraints, problems are : Problem set: 0 solved, 316 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 7/7 constraints]
After SMT, in 45576ms problems are : Problem set: 0 solved, 316 unsolved
Search for dead transitions found 0 dead transitions in 45586ms
Starting structural reductions in LTL mode, iteration 1 : 153/171 places, 317/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45993 ms. Remains : 153/171 places, 317/353 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 463 steps with 8 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-11 finished in 46092 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 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 137 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 156 transition count 320
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 148 transition count 320
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 17 place count 148 transition count 310
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 37 place count 138 transition count 310
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 125 transition count 290
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 125 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 63 place count 125 transition count 289
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 65 place count 124 transition count 289
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 121 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 121 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 121 transition count 278
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 127 place count 94 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 131 place count 94 transition count 247
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 140 place count 85 transition count 220
Iterating global reduction 4 with 9 rules applied. Total rules applied 149 place count 85 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 152 place count 85 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 84 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 172 place count 75 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 181 place count 75 transition count 222
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 184 place count 72 transition count 213
Iterating global reduction 5 with 3 rules applied. Total rules applied 187 place count 72 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 190 place count 72 transition count 210
Applied a total of 190 rules in 35 ms. Remains 72 /171 variables (removed 99) and now considering 210/353 (removed 143) transitions.
[2024-06-02 22:08:16] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
// Phase 1: matrix 200 rows 72 cols
[2024-06-02 22:08:16] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:08:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:08:17] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:17] [INFO ] Invariant cache hit.
[2024-06-02 22:08:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:08:17] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-06-02 22:08:17] [INFO ] Redundant transitions in 0 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 22:08:17] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:17] [INFO ] Invariant cache hit.
[2024-06-02 22:08:17] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 199/271 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 34/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 1/272 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 115 constraints, problems are : Problem set: 0 solved, 209 unsolved in 6826 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 199/271 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 34/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 209/323 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 1/272 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 324 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 17073ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 17076ms
Starting structural reductions in SI_LTL mode, iteration 1 : 72/171 places, 210/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17416 ms. Remains : 72/171 places, 210/353 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-13
Product exploration explored 100000 steps with 9 reset in 142 ms.
Product exploration explored 100000 steps with 5 reset in 155 ms.
Computed a total of 2 stabilizing places and 7 stable transitions
Computed a total of 2 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 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 34 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 93 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-02 22:08:35] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:35] [INFO ] Invariant cache hit.
[2024-06-02 22:08:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:08:35] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 22:08:35] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:08:35] [INFO ] [Real]Added 35 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:08:35] [INFO ] Computed and/alt/rep : 76/402/76 causal constraints (skipped 123 transitions) in 25 ms.
[2024-06-02 22:08:35] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 72 /72 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-02 22:08:35] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:35] [INFO ] Invariant cache hit.
[2024-06-02 22:08:35] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:08:35] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:35] [INFO ] Invariant cache hit.
[2024-06-02 22:08:35] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:08:35] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2024-06-02 22:08:35] [INFO ] Redundant transitions in 1 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 22:08:35] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:35] [INFO ] Invariant cache hit.
[2024-06-02 22:08:35] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 199/271 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 34/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 1/272 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 115 constraints, problems are : Problem set: 0 solved, 209 unsolved in 6769 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 199/271 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 34/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 209/323 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 1/272 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 324 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10353 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 17239ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 17243ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17544 ms. Remains : 72/72 places, 210/210 transitions.
Computed a total of 2 stabilizing places and 7 stable transitions
Computed a total of 2 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 95 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-06-02 22:08:53] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:53] [INFO ] Invariant cache hit.
[2024-06-02 22:08:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:08:53] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-02 22:08:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:08:53] [INFO ] [Real]Added 35 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:08:53] [INFO ] Computed and/alt/rep : 76/402/76 causal constraints (skipped 123 transitions) in 22 ms.
[2024-06-02 22:08:53] [INFO ] Added : 0 causal constraints over 0 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 49 reset in 119 ms.
Product exploration explored 100000 steps with 3 reset in 156 ms.
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 72 /72 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-02 22:08:53] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:53] [INFO ] Invariant cache hit.
[2024-06-02 22:08:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 22:08:53] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:53] [INFO ] Invariant cache hit.
[2024-06-02 22:08:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:08:53] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 22:08:54] [INFO ] Redundant transitions in 1 ms returned []
Running 209 sub problems to find dead transitions.
[2024-06-02 22:08:54] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:08:54] [INFO ] Invariant cache hit.
[2024-06-02 22:08:54] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 199/271 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 34/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 1/272 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 115 constraints, problems are : Problem set: 0 solved, 209 unsolved in 7079 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/72 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 199/271 variables, 72/80 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 34/114 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 209/323 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 1/272 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 324 constraints, problems are : Problem set: 0 solved, 209 unsolved in 10268 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 72/72 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints]
After SMT, in 17462ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 17465ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 17780 ms. Remains : 72/72 places, 210/210 transitions.
Treatment of property MedleyA-PT-23-LTLCardinality-13 finished in 54580 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)))'
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 22:09:11] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:09:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 22:09:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 171 places, 353 transitions and 1228 arcs took 9 ms.
Total runtime 227910 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-23-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-23-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717366321451

--------------------
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
mcc2024
ltl formula name MedleyA-PT-23-LTLCardinality-03
ltl formula formula --ltl=/tmp/1277/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 171 places, 353 transitions and 1228 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1277/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1277/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1277/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1277/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 173 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 172, there are 362 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~61!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 121
pnml2lts-mc( 0/ 4): unique states count: 554
pnml2lts-mc( 0/ 4): unique transitions count: 1979
pnml2lts-mc( 0/ 4): - self-loop count: 35
pnml2lts-mc( 0/ 4): - claim dead count: 121
pnml2lts-mc( 0/ 4): - claim found count: 98
pnml2lts-mc( 0/ 4): - claim success count: 569
pnml2lts-mc( 0/ 4): - cum. max stack depth: 397
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 569 states 2020 transitions, fanout: 3.550
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 28450, Transitions per second: 101000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 16.2 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 356 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-23-LTLCardinality-13
ltl formula formula --ltl=/tmp/1277/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 171 places, 353 transitions and 1228 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1277/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1277/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1277/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1277/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 172 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 172, there are 369 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~1233 levels ~10000 states ~41484 transitions
pnml2lts-mc( 2/ 4): ~2126 levels ~20000 states ~86564 transitions
pnml2lts-mc( 2/ 4): ~4073 levels ~40000 states ~184692 transitions
pnml2lts-mc( 2/ 4): ~8419 levels ~80000 states ~358568 transitions
pnml2lts-mc( 3/ 4): ~15692 levels ~160000 states ~647184 transitions
pnml2lts-mc( 3/ 4): ~37932 levels ~320000 states ~1327488 transitions
pnml2lts-mc( 3/ 4): ~80011 levels ~640000 states ~2585928 transitions
pnml2lts-mc( 3/ 4): ~156698 levels ~1280000 states ~5425864 transitions
pnml2lts-mc( 3/ 4): ~291096 levels ~2560000 states ~11540172 transitions
pnml2lts-mc( 1/ 4): ~551539 levels ~5120000 states ~23605504 transitions
pnml2lts-mc( 2/ 4): ~983344 levels ~10240000 states ~52104888 transitions
pnml2lts-mc( 0/ 4): ~2325270 levels ~20480000 states ~99452340 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1308320
pnml2lts-mc( 0/ 4): unique states count: 23139178
pnml2lts-mc( 0/ 4): unique transitions count: 119123362
pnml2lts-mc( 0/ 4): - self-loop count: 23498
pnml2lts-mc( 0/ 4): - claim dead count: 10122232
pnml2lts-mc( 0/ 4): - claim found count: 62309027
pnml2lts-mc( 0/ 4): - claim success count: 23159309
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9841401
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 23210845 states 119523626 transitions, fanout: 5.149
pnml2lts-mc( 0/ 4): Total exploration time 168.540 sec (168.520 sec minimum, 168.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 137717, Transitions per second: 709171
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 280.6MB, 8.8 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/38.0%
pnml2lts-mc( 0/ 4): Stored 356 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 280.6MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-23, 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 r579-smll-171734921400179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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