About the Execution of ITS-Tools for MedleyA-PT-12
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 62488.00 | 0.00 | 0.00 | FFFFFFFFFFTFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100188.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-12-LTLFireability-00
FORMULA_NAME MedleyA-PT-12-LTLFireability-01
FORMULA_NAME MedleyA-PT-12-LTLFireability-02
FORMULA_NAME MedleyA-PT-12-LTLFireability-03
FORMULA_NAME MedleyA-PT-12-LTLFireability-04
FORMULA_NAME MedleyA-PT-12-LTLFireability-05
FORMULA_NAME MedleyA-PT-12-LTLFireability-06
FORMULA_NAME MedleyA-PT-12-LTLFireability-07
FORMULA_NAME MedleyA-PT-12-LTLFireability-08
FORMULA_NAME MedleyA-PT-12-LTLFireability-09
FORMULA_NAME MedleyA-PT-12-LTLFireability-10
FORMULA_NAME MedleyA-PT-12-LTLFireability-11
FORMULA_NAME MedleyA-PT-12-LTLFireability-12
FORMULA_NAME MedleyA-PT-12-LTLFireability-13
FORMULA_NAME MedleyA-PT-12-LTLFireability-14
FORMULA_NAME MedleyA-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748866102624
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 12:08:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 12:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:08:25] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-06-02 12:08:25] [INFO ] Transformed 172 places.
[2025-06-02 12:08:25] [INFO ] Transformed 166 transitions.
[2025-06-02 12:08:25] [INFO ] Found NUPN structural information;
[2025-06-02 12:08:25] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 158 transition count 156
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 158 transition count 156
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 157 transition count 155
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 157 transition count 155
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 156 transition count 154
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 156 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 155 transition count 153
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 155 transition count 153
Applied a total of 30 rules in 135 ms. Remains 155 /172 variables (removed 17) and now considering 153/166 (removed 13) transitions.
// Phase 1: matrix 153 rows 155 cols
[2025-06-02 12:08:26] [INFO ] Computed 20 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:26] [INFO ] Implicit Places using invariants in 448 ms returned [32, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 540 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/172 places, 153/166 transitions.
Applied a total of 0 rules in 24 ms. Remains 153 /153 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 734 ms. Remains : 153/172 places, 153/166 transitions.
Support contains 43 out of 153 places after structural reductions.
[2025-06-02 12:08:26] [INFO ] Flatten gal took : 80 ms
[2025-06-02 12:08:26] [INFO ] Flatten gal took : 46 ms
[2025-06-02 12:08:27] [INFO ] Input system was already deterministic with 153 transitions.
Support contains 40 out of 153 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (824 resets) in 1823 ms. (21 steps per ms) remains 4/28 properties
BEST_FIRST walk for 40002 steps (215 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (189 resets) in 79 ms. (500 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (226 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
// Phase 1: matrix 153 rows 153 cols
[2025-06-02 12:08:28] [INFO ] Computed 18 invariants in 8 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/54 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/122 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:28] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/153 variables, 6/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:28] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:28] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 153/306 variables, 153/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 174 constraints, problems are : Problem set: 1 solved, 2 unsolved in 987 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/122 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/153 variables, 6/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:29] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:29] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:29] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 3/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 153/306 variables, 153/177 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 2/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:29] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 1/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 180 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1043 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2080ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 350 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=175 )
Parikh walk visited 2 properties in 129 ms.
FORMULA MedleyA-PT-12-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 152 transition count 129
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 129 transition count 127
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 128 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 127 transition count 126
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 51 place count 127 transition count 101
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 102 place count 101 transition count 101
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 4 with 2 rules applied. Total rules applied 104 place count 100 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 99 transition count 100
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 116 place count 88 transition count 78
Iterating global reduction 6 with 11 rules applied. Total rules applied 127 place count 88 transition count 78
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 127 place count 88 transition count 74
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 135 place count 84 transition count 74
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 187 place count 58 transition count 48
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 197 place count 53 transition count 66
Applied a total of 197 rules in 80 ms. Remains 53 /153 variables (removed 100) and now considering 66/153 (removed 87) transitions.
// Phase 1: matrix 66 rows 53 cols
[2025-06-02 12:08:30] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:30] [INFO ] Implicit Places using invariants in 118 ms returned [15, 24, 26, 28, 31]
[2025-06-02 12:08:30] [INFO ] Actually due to overlaps returned [28, 15, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 120 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/153 places, 66/153 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 50/153 places, 66/153 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 10672 reset in 608 ms.
Product exploration explored 100000 steps with 10691 reset in 339 ms.
Computed a total of 1 stabilizing places and 16 stable transitions
Computed a total of 1 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 141 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 861 steps (88 resets) in 19 ms. (43 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 50 cols
[2025-06-02 12:08:33] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:33] [INFO ] Implicit Places using invariants in 114 ms returned [23, 25]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/50 places, 66/66 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 48 transition count 65
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 47 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
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 45 transition count 75
Applied a total of 6 rules in 17 ms. Remains 45 /48 variables (removed 3) and now considering 75/66 (removed -9) transitions.
// Phase 1: matrix 75 rows 45 cols
[2025-06-02 12:08:33] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:33] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-02 12:08:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-02 12:08:33] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/50 places, 75/66 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 418 ms. Remains : 45/50 places, 75/66 transitions.
Computed a total of 1 stabilizing places and 24 stable transitions
Computed a total of 1 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 654 steps (71 resets) in 14 ms. (43 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 11479 reset in 202 ms.
Product exploration explored 100000 steps with 11492 reset in 457 ms.
Built C files in :
/tmp/ltsmin17318761773914357697
[2025-06-02 12:08:35] [INFO ] Computing symmetric may disable matrix : 75 transitions.
[2025-06-02 12:08:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:08:35] [INFO ] Computing symmetric may enable matrix : 75 transitions.
[2025-06-02 12:08:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:08:35] [INFO ] Computing Do-Not-Accords matrix : 75 transitions.
[2025-06-02 12:08:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:08:35] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17318761773914357697
Running compilation step : cd /tmp/ltsmin17318761773914357697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 457 ms.
Running link step : cd /tmp/ltsmin17318761773914357697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin17318761773914357697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7370255113569443824.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA MedleyA-PT-12-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-12-LTLFireability-00 finished in 5090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(p0) U p1)&&X(X(X(F(p2)))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 133
Applied a total of 18 rules in 11 ms. Remains 144 /153 variables (removed 9) and now considering 133/153 (removed 20) transitions.
// Phase 1: matrix 133 rows 144 cols
[2025-06-02 12:08:35] [INFO ] Computed 18 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:36] [INFO ] Implicit Places using invariants in 157 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 159 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 133/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 143/153 places, 133/153 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-01 finished in 611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1||(F((p2 U G(p2)))&&X(p2))))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 131
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 131
Applied a total of 22 rules in 7 ms. Remains 142 /153 variables (removed 11) and now considering 131/153 (removed 22) transitions.
// Phase 1: matrix 131 rows 142 cols
[2025-06-02 12:08:36] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 12:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:08:36] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2025-06-02 12:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:39] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:40] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:40] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:43] [INFO ] Deduced a trap along path composed of 10 places in 69 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:44] [INFO ] Deduced a trap along path composed of 9 places in 75 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 165 constraints, problems are : Problem set: 0 solved, 130 unsolved in 14277 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/273 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 130/293 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:52] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:53] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:53] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:55] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:55] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:08:55] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:09:01] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 8 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:09:04] [INFO ] Deduced a trap along path composed of 13 places in 66 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:09:04] [INFO ] Deduced a trap along path composed of 12 places in 42 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 14 (OVERLAPS) 0/273 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 304 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 44336ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 44338ms
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 131/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44613 ms. Remains : 142/153 places, 131/153 transitions.
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-03 finished in 45016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 152 transition count 126
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 54 place count 126 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 125 transition count 124
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 55 place count 125 transition count 100
Deduced a syphon composed of 24 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 104 place count 100 transition count 100
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 99 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 98 transition count 99
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 114 place count 91 transition count 92
Iterating global reduction 5 with 7 rules applied. Total rules applied 121 place count 91 transition count 92
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 121 place count 91 transition count 89
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 127 place count 88 transition count 89
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 175 place count 64 transition count 65
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 189 place count 57 transition count 86
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 190 place count 57 transition count 85
Applied a total of 190 rules in 44 ms. Remains 57 /153 variables (removed 96) and now considering 85/153 (removed 68) transitions.
// Phase 1: matrix 85 rows 57 cols
[2025-06-02 12:09:21] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:21] [INFO ] Implicit Places using invariants in 115 ms returned [21, 29, 32, 34, 37]
[2025-06-02 12:09:21] [INFO ] Actually due to overlaps returned [21, 34, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 117 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/153 places, 85/153 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 54 transition count 84
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 53 transition count 84
Applied a total of 2 rules in 10 ms. Remains 53 /54 variables (removed 1) and now considering 84/85 (removed 1) transitions.
// Phase 1: matrix 84 rows 53 cols
[2025-06-02 12:09:21] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:21] [INFO ] Implicit Places using invariants in 90 ms returned [28, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/153 places, 84/153 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 51 transition count 83
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 50 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
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 48 transition count 93
Applied a total of 6 rules in 12 ms. Remains 48 /51 variables (removed 3) and now considering 93/84 (removed -9) transitions.
// Phase 1: matrix 93 rows 48 cols
[2025-06-02 12:09:21] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-02 12:09:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:21] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-02 12:09:21] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 48/153 places, 93/153 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 536 ms. Remains : 48/153 places, 93/153 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-04
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-04 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(G(p0))&&(G(p1)||X(p2))) U p3))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 144 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 144 transition count 133
Applied a total of 18 rules in 8 ms. Remains 144 /153 variables (removed 9) and now considering 133/153 (removed 20) transitions.
// Phase 1: matrix 133 rows 144 cols
[2025-06-02 12:09:22] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:22] [INFO ] Implicit Places using invariants in 231 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 233 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 143/153 places, 133/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 245 ms. Remains : 143/153 places, 133/153 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p3), (NOT p3), (NOT p0), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 49 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-05 finished in 664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 152 transition count 129
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 129 transition count 127
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 128 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 127 transition count 126
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 51 place count 127 transition count 102
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 99 place count 103 transition count 102
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 101 place count 101 transition count 102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 101 place count 101 transition count 101
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 103 place count 100 transition count 101
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 113 place count 90 transition count 80
Iterating global reduction 5 with 10 rules applied. Total rules applied 123 place count 90 transition count 80
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 123 place count 90 transition count 77
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 129 place count 87 transition count 77
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 183 place count 60 transition count 50
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 195 place count 54 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 196 place count 54 transition count 70
Applied a total of 196 rules in 43 ms. Remains 54 /153 variables (removed 99) and now considering 70/153 (removed 83) transitions.
// Phase 1: matrix 70 rows 54 cols
[2025-06-02 12:09:22] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:22] [INFO ] Implicit Places using invariants in 178 ms returned [15, 22, 24, 26, 29]
[2025-06-02 12:09:22] [INFO ] Actually due to overlaps returned [15, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 180 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/153 places, 70/153 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226 ms. Remains : 51/153 places, 70/153 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-06 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1&&X(X(X(p2)))))))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 132
Applied a total of 20 rules in 5 ms. Remains 143 /153 variables (removed 10) and now considering 132/153 (removed 21) transitions.
// Phase 1: matrix 132 rows 143 cols
[2025-06-02 12:09:23] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:23] [INFO ] Implicit Places using invariants in 121 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 132/153 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 142/153 places, 132/153 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-08
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-08 finished in 457 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 132
Applied a total of 20 rules in 3 ms. Remains 143 /153 variables (removed 10) and now considering 132/153 (removed 21) transitions.
// Phase 1: matrix 132 rows 143 cols
[2025-06-02 12:09:23] [INFO ] Computed 18 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:23] [INFO ] Implicit Places using invariants in 107 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 132/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 142/153 places, 132/153 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-09 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0) U p1)) U (X(!p0)&&(p1 U p2))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 143 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 143 transition count 132
Applied a total of 20 rules in 3 ms. Remains 143 /153 variables (removed 10) and now considering 132/153 (removed 21) transitions.
[2025-06-02 12:09:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:23] [INFO ] Implicit Places using invariants in 86 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 87 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/153 places, 132/153 transitions.
Applied a total of 0 rules in 2 ms. Remains 142 /142 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 142/153 places, 132/153 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) p0), (NOT p1), p0, (NOT p2), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-11 finished in 341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(X(G(p0))) U p0))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 131
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 131
Applied a total of 22 rules in 2 ms. Remains 142 /153 variables (removed 11) and now considering 131/153 (removed 22) transitions.
// Phase 1: matrix 131 rows 142 cols
[2025-06-02 12:09:24] [INFO ] Computed 18 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:24] [INFO ] Implicit Places using invariants in 136 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 131/153 transitions.
Applied a total of 0 rules in 1 ms. Remains 141 /141 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 141 ms. Remains : 141/153 places, 131/153 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-12 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 142 transition count 131
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 142 transition count 131
Applied a total of 22 rules in 2 ms. Remains 142 /153 variables (removed 11) and now considering 131/153 (removed 22) transitions.
[2025-06-02 12:09:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:24] [INFO ] Implicit Places using invariants in 140 ms returned [74]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 141/153 places, 131/153 transitions.
Applied a total of 0 rules in 2 ms. Remains 141 /141 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 145 ms. Remains : 141/153 places, 131/153 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-13
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-13 finished in 357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 152 transition count 127
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 127 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 126 transition count 125
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 53 place count 126 transition count 102
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 100 place count 102 transition count 102
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 102 place count 101 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 103 place count 100 transition count 101
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 110 place count 93 transition count 94
Iterating global reduction 5 with 7 rules applied. Total rules applied 117 place count 93 transition count 94
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 117 place count 93 transition count 91
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 123 place count 90 transition count 91
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 173 place count 65 transition count 66
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 185 place count 59 transition count 77
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 59 transition count 76
Applied a total of 186 rules in 20 ms. Remains 59 /153 variables (removed 94) and now considering 76/153 (removed 77) transitions.
// Phase 1: matrix 76 rows 59 cols
[2025-06-02 12:09:24] [INFO ] Computed 16 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:09:24] [INFO ] Implicit Places using invariants in 122 ms returned [22, 30, 32, 34, 37]
[2025-06-02 12:09:24] [INFO ] Actually due to overlaps returned [22, 34, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 124 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/153 places, 76/153 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 56/153 places, 76/153 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLFireability-15
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLFireability-15 finished in 251 ms.
All properties solved by simple procedures.
Total runtime 59941 ms.
BK_STOP 1748866165112
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-12, 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 r128-smll-174876524100188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-12.tgz
mv MedleyA-PT-12 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.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 '
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 ;