Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K 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 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 33K 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-06-LTLFireability-00
FORMULA_NAME MedleyA-PT-06-LTLFireability-01
FORMULA_NAME MedleyA-PT-06-LTLFireability-02
FORMULA_NAME MedleyA-PT-06-LTLFireability-03
FORMULA_NAME MedleyA-PT-06-LTLFireability-04
FORMULA_NAME MedleyA-PT-06-LTLFireability-05
FORMULA_NAME MedleyA-PT-06-LTLFireability-06
FORMULA_NAME MedleyA-PT-06-LTLFireability-07
FORMULA_NAME MedleyA-PT-06-LTLFireability-08
FORMULA_NAME MedleyA-PT-06-LTLFireability-09
FORMULA_NAME MedleyA-PT-06-LTLFireability-10
FORMULA_NAME MedleyA-PT-06-LTLFireability-11
FORMULA_NAME MedleyA-PT-06-LTLFireability-12
FORMULA_NAME MedleyA-PT-06-LTLFireability-13
FORMULA_NAME MedleyA-PT-06-LTLFireability-14
FORMULA_NAME MedleyA-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717353175607

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:32:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:32:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:32:58] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-06-02 18:32:58] [INFO ] Transformed 124 places.
[2024-06-02 18:32:58] [INFO ] Transformed 118 transitions.
[2024-06-02 18:32:58] [INFO ] Found NUPN structural information;
[2024-06-02 18:32:58] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 118
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 110 transition count 108
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 57 ms. Remains 110 /124 variables (removed 14) and now considering 108/118 (removed 10) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-06-02 18:32:59] [INFO ] Computed 20 invariants in 31 ms
[2024-06-02 18:32:59] [INFO ] Implicit Places using invariants in 462 ms returned [24, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 536 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/124 places, 108/118 transitions.
Applied a total of 0 rules in 8 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 638 ms. Remains : 108/124 places, 108/118 transitions.
Support contains 33 out of 108 places after structural reductions.
[2024-06-02 18:32:59] [INFO ] Flatten gal took : 82 ms
[2024-06-02 18:33:00] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:33:00] [INFO ] Input system was already deterministic with 108 transitions.
Support contains 30 out of 108 places (down from 33) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 25
RANDOM walk for 40000 steps (1097 resets) in 2397 ms. (16 steps per ms) remains 4/25 properties
BEST_FIRST walk for 40002 steps (329 resets) in 403 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (304 resets) in 266 ms. (149 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (310 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (330 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
// Phase 1: matrix 108 rows 108 cols
[2024-06-02 18:33:01] [INFO ] Computed 18 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 75/84 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 18:33:01] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 16 ms to minimize.
[2024-06-02 18:33:01] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 4 ms to minimize.
[2024-06-02 18:33:01] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 4 (OVERLAPS) 24/108 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 18:33:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:33:02] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 3 ms to minimize.
[2024-06-02 18:33:02] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 108/216 variables, 108/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 132 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/37 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 45/82 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 3/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 26/108 variables, 7/21 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 108/216 variables, 108/132 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 3/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/135 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 18:33:03] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/216 variables, 1/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/216 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 136 constraints, problems are : Problem set: 1 solved, 3 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 7/7 constraints]
After SMT, in 1942ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 966 ms.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 107 transition count 101
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 100 transition count 94
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 93 transition count 94
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 86 transition count 87
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 86 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 3 rules applied. Total rules applied 46 place count 85 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 84 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 47 place count 84 transition count 84
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 83 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 82 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 82 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 81 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 81 transition count 82
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 95 place count 60 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 103 place count 56 transition count 62
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 56 transition count 56
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 115 place count 50 transition count 56
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 50 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 121 place count 47 transition count 53
Applied a total of 121 rules in 57 ms. Remains 47 /108 variables (removed 61) and now considering 53/108 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 47/108 places, 53/108 transitions.
RANDOM walk for 19146 steps (1538 resets) in 258 ms. (73 steps per ms) remains 0/3 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 11 stabilizing places and 11 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' '!(X(G((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 100 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 98 transition count 99
Applied a total of 19 rules in 30 ms. Remains 98 /108 variables (removed 10) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 98 cols
[2024-06-02 18:33:04] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 18:33:05] [INFO ] Implicit Places using invariants in 124 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 127 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 99/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 160 ms. Remains : 97/108 places, 99/108 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, p0, p0]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-00
Entered a terminal (fully accepting) state of product in 90976 steps with 2539 reset in 512 ms.
FORMULA MedleyA-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-00 finished in 1094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 92 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 81 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 81 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 79 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 79 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 75 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 75 transition count 65
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 109 place count 52 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 48 transition count 45
Applied a total of 117 rules in 40 ms. Remains 48 /108 variables (removed 60) and now considering 45/108 (removed 63) transitions.
// Phase 1: matrix 45 rows 48 cols
[2024-06-02 18:33:06] [INFO ] Computed 16 invariants in 12 ms
[2024-06-02 18:33:06] [INFO ] Implicit Places using invariants in 98 ms returned [16, 23, 25, 27, 31, 41]
[2024-06-02 18:33:06] [INFO ] Actually due to overlaps returned [41, 16, 27, 31]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/108 places, 45/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 44 transition count 44
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 43 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 41 transition count 42
Applied a total of 6 rules in 7 ms. Remains 41 /44 variables (removed 3) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 41 cols
[2024-06-02 18:33:06] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 18:33:06] [INFO ] Implicit Places using invariants in 83 ms returned [22, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/108 places, 42/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 39 transition count 41
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 41
Applied a total of 2 rules in 6 ms. Remains 38 /39 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 38 cols
[2024-06-02 18:33:06] [INFO ] Computed 10 invariants in 0 ms
[2024-06-02 18:33:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 18:33:06] [INFO ] Invariant cache hit.
[2024-06-02 18:33:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:33:06] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 38/108 places, 41/108 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 490 ms. Remains : 38/108 places, 41/108 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-01 finished in 687 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(G((p0 U p1)))||F(!p0))) U X(p1)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 9 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 18:33:06] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 18:33:06] [INFO ] Implicit Places using invariants in 102 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 85/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 94/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-02
Product exploration explored 100000 steps with 2795 reset in 322 ms.
Product exploration explored 100000 steps with 2792 reset in 467 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 p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
RANDOM walk for 24247 steps (671 resets) in 94 ms. (255 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 269 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
// Phase 1: matrix 85 rows 94 cols
[2024-06-02 18:33:09] [INFO ] Computed 16 invariants in 6 ms
[2024-06-02 18:33:09] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-02 18:33:09] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 9 ms returned sat
[2024-06-02 18:33:09] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-06-02 18:33:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:33:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 18:33:09] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 18:33:09] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-02 18:33:09] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 3 ms to minimize.
[2024-06-02 18:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-02 18:33:09] [INFO ] Computed and/alt/rep : 84/156/84 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-02 18:33:09] [INFO ] Added : 65 causal constraints over 13 iterations in 268 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 93 transition count 77
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 86 transition count 76
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 86 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 75 transition count 65
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 74 transition count 65
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 3 with 44 rules applied. Total rules applied 82 place count 52 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 47 transition count 52
Applied a total of 92 rules in 20 ms. Remains 47 /94 variables (removed 47) and now considering 52/85 (removed 33) transitions.
// Phase 1: matrix 52 rows 47 cols
[2024-06-02 18:33:09] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 18:33:10] [INFO ] Implicit Places using invariants in 95 ms returned [14, 22, 26, 30, 40]
[2024-06-02 18:33:10] [INFO ] Actually due to overlaps returned [40, 14, 26, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/94 places, 52/85 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 43 transition count 50
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 41 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 39 transition count 48
Applied a total of 8 rules in 9 ms. Remains 39 /43 variables (removed 4) and now considering 48/52 (removed 4) transitions.
// Phase 1: matrix 48 rows 39 cols
[2024-06-02 18:33:10] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 18:33:10] [INFO ] Implicit Places using invariants in 72 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/94 places, 48/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 206 ms. Remains : 38/94 places, 48/85 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
RANDOM walk for 2029 steps (202 resets) in 10 ms. (184 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 524 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 300 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 266 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
// Phase 1: matrix 48 rows 38 cols
[2024-06-02 18:33:11] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:33:12] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:33:12] [INFO ] [Real]Absence check using 8 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:33:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-02 18:33:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:33:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-06-02 18:33:12] [INFO ] [Nat]Absence check using 8 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 18:33:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-02 18:33:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 18:33:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-02 18:33:12] [INFO ] Computed and/alt/rep : 19/60/19 causal constraints (skipped 21 transitions) in 11 ms.
[2024-06-02 18:33:12] [INFO ] Added : 17 causal constraints over 5 iterations in 66 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 414 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 897 steps with 85 reset in 3 ms.
FORMULA MedleyA-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-02 finished in 6025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 100 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 98 transition count 99
Applied a total of 19 rules in 11 ms. Remains 98 /108 variables (removed 10) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 98 cols
[2024-06-02 18:33:12] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 18:33:12] [INFO ] Implicit Places using invariants in 110 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 99/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 97/108 places, 99/108 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-03
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-03 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 13 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 18:33:13] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 18:33:13] [INFO ] Implicit Places using invariants in 132 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 134 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 85/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 94/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-05
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-05 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(p1)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 12 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 18:33:13] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 18:33:13] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 18:33:13] [INFO ] Invariant cache hit.
[2024-06-02 18:33:13] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:33:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:14] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:16] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 85/180 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 118 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4636 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/180 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 84/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:20] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints]
After SMT, in 9339ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 9343ms
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 85/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9645 ms. Remains : 95/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-06
Product exploration explored 100000 steps with 7313 reset in 335 ms.
Product exploration explored 100000 steps with 7385 reset in 564 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/95 stabilizing places and 10/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1093 resets) in 60 ms. (655 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (241 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
[2024-06-02 18:33:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 14/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/73 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/95 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 85/180 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/180 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 56/73 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:33:24] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/95 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:33:25] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/180 variables, 95/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/180 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/180 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 85/85 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 78
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 88 transition count 77
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 15 place count 88 transition count 69
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 80 transition count 69
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 79 transition count 69
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 3 with 44 rules applied. Total rules applied 76 place count 57 transition count 47
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 88 place count 51 transition count 56
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 51 transition count 52
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 47 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 47 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 102 place count 44 transition count 49
Applied a total of 102 rules in 29 ms. Remains 44 /95 variables (removed 51) and now considering 49/85 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 44/95 places, 49/85 transitions.
RANDOM walk for 442 steps (29 resets) in 5 ms. (73 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 472 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 171 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
[2024-06-02 18:33:26] [INFO ] Invariant cache hit.
[2024-06-02 18:33:26] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-02 18:33:26] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-02 18:33:26] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-02 18:33:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:33:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-02 18:33:26] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-02 18:33:26] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-06-02 18:33:26] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-02 18:33:26] [INFO ] Computed and/alt/rep : 84/157/84 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-02 18:33:26] [INFO ] Added : 78 causal constraints over 16 iterations in 277 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-02 18:33:26] [INFO ] Invariant cache hit.
[2024-06-02 18:33:26] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 18:33:26] [INFO ] Invariant cache hit.
[2024-06-02 18:33:27] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:33:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:28] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:33:28] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:33:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:33:28] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:29] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:29] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 85/180 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 118 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/180 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 84/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:33] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 4110 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints]
After SMT, in 8985ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8988ms
Finished structural reductions in LTL mode , in 1 iterations and 9288 ms. Remains : 95/95 places, 85/85 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/95 stabilizing places and 10/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 143 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 117 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (1106 resets) in 108 ms. (366 steps per ms) remains 1/3 properties
BEST_FIRST walk for 36483 steps (217 resets) in 34 ms. (1042 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 398 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 175 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
[2024-06-02 18:33:37] [INFO ] Invariant cache hit.
[2024-06-02 18:33:37] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-02 18:33:37] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-02 18:33:37] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-06-02 18:33:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:33:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-02 18:33:37] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-02 18:33:37] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-02 18:33:37] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:33:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 18:33:37] [INFO ] Computed and/alt/rep : 84/157/84 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-02 18:33:37] [INFO ] Added : 78 causal constraints over 16 iterations in 279 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7400 reset in 208 ms.
Product exploration explored 100000 steps with 7368 reset in 230 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 95 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 95 transition count 88
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 95 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 86
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 41 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 92 transition count 85
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 92 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 92 transition count 120
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 48 rules in 39 ms. Remains 92 /95 variables (removed 3) and now considering 120/85 (removed -35) transitions.
[2024-06-02 18:33:39] [INFO ] Redundant transitions in 4 ms returned []
Running 116 sub problems to find dead transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-06-02 18:33:39] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 18:33:39] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-06-02 18:33:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:33:40] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-06-02 18:33:40] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 2 ms to minimize.
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
[2024-06-02 18:33:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 17/34 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/34 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 120/212 variables, 92/126 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 8/134 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/134 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/134 constraints. Problems are: Problem set: 69 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 134 constraints, problems are : Problem set: 69 solved, 47 unsolved in 4422 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 69 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 32/85 variables, 11/11 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 17/28 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 7/92 variables, 6/34 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/34 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 120/212 variables, 92/126 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 8/134 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 47/181 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/181 constraints. Problems are: Problem set: 69 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/212 variables, 0/181 constraints. Problems are: Problem set: 69 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 181 constraints, problems are : Problem set: 69 solved, 47 unsolved in 2645 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 47/116 constraints, Known Traps: 17/17 constraints]
After SMT, in 7155ms problems are : Problem set: 69 solved, 47 unsolved
Search for dead transitions found 69 dead transitions in 7160ms
Found 69 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 69 transitions
Dead transitions reduction (with SMT) removed 69 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/95 places, 51/85 transitions.
Graph (complete) has 154 edges and 92 vertex of which 54 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 places :
Also discarding 0 output transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 53 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 53 transition count 59
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 4 rules in 15 ms. Remains 53 /92 variables (removed 39) and now considering 59/51 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/95 places, 59/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7228 ms. Remains : 53/95 places, 59/85 transitions.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 18:33:46] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:47] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:48] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 85/180 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 118 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/180 variables, 95/118 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 84/202 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:33:53] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 0/180 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 203 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 7/7 constraints]
After SMT, in 10082ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 10085ms
Finished structural reductions in LTL mode , in 1 iterations and 10398 ms. Remains : 95/95 places, 85/85 transitions.
Treatment of property MedleyA-PT-06-LTLFireability-06 finished in 43414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 92 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 81 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 81 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 79 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 79 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 75 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 75 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 105 place count 54 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 117 place count 48 transition count 53
Applied a total of 117 rules in 23 ms. Remains 48 /108 variables (removed 60) and now considering 53/108 (removed 55) transitions.
// Phase 1: matrix 53 rows 48 cols
[2024-06-02 18:33:56] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 18:33:56] [INFO ] Implicit Places using invariants in 105 ms returned [15, 22, 24, 26, 29]
[2024-06-02 18:33:56] [INFO ] Actually due to overlaps returned [26, 15, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/108 places, 53/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 133 ms. Remains : 45/108 places, 53/108 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-07
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-07 finished in 200 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(((X(p0) U G(p1))&&(p1 U p2))))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 101 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 100 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Applied a total of 17 rules in 7 ms. Remains 99 /108 variables (removed 9) and now considering 100/108 (removed 8) transitions.
// Phase 1: matrix 100 rows 99 cols
[2024-06-02 18:33:57] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 18:33:57] [INFO ] Implicit Places using invariants in 112 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 100/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 98/108 places, 100/108 transitions.
Stuttering acceptance computed with spot in 491 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-08 finished in 642 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)&&G(F(((!p2&&X(G((G(p4)||p3))))||p1)))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 92 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 85 transition count 86
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 85 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 3 rules applied. Total rules applied 46 place count 84 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 83 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 47 place count 83 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 82 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 81 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 81 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 80 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 80 transition count 81
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 93 place count 60 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 99 place count 57 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 57 transition count 61
Applied a total of 100 rules in 15 ms. Remains 57 /108 variables (removed 51) and now considering 61/108 (removed 47) transitions.
// Phase 1: matrix 61 rows 57 cols
[2024-06-02 18:33:57] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:33:57] [INFO ] Implicit Places using invariants in 102 ms returned [23, 32, 35, 37, 40, 50]
[2024-06-02 18:33:57] [INFO ] Actually due to overlaps returned [37, 50, 23, 40]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 103 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/108 places, 61/108 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 53 transition count 59
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 51 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 57
Applied a total of 8 rules in 3 ms. Remains 49 /53 variables (removed 4) and now considering 57/61 (removed 4) transitions.
// Phase 1: matrix 57 rows 49 cols
[2024-06-02 18:33:57] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 18:33:57] [INFO ] Implicit Places using invariants in 76 ms returned [31, 33]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/108 places, 57/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 56
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 46 transition count 56
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 4 place count 45 transition count 55
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 6 place count 44 transition count 55
Applied a total of 6 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 55/57 (removed 2) transitions.
// Phase 1: matrix 55 rows 44 cols
[2024-06-02 18:33:57] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:33:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 18:33:57] [INFO ] Invariant cache hit.
[2024-06-02 18:33:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 18:33:58] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 44/108 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 363 ms. Remains : 44/108 places, 55/108 transitions.
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (NOT p0), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4)))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-09
Stuttering criterion allowed to conclude after 30 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-09 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||X(G(p2))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 101 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 100 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Applied a total of 17 rules in 5 ms. Remains 99 /108 variables (removed 9) and now considering 100/108 (removed 8) transitions.
// Phase 1: matrix 100 rows 99 cols
[2024-06-02 18:33:58] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 18:33:58] [INFO ] Implicit Places using invariants in 137 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 139 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 100/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 98/108 places, 100/108 transitions.
Stuttering acceptance computed with spot in 536 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 166 steps with 4 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-10 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 92 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 81 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 81 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 79 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 79 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 75 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 75 transition count 65
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 109 place count 52 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 47 transition count 50
Applied a total of 119 rules in 16 ms. Remains 47 /108 variables (removed 61) and now considering 50/108 (removed 58) transitions.
// Phase 1: matrix 50 rows 47 cols
[2024-06-02 18:33:59] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:33:59] [INFO ] Implicit Places using invariants in 90 ms returned [15, 23, 25, 27, 30, 40]
[2024-06-02 18:33:59] [INFO ] Actually due to overlaps returned [27, 40, 15, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/108 places, 50/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 43 transition count 49
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 42 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 40 transition count 47
Applied a total of 6 rules in 4 ms. Remains 40 /43 variables (removed 3) and now considering 47/50 (removed 3) transitions.
// Phase 1: matrix 47 rows 40 cols
[2024-06-02 18:33:59] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 18:33:59] [INFO ] Implicit Places using invariants in 68 ms returned [22, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 71 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/108 places, 47/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 38 transition count 46
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 46
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 4 place count 36 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 35 transition count 51
Applied a total of 6 rules in 5 ms. Remains 35 /38 variables (removed 3) and now considering 51/47 (removed -4) transitions.
// Phase 1: matrix 51 rows 35 cols
[2024-06-02 18:33:59] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 18:33:59] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 18:33:59] [INFO ] Invariant cache hit.
[2024-06-02 18:33:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:33:59] [INFO ] Implicit Places using invariants and state equation in 112 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 : 35/108 places, 51/108 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 368 ms. Remains : 35/108 places, 51/108 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 10192 reset in 227 ms.
Stack based approach found an accepted trace after 86698 steps with 8834 reset with depth 17 and stack size 17 in 214 ms.
FORMULA MedleyA-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-06-LTLFireability-11 finished in 880 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 92 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 39 place count 82 transition count 72
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 82 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 2 with 3 rules applied. Total rules applied 52 place count 81 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 80 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 53 place count 80 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 78 transition count 68
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 103 place count 55 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 115 place count 49 transition count 54
Applied a total of 115 rules in 22 ms. Remains 49 /108 variables (removed 59) and now considering 54/108 (removed 54) transitions.
// Phase 1: matrix 54 rows 49 cols
[2024-06-02 18:34:00] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants in 101 ms returned [25, 27, 29, 32, 42]
[2024-06-02 18:34:00] [INFO ] Actually due to overlaps returned [29, 42, 32]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/108 places, 54/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 46 transition count 53
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 45 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 43 transition count 51
Applied a total of 6 rules in 6 ms. Remains 43 /46 variables (removed 3) and now considering 51/54 (removed 3) transitions.
// Phase 1: matrix 51 rows 43 cols
[2024-06-02 18:34:00] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants in 84 ms returned [25, 27]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/108 places, 51/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 41 transition count 50
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 40 transition count 50
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 4 place count 39 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
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 38 transition count 55
Applied a total of 6 rules in 8 ms. Remains 38 /41 variables (removed 3) and now considering 55/51 (removed -4) transitions.
// Phase 1: matrix 55 rows 38 cols
[2024-06-02 18:34:00] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 18:34:00] [INFO ] Invariant cache hit.
[2024-06-02 18:34:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 38/108 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 428 ms. Remains : 38/108 places, 55/108 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-13 finished in 502 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(p0)))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 100 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 98 transition count 99
Applied a total of 19 rules in 7 ms. Remains 98 /108 variables (removed 10) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 98 cols
[2024-06-02 18:34:00] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 18:34:00] [INFO ] Implicit Places using invariants in 123 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 99/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 97/108 places, 99/108 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 100 ms.
Product exploration explored 100000 steps with 33333 reset in 105 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-06-LTLFireability-14 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p0)||X((!p1&&F(!p2)))))))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 3 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 18:34:01] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 18:34:01] [INFO ] Implicit Places using invariants in 143 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 85/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 94/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, p2, (OR p1 p2), (NOT p0), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND p2 (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 105 ms.
Product exploration explored 100000 steps with 25000 reset in 120 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 p2) (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 362 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 22168 steps (612 resets) in 53 ms. (410 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 3 factoid took 494 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 480 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 94 cols
[2024-06-02 18:34:03] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:34:03] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 18:34:03] [INFO ] Invariant cache hit.
[2024-06-02 18:34:04] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:34:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:34:05] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:34:05] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:34:05] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:34:05] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/179 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 114 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3492 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/179 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 84/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 198 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3239 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 6749ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 6752ms
Finished structural reductions in LTL mode , in 1 iterations and 7031 ms. Remains : 94/94 places, 85/85 transitions.
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 p2) (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 30945 steps (847 resets) in 64 ms. (476 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p1 (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 1 factoid took 426 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 381 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 395 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 318 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Product exploration explored 100000 steps with 25000 reset in 91 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 392 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 94 transition count 85
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 7 place count 94 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 15 place count 94 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 93 transition count 88
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 93 transition count 88
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 39 place count 93 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 92 transition count 87
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 92 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 92 transition count 116
Deduced a syphon composed of 39 places in 1 ms
Applied a total of 45 rules in 13 ms. Remains 92 /94 variables (removed 2) and now considering 116/85 (removed -31) transitions.
[2024-06-02 18:34:13] [INFO ] Redundant transitions in 18 ms returned []
Running 112 sub problems to find dead transitions.
// Phase 1: matrix 116 rows 92 cols
[2024-06-02 18:34:13] [INFO ] Computed 16 invariants in 2 ms
[2024-06-02 18:34:13] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 2 ms to minimize.
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 14 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-02 18:34:15] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
[2024-06-02 18:34:16] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-02 18:34:16] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-06-02 18:34:16] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-02 18:34:16] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 2 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-06-02 18:34:16] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 14/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 116/208 variables, 92/122 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 7/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 0/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/208 variables, 0/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 129 constraints, problems are : Problem set: 66 solved, 46 unsolved in 4309 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 66 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 32/84 variables, 11/11 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/12 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 14/26 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/26 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 8/92 variables, 4/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/30 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 116/208 variables, 92/122 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/208 variables, 7/129 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 46/175 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/175 constraints. Problems are: Problem set: 66 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/175 constraints. Problems are: Problem set: 66 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 175 constraints, problems are : Problem set: 66 solved, 46 unsolved in 2297 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 46/112 constraints, Known Traps: 14/14 constraints]
After SMT, in 6660ms problems are : Problem set: 66 solved, 46 unsolved
Search for dead transitions found 66 dead transitions in 6663ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 92/94 places, 50/85 transitions.
Graph (complete) has 150 edges and 92 vertex of which 53 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.3 ms
Discarding 39 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 53 transition count 50
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 53 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 53 transition count 58
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 10 ms. Remains 53 /92 variables (removed 39) and now considering 58/50 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/94 places, 58/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6714 ms. Remains : 53/94 places, 58/85 transitions.
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 94 cols
[2024-06-02 18:34:20] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 18:34:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 18:34:20] [INFO ] Invariant cache hit.
[2024-06-02 18:34:20] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2024-06-02 18:34:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2024-06-02 18:34:21] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:34:21] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-02 18:34:21] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:34:21] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/179 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/179 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 179/179 variables, and 114 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3535 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 85/179 variables, 94/114 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 84/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 0/179 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 179/179 variables, and 198 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 4/4 constraints]
After SMT, in 6722ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 6723ms
Finished structural reductions in LTL mode , in 1 iterations and 6974 ms. Remains : 94/94 places, 85/85 transitions.
Treatment of property MedleyA-PT-06-LTLFireability-15 finished in 26202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(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((p0&&X((p0 U (G(p0)||X((!p1&&F(!p2)))))))))'
[2024-06-02 18:34:27] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:34:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-02 18:34:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 108 transitions and 339 arcs took 10 ms.
Total runtime 89684 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-06-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-06-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717353268294

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
ltl formula name MedleyA-PT-06-LTLFireability-06
ltl formula formula --ltl=/tmp/1939/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 108 transitions and 339 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1939/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1939/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1939/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1939/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 110 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 131 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~47!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2485
pnml2lts-mc( 0/ 4): unique states count: 2629
pnml2lts-mc( 0/ 4): unique transitions count: 8720
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5358
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 2643
pnml2lts-mc( 0/ 4): - cum. max stack depth: 197
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2643 states 8774 transitions, fanout: 3.320
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 66075, Transitions per second: 219350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 12.7 B/state, compr.: 2.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 108 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name MedleyA-PT-06-LTLFireability-15
ltl formula formula --ltl=/tmp/1939/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 108 places, 108 transitions and 339 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1939/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1939/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1939/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1939/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 110 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 109, there are 145 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5
pnml2lts-mc( 0/ 4): unique states count: 5
pnml2lts-mc( 0/ 4): unique transitions count: 4
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15 states 20 transitions, fanout: 1.333
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 67.2 B/state, compr.: 15.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 108 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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