Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K 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 39K 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-13-LTLFireability-00
FORMULA_NAME MedleyA-PT-13-LTLFireability-01
FORMULA_NAME MedleyA-PT-13-LTLFireability-02
FORMULA_NAME MedleyA-PT-13-LTLFireability-03
FORMULA_NAME MedleyA-PT-13-LTLFireability-04
FORMULA_NAME MedleyA-PT-13-LTLFireability-05
FORMULA_NAME MedleyA-PT-13-LTLFireability-06
FORMULA_NAME MedleyA-PT-13-LTLFireability-07
FORMULA_NAME MedleyA-PT-13-LTLFireability-08
FORMULA_NAME MedleyA-PT-13-LTLFireability-09
FORMULA_NAME MedleyA-PT-13-LTLFireability-10
FORMULA_NAME MedleyA-PT-13-LTLFireability-11
FORMULA_NAME MedleyA-PT-13-LTLFireability-12
FORMULA_NAME MedleyA-PT-13-LTLFireability-13
FORMULA_NAME MedleyA-PT-13-LTLFireability-14
FORMULA_NAME MedleyA-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717364170922

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:36:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:36:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:36:13] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-02 21:36:13] [INFO ] Transformed 173 places.
[2024-06-02 21:36:13] [INFO ] Transformed 159 transitions.
[2024-06-02 21:36:13] [INFO ] Found NUPN structural information;
[2024-06-02 21:36:13] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 424 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-13-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 157 transition count 148
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 156 transition count 147
Applied a total of 29 rules in 101 ms. Remains 156 /173 variables (removed 17) and now considering 147/159 (removed 12) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-06-02 21:36:14] [INFO ] Computed 16 invariants in 37 ms
[2024-06-02 21:36:14] [INFO ] Implicit Places using invariants in 507 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 571 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/173 places, 147/159 transitions.
Applied a total of 0 rules in 17 ms. Remains 155 /155 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 741 ms. Remains : 155/173 places, 147/159 transitions.
Support contains 31 out of 155 places after structural reductions.
[2024-06-02 21:36:15] [INFO ] Flatten gal took : 77 ms
[2024-06-02 21:36:15] [INFO ] Flatten gal took : 32 ms
[2024-06-02 21:36:15] [INFO ] Input system was already deterministic with 147 transitions.
RANDOM walk for 40000 steps (1142 resets) in 2250 ms. (17 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40003 steps (282 resets) in 326 ms. (122 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (284 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
// Phase 1: matrix 147 rows 155 cols
[2024-06-02 21:36:16] [INFO ] Computed 15 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/101 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 21:36:16] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 155/302 variables, and 16 constraints, problems are : Problem set: 1 solved, 0 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/155 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 299ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA MedleyA-PT-13-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 12 stabilizing places and 12 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' '!(F(G(p0)))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 124 transition count 87
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 118 place count 95 transition count 87
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 86
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 128 place count 86 transition count 79
Iterating global reduction 5 with 7 rules applied. Total rules applied 135 place count 86 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 135 place count 86 transition count 76
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
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 5 with 46 rules applied. Total rules applied 193 place count 57 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 209 place count 49 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 49 transition count 65
Applied a total of 210 rules in 107 ms. Remains 49 /155 variables (removed 106) and now considering 65/147 (removed 82) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-06-02 21:36:17] [INFO ] Computed 13 invariants in 2 ms
[2024-06-02 21:36:17] [INFO ] Implicit Places using invariants in 145 ms returned [0, 9, 11, 18, 24, 27]
[2024-06-02 21:36:17] [INFO ] Actually due to overlaps returned [11, 24, 0, 9, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 149 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/155 places, 65/147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 43 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 37 transition count 58
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 2 with 2 rules applied. Total rules applied 16 place count 36 transition count 57
Applied a total of 16 rules in 28 ms. Remains 36 /44 variables (removed 8) and now considering 57/65 (removed 8) transitions.
// Phase 1: matrix 57 rows 36 cols
[2024-06-02 21:36:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:36:17] [INFO ] Implicit Places using invariants in 96 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/155 places, 57/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 59
Applied a total of 2 rules in 10 ms. Remains 34 /35 variables (removed 1) and now considering 59/57 (removed -2) transitions.
// Phase 1: matrix 59 rows 34 cols
[2024-06-02 21:36:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:36:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 21:36:17] [INFO ] Invariant cache hit.
[2024-06-02 21:36:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:36:17] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 34/155 places, 59/147 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 635 ms. Remains : 34/155 places, 59/147 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-00
Product exploration explored 100000 steps with 21229 reset in 620 ms.
Product exploration explored 100000 steps with 21379 reset in 391 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 52 ms :[(NOT p0)]
RANDOM walk for 6381 steps (1362 resets) in 44 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 149 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 59/59 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-02 21:36:19] [INFO ] Invariant cache hit.
[2024-06-02 21:36:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 21:36:19] [INFO ] Invariant cache hit.
[2024-06-02 21:36:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:36:20] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-06-02 21:36:20] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-02 21:36:20] [INFO ] Invariant cache hit.
[2024-06-02 21:36:20] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 21:36:20] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 59/93 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 46 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1460 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 59/93 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 47/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 93 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints]
After SMT, in 3049ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3053ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3319 ms. Remains : 34/34 places, 59/59 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 185 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 55 ms :[(NOT p0)]
RANDOM walk for 4545 steps (962 resets) in 19 ms. (227 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21356 reset in 247 ms.
Product exploration explored 100000 steps with 21329 reset in 420 ms.
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-02 21:36:24] [INFO ] Invariant cache hit.
[2024-06-02 21:36:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 21:36:24] [INFO ] Invariant cache hit.
[2024-06-02 21:36:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:36:24] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 21:36:24] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-06-02 21:36:24] [INFO ] Invariant cache hit.
[2024-06-02 21:36:24] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 21:36:24] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 59/93 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/93 variables, and 46 constraints, problems are : Problem set: 0 solved, 47 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 59/93 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 47/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/93 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/93 variables, and 93 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1255 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 1/1 constraints]
After SMT, in 2156ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2158ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2316 ms. Remains : 34/34 places, 59/59 transitions.
Treatment of property MedleyA-PT-13-LTLFireability-00 finished in 9552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 146 transition count 138
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 146 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 144 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Applied a total of 28 rules in 27 ms. Remains 141 /155 variables (removed 14) and now considering 133/147 (removed 14) transitions.
// Phase 1: matrix 133 rows 141 cols
[2024-06-02 21:36:26] [INFO ] Computed 15 invariants in 3 ms
[2024-06-02 21:36:26] [INFO ] Implicit Places using invariants in 127 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 130 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/155 places, 133/147 transitions.
Applied a total of 0 rules in 5 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 140/155 places, 133/147 transitions.
Stuttering acceptance computed with spot in 222 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-02 finished in 407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0||F(p1)))||((p0||F(p1))&&F(G(p2)))))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 147 transition count 139
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 147 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 146 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 146 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 145 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 144 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 143 transition count 135
Applied a total of 24 rules in 29 ms. Remains 143 /155 variables (removed 12) and now considering 135/147 (removed 12) transitions.
// Phase 1: matrix 135 rows 143 cols
[2024-06-02 21:36:27] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:36:27] [INFO ] Implicit Places using invariants in 134 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 136 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/155 places, 135/147 transitions.
Applied a total of 0 rules in 7 ms. Remains 142 /142 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 142/155 places, 135/147 transitions.
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-04
Product exploration explored 100000 steps with 2864 reset in 288 ms.
Product exploration explored 100000 steps with 2851 reset in 341 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 234 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (1137 resets) in 522 ms. (76 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (287 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (283 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (281 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (287 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
// Phase 1: matrix 135 rows 142 cols
[2024-06-02 21:36:29] [INFO ] Computed 14 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 55/91 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
Problem apf2 is UNSAT
At refinement iteration 5 (OVERLAPS) 51/142 variables, 5/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 135/277 variables, 142/156 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/156 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 156 constraints, problems are : Problem set: 2 solved, 2 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 55/91 variables, 7/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 51/142 variables, 5/14 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-02 21:36:30] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:36:30] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 142/277 variables, and 16 constraints, problems are : Problem set: 4 solved, 0 unsolved in 216 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/142 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 870ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1 p2)), (G (OR p0 p1 (NOT p2))), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1 p2))), (F (NOT p0)), (F p2), (F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 18 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-13-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-04 finished in 3025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 61 place count 124 transition count 88
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 115 place count 97 transition count 88
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 96 transition count 88
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 123 place count 89 transition count 81
Iterating global reduction 4 with 7 rules applied. Total rules applied 130 place count 89 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 130 place count 89 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 85 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 84 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 83 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 83 transition count 75
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 4 with 46 rules applied. Total rules applied 188 place count 60 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 204 place count 52 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 52 transition count 67
Applied a total of 205 rules in 53 ms. Remains 52 /155 variables (removed 103) and now considering 67/147 (removed 80) transitions.
// Phase 1: matrix 67 rows 52 cols
[2024-06-02 21:36:30] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 21:36:30] [INFO ] Implicit Places using invariants in 100 ms returned [0, 9, 11, 18, 22, 25]
[2024-06-02 21:36:30] [INFO ] Actually due to overlaps returned [11, 22, 0, 9, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 102 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/155 places, 67/147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 46 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 41 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 40 transition count 61
Applied a total of 14 rules in 11 ms. Remains 40 /47 variables (removed 7) and now considering 61/67 (removed 6) transitions.
// Phase 1: matrix 61 rows 40 cols
[2024-06-02 21:36:30] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 21:36:30] [INFO ] Implicit Places using invariants in 75 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/155 places, 61/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 63
Applied a total of 2 rules in 7 ms. Remains 38 /39 variables (removed 1) and now considering 63/61 (removed -2) transitions.
// Phase 1: matrix 63 rows 38 cols
[2024-06-02 21:36:30] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:36:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 21:36:30] [INFO ] Invariant cache hit.
[2024-06-02 21:36:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:30] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 38/155 places, 63/147 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 439 ms. Remains : 38/155 places, 63/147 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-05
Product exploration explored 100000 steps with 20964 reset in 413 ms.
Product exploration explored 100000 steps with 20940 reset in 401 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 930 steps (195 resets) in 9 ms. (93 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 38 /38 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:36:32] [INFO ] Invariant cache hit.
[2024-06-02 21:36:32] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:36:32] [INFO ] Invariant cache hit.
[2024-06-02 21:36:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:32] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 21:36:32] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 21:36:32] [INFO ] Invariant cache hit.
[2024-06-02 21:36:32] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 21:36:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 63/101 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 52 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 63/101 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 51/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 103 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1609 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 3408ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3409ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3583 ms. Remains : 38/38 places, 63/63 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1211 steps (256 resets) in 7 ms. (151 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20905 reset in 230 ms.
Product exploration explored 100000 steps with 20951 reset in 248 ms.
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:36:37] [INFO ] Invariant cache hit.
[2024-06-02 21:36:37] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 21:36:37] [INFO ] Invariant cache hit.
[2024-06-02 21:36:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:37] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-06-02 21:36:37] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 21:36:37] [INFO ] Invariant cache hit.
[2024-06-02 21:36:37] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 21:36:38] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 63/101 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 52 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 63/101 variables, 38/47 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 51/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 103 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 38/38 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 3270ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 3272ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3503 ms. Remains : 38/38 places, 63/63 transitions.
Treatment of property MedleyA-PT-13-LTLFireability-05 finished in 10908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 154 transition count 116
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 124 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 123 transition count 114
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 63 place count 123 transition count 85
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 122 place count 93 transition count 85
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 84
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 131 place count 85 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 85 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 137 place count 85 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 195 place count 56 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 211 place count 48 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 48 transition count 64
Applied a total of 212 rules in 56 ms. Remains 48 /155 variables (removed 107) and now considering 64/147 (removed 83) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-02 21:36:41] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants in 94 ms returned [0, 9, 11, 18, 22, 25]
[2024-06-02 21:36:41] [INFO ] Actually due to overlaps returned [11, 22, 0, 9, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 99 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/155 places, 64/147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 42 transition count 57
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 36 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 35 transition count 57
Applied a total of 16 rules in 12 ms. Remains 35 /43 variables (removed 8) and now considering 57/64 (removed 7) transitions.
// Phase 1: matrix 57 rows 35 cols
[2024-06-02 21:36:41] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants in 63 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/155 places, 57/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 59
Applied a total of 2 rules in 6 ms. Remains 33 /34 variables (removed 1) and now considering 59/57 (removed -2) transitions.
// Phase 1: matrix 59 rows 33 cols
[2024-06-02 21:36:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 21:36:41] [INFO ] Invariant cache hit.
[2024-06-02 21:36:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 33/155 places, 59/147 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 416 ms. Remains : 33/155 places, 59/147 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-07 finished in 485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 154 transition count 116
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 124 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 123 transition count 114
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 63 place count 123 transition count 85
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 122 place count 93 transition count 85
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 84
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 131 place count 85 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 85 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 137 place count 85 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
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 5 with 46 rules applied. Total rules applied 193 place count 57 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 209 place count 49 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 49 transition count 65
Applied a total of 210 rules in 45 ms. Remains 49 /155 variables (removed 106) and now considering 65/147 (removed 82) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-06-02 21:36:41] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants in 100 ms returned [0, 9, 11, 18, 22, 25]
[2024-06-02 21:36:41] [INFO ] Actually due to overlaps returned [11, 22, 0, 9, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 105 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/155 places, 65/147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 43 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 37 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 36 transition count 58
Applied a total of 16 rules in 10 ms. Remains 36 /44 variables (removed 8) and now considering 58/65 (removed 7) transitions.
// Phase 1: matrix 58 rows 36 cols
[2024-06-02 21:36:41] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants in 65 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/155 places, 58/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 34 transition count 60
Applied a total of 2 rules in 7 ms. Remains 34 /35 variables (removed 1) and now considering 60/58 (removed -2) transitions.
// Phase 1: matrix 60 rows 34 cols
[2024-06-02 21:36:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:36:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:36:41] [INFO ] Invariant cache hit.
[2024-06-02 21:36:42] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:42] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 34/155 places, 60/147 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 415 ms. Remains : 34/155 places, 60/147 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 30835 reset in 199 ms.
Product exploration explored 100000 steps with 30787 reset in 226 ms.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/34 stabilizing places and 14/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-06-02 21:36:43] [INFO ] Invariant cache hit.
[2024-06-02 21:36:43] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 21:36:43] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:43] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:36:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:36:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 21:36:43] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:43] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-06-02 21:36:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:43] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-06-02 21:36:43] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 2 ms to minimize.
[2024-06-02 21:36:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-02 21:36:43] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 28 transitions) in 10 ms.
[2024-06-02 21:36:43] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-02 21:36:43] [INFO ] Invariant cache hit.
[2024-06-02 21:36:43] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 21:36:43] [INFO ] Invariant cache hit.
[2024-06-02 21:36:43] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:43] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-06-02 21:36:43] [INFO ] Redundant transitions in 2 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 21:36:43] [INFO ] Invariant cache hit.
[2024-06-02 21:36:43] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 21:36:44] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 60/94 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 47 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 60/94 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 48/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 95 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1359 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
After SMT, in 2638ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2640ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2874 ms. Remains : 34/34 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/34 stabilizing places and 14/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
RANDOM walk for 11 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2024-06-02 21:36:46] [INFO ] Invariant cache hit.
[2024-06-02 21:36:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:46] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:46] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-02 21:36:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:36:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:47] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:36:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 21:36:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-06-02 21:36:47] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 2 ms to minimize.
[2024-06-02 21:36:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-06-02 21:36:47] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 28 transitions) in 7 ms.
[2024-06-02 21:36:47] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30779 reset in 207 ms.
Product exploration explored 100000 steps with 30828 reset in 228 ms.
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-02 21:36:47] [INFO ] Invariant cache hit.
[2024-06-02 21:36:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:36:47] [INFO ] Invariant cache hit.
[2024-06-02 21:36:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:47] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-02 21:36:47] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 21:36:47] [INFO ] Invariant cache hit.
[2024-06-02 21:36:47] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 21:36:48] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 60/94 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 47 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 60/94 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 48/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 95 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
After SMT, in 2425ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2426ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2608 ms. Remains : 34/34 places, 60/60 transitions.
Treatment of property MedleyA-PT-13-LTLFireability-08 finished in 8622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(X(((p1 U p2)&&G(p1)))) U (p0&&X(X(((p1 U p2)&&G(p1))))))))))'
Support contains 1 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 124 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 118 place count 95 transition count 87
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 86
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 127 place count 87 transition count 80
Iterating global reduction 5 with 6 rules applied. Total rules applied 133 place count 87 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 133 place count 87 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 137 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 84 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 83 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 187 place count 60 transition count 53
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 203 place count 52 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 52 transition count 68
Applied a total of 204 rules in 50 ms. Remains 52 /155 variables (removed 103) and now considering 68/147 (removed 79) transitions.
// Phase 1: matrix 68 rows 52 cols
[2024-06-02 21:36:50] [INFO ] Computed 13 invariants in 3 ms
[2024-06-02 21:36:50] [INFO ] Implicit Places using invariants in 125 ms returned [0, 11, 13, 20, 24, 27]
[2024-06-02 21:36:50] [INFO ] Actually due to overlaps returned [13, 24, 0, 11, 27]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 128 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/155 places, 68/147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 67
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 46 transition count 61
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 40 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 16 place count 39 transition count 61
Applied a total of 16 rules in 10 ms. Remains 39 /47 variables (removed 8) and now considering 61/68 (removed 7) transitions.
// Phase 1: matrix 61 rows 39 cols
[2024-06-02 21:36:50] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:36:50] [INFO ] Implicit Places using invariants in 84 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/155 places, 61/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 63
Applied a total of 2 rules in 3 ms. Remains 37 /38 variables (removed 1) and now considering 63/61 (removed -2) transitions.
// Phase 1: matrix 63 rows 37 cols
[2024-06-02 21:36:50] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:36:50] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:36:50] [INFO ] Invariant cache hit.
[2024-06-02 21:36:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:50] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 37/155 places, 63/147 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 456 ms. Remains : 37/155 places, 63/147 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-09
Product exploration explored 100000 steps with 30821 reset in 200 ms.
Product exploration explored 100000 steps with 30786 reset in 225 ms.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/37 stabilizing places and 14/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 10 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-06-02 21:36:51] [INFO ] Invariant cache hit.
[2024-06-02 21:36:51] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-06-02 21:36:51] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:51] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-02 21:36:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:36:52] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:52] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:52] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-06-02 21:36:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:52] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-06-02 21:36:52] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:36:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-06-02 21:36:52] [INFO ] Computed and/alt/rep : 23/66/23 causal constraints (skipped 28 transitions) in 9 ms.
[2024-06-02 21:36:52] [INFO ] Added : 3 causal constraints over 2 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:36:52] [INFO ] Invariant cache hit.
[2024-06-02 21:36:52] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:36:52] [INFO ] Invariant cache hit.
[2024-06-02 21:36:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-02 21:36:52] [INFO ] Redundant transitions in 2 ms returned []
Running 51 sub problems to find dead transitions.
[2024-06-02 21:36:52] [INFO ] Invariant cache hit.
[2024-06-02 21:36:52] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-06-02 21:36:52] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 63/100 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 50 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 63/100 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 51/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 101 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 37/37 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 2771ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2772ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2960 ms. Remains : 37/37 places, 63/63 transitions.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/37 stabilizing places and 14/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2024-06-02 21:36:55] [INFO ] Invariant cache hit.
[2024-06-02 21:36:55] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:55] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:55] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-02 21:36:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:36:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:36:55] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:36:55] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 21:36:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:55] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-06-02 21:36:55] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:36:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-02 21:36:55] [INFO ] Computed and/alt/rep : 23/66/23 causal constraints (skipped 28 transitions) in 9 ms.
[2024-06-02 21:36:56] [INFO ] Added : 3 causal constraints over 2 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30743 reset in 199 ms.
Product exploration explored 100000 steps with 30741 reset in 218 ms.
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 63/63 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 37 transition count 61
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 35 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 34 transition count 60
Applied a total of 6 rules in 5 ms. Remains 34 /37 variables (removed 3) and now considering 60/63 (removed 3) transitions.
// Phase 1: matrix 60 rows 34 cols
[2024-06-02 21:36:56] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:36:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:36:56] [INFO ] Invariant cache hit.
[2024-06-02 21:36:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:36:56] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 21:36:56] [INFO ] Redundant transitions in 2 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-02 21:36:56] [INFO ] Invariant cache hit.
[2024-06-02 21:36:56] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-02 21:36:57] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 60/94 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 0/94 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 47 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1253 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 60/94 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 48/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/94 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 95 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1431 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
After SMT, in 2709ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2710ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/37 places, 60/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2943 ms. Remains : 34/37 places, 60/63 transitions.
Treatment of property MedleyA-PT-13-LTLFireability-09 finished in 9197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 143 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Applied a total of 30 rules in 16 ms. Remains 140 /155 variables (removed 15) and now considering 132/147 (removed 15) transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-06-02 21:36:59] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:36:59] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-06-02 21:36:59] [INFO ] Invariant cache hit.
[2024-06-02 21:36:59] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:36:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:37:02] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:37:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
[2024-06-02 21:37:02] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/272 variables, 140/158 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:37:05] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/272 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 159 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9800 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/272 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 131/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:37:12] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 3 ms to minimize.
[2024-06-02 21:37:13] [INFO ] Deduced a trap composed of 55 places in 78 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:37:15] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-06-02 21:37:15] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:37:18] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:37:20] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 0/272 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 16062 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints]
After SMT, in 25888ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 25891ms
Starting structural reductions in LTL mode, iteration 1 : 140/155 places, 132/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26293 ms. Remains : 140/155 places, 132/147 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-11
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-11 finished in 26443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 148 transition count 140
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 148 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 147 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 147 transition count 139
Applied a total of 16 rules in 7 ms. Remains 147 /155 variables (removed 8) and now considering 139/147 (removed 8) transitions.
// Phase 1: matrix 139 rows 147 cols
[2024-06-02 21:37:25] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:37:26] [INFO ] Implicit Places using invariants in 120 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/155 places, 139/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 146/155 places, 139/147 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X p0), (X p1), (X (NOT (AND (NOT p0) p1 p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 15 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-13-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-12 finished in 553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1&&F(p2)))))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 143 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Applied a total of 30 rules in 11 ms. Remains 140 /155 variables (removed 15) and now considering 132/147 (removed 15) transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-06-02 21:37:26] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:37:26] [INFO ] Implicit Places using invariants in 73 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/155 places, 132/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 139/155 places, 132/147 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-14
Product exploration explored 100000 steps with 2903 reset in 259 ms.
Product exploration explored 100000 steps with 2876 reset in 159 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (1119 resets) in 111 ms. (357 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40002 steps (284 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
// Phase 1: matrix 132 rows 139 cols
[2024-06-02 21:37:27] [INFO ] Computed 14 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/88 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/139 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 33/271 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/9 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 287 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 138 transition count 102
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 109 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 108 transition count 100
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 61 place count 108 transition count 73
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 116 place count 80 transition count 73
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 118 place count 79 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 119 place count 78 transition count 72
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 5 with 46 rules applied. Total rules applied 165 place count 55 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 181 place count 47 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 182 place count 47 transition count 64
Applied a total of 182 rules in 20 ms. Remains 47 /139 variables (removed 92) and now considering 64/132 (removed 68) transitions.
// Phase 1: matrix 64 rows 47 cols
[2024-06-02 21:37:28] [INFO ] Computed 12 invariants in 0 ms
[2024-06-02 21:37:28] [INFO ] Implicit Places using invariants in 110 ms returned [0, 10, 17, 21, 24]
[2024-06-02 21:37:28] [INFO ] Actually due to overlaps returned [10, 21, 0, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/139 places, 64/132 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 43 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 38 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 37 transition count 59
Applied a total of 12 rules in 5 ms. Remains 37 /43 variables (removed 6) and now considering 59/64 (removed 5) transitions.
// Phase 1: matrix 59 rows 37 cols
[2024-06-02 21:37:28] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:37:28] [INFO ] Implicit Places using invariants in 82 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/139 places, 59/132 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 61
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 61/59 (removed -2) transitions.
// Phase 1: matrix 61 rows 35 cols
[2024-06-02 21:37:28] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:37:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:37:28] [INFO ] Invariant cache hit.
[2024-06-02 21:37:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:37:28] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/139 places, 61/132 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 372 ms. Remains : 35/139 places, 61/132 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 202 steps (38 resets) in 6 ms. (28 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2), (X p2)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F p0), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 2 factoid took 262 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 18953 reset in 229 ms.
Product exploration explored 100000 steps with 18960 reset in 215 ms.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 61/61 transitions.
Applied a total of 0 rules in 14 ms. Remains 35 /35 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-02 21:37:29] [INFO ] Invariant cache hit.
[2024-06-02 21:37:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 21:37:29] [INFO ] Invariant cache hit.
[2024-06-02 21:37:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:37:30] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-02 21:37:30] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 21:37:30] [INFO ] Invariant cache hit.
[2024-06-02 21:37:30] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 21:37:30] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 61/96 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 61/96 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 49/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
After SMT, in 2393ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2395ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2546 ms. Remains : 35/35 places, 61/61 transitions.
Treatment of property MedleyA-PT-13-LTLFireability-14 finished in 5970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(F(G(p1)) U p2))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 143 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Applied a total of 30 rules in 9 ms. Remains 140 /155 variables (removed 15) and now considering 132/147 (removed 15) transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-06-02 21:37:32] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:37:32] [INFO ] Implicit Places using invariants in 83 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/155 places, 132/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 139/155 places, 132/147 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-15 finished in 307 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(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((p0||X((X(X(((p1 U p2)&&G(p1)))) U (p0&&X(X(((p1 U p2)&&G(p1))))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1&&F(p2)))))))'
Found a Lengthening insensitive property : MedleyA-PT-13-LTLFireability-14
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 124 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 118 place count 95 transition count 87
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 86
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 128 place count 86 transition count 79
Iterating global reduction 5 with 7 rules applied. Total rules applied 135 place count 86 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 135 place count 86 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
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 5 with 46 rules applied. Total rules applied 193 place count 57 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 209 place count 49 transition count 66
Applied a total of 209 rules in 21 ms. Remains 49 /155 variables (removed 106) and now considering 66/147 (removed 81) transitions.
// Phase 1: matrix 66 rows 49 cols
[2024-06-02 21:37:33] [INFO ] Computed 13 invariants in 0 ms
[2024-06-02 21:37:33] [INFO ] Implicit Places using invariants in 129 ms returned [0, 9, 11, 18, 22, 25]
[2024-06-02 21:37:33] [INFO ] Actually due to overlaps returned [11, 22, 0, 9, 25]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 131 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 44/155 places, 66/147 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 44 transition count 60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 38 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 37 transition count 60
Applied a total of 14 rules in 5 ms. Remains 37 /44 variables (removed 7) and now considering 60/66 (removed 6) transitions.
// Phase 1: matrix 60 rows 37 cols
[2024-06-02 21:37:33] [INFO ] Computed 8 invariants in 0 ms
[2024-06-02 21:37:33] [INFO ] Implicit Places using invariants in 79 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 36/155 places, 60/147 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 62
Applied a total of 2 rules in 8 ms. Remains 35 /36 variables (removed 1) and now considering 62/60 (removed -2) transitions.
// Phase 1: matrix 62 rows 35 cols
[2024-06-02 21:37:34] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:37:34] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:37:34] [INFO ] Invariant cache hit.
[2024-06-02 21:37:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:37:34] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 35/155 places, 62/147 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 428 ms. Remains : 35/155 places, 62/147 transitions.
Running random walk in product with property : MedleyA-PT-13-LTLFireability-14
Product exploration explored 100000 steps with 18801 reset in 206 ms.
Product exploration explored 100000 steps with 18883 reset in 162 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (7345 resets) in 115 ms. (344 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (1294 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
[2024-06-02 21:37:35] [INFO ] Invariant cache hit.
[2024-06-02 21:37:35] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/19 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 16/35 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/97 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 48 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 6/97 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/5 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/35 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 541 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-06-02 21:37:36] [INFO ] Invariant cache hit.
[2024-06-02 21:37:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:37:36] [INFO ] Invariant cache hit.
[2024-06-02 21:37:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:37:36] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-02 21:37:36] [INFO ] Invariant cache hit.
[2024-06-02 21:37:36] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 21:37:36] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 49 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 50/99 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 99 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 1/1 constraints]
After SMT, in 2880ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2882ms
Finished structural reductions in LTL mode , in 1 iterations and 3091 ms. Remains : 35/35 places, 62/62 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 299 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 173 steps (32 resets) in 6 ms. (24 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p2)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F p0), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 371 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 18853 reset in 224 ms.
Product exploration explored 100000 steps with 18833 reset in 243 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 62/62 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 61
Applied a total of 1 rules in 6 ms. Remains 35 /35 variables (removed 0) and now considering 61/62 (removed 1) transitions.
[2024-06-02 21:37:41] [INFO ] Redundant transitions in 2 ms returned []
Running 49 sub problems to find dead transitions.
// Phase 1: matrix 61 rows 35 cols
[2024-06-02 21:37:41] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:37:41] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 21:37:42] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 61/96 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1350 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 61/96 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 49/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1297 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
After SMT, in 2675ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/35 places, 61/62 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2694 ms. Remains : 35/35 places, 61/62 transitions.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 35/35 places, 62/62 transitions.
Applied a total of 0 rules in 0 ms. Remains 35 /35 variables (removed 0) and now considering 62/62 (removed 0) transitions.
// Phase 1: matrix 62 rows 35 cols
[2024-06-02 21:37:44] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:37:44] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:37:44] [INFO ] Invariant cache hit.
[2024-06-02 21:37:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:37:44] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-06-02 21:37:44] [INFO ] Invariant cache hit.
[2024-06-02 21:37:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-06-02 21:37:45] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 49 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 50/99 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 99 constraints, problems are : Problem set: 0 solved, 50 unsolved in 1409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 1/1 constraints]
After SMT, in 2819ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 2820ms
Finished structural reductions in LTL mode , in 1 iterations and 3024 ms. Remains : 35/35 places, 62/62 transitions.
Treatment of property MedleyA-PT-13-LTLFireability-14 finished in 14285 ms.
[2024-06-02 21:37:47] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:37:47] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2024-06-02 21:37:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 155 places, 147 transitions and 364 arcs took 11 ms.
Total runtime 94338 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-13

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1915
MODEL NAME: /home/mcc/execution/414/model
155 places, 147 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-13-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-13-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-13-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-13-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-13-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717364278513

--------------------
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 LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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