Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969019900123.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyA-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.9K Mar 7 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 11:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 11:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 11:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 7 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 11:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 28K Mar 3 18:30 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-04-LTLCardinality-00
FORMULA_NAME MedleyA-PT-04-LTLCardinality-01
FORMULA_NAME MedleyA-PT-04-LTLCardinality-02
FORMULA_NAME MedleyA-PT-04-LTLCardinality-03
FORMULA_NAME MedleyA-PT-04-LTLCardinality-04
FORMULA_NAME MedleyA-PT-04-LTLCardinality-05
FORMULA_NAME MedleyA-PT-04-LTLCardinality-06
FORMULA_NAME MedleyA-PT-04-LTLCardinality-07
FORMULA_NAME MedleyA-PT-04-LTLCardinality-08
FORMULA_NAME MedleyA-PT-04-LTLCardinality-09
FORMULA_NAME MedleyA-PT-04-LTLCardinality-10
FORMULA_NAME MedleyA-PT-04-LTLCardinality-11
FORMULA_NAME MedleyA-PT-04-LTLCardinality-12
FORMULA_NAME MedleyA-PT-04-LTLCardinality-13
FORMULA_NAME MedleyA-PT-04-LTLCardinality-14
FORMULA_NAME MedleyA-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779699094617

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:51:36] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2026-05-25 08:51:36] [INFO ] Transformed 115 places.
[2026-05-25 08:51:36] [INFO ] Transformed 107 transitions.
[2026-05-25 08:51:36] [INFO ] Found NUPN structural information;
[2026-05-25 08:51:36] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 105 transition count 98
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 105 transition count 98
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 104 transition count 97
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 104 transition count 97
Applied a total of 21 rules in 38 ms. Remains 104 /115 variables (removed 11) and now considering 97/107 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7984405512241195400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9786063212849457058.kers'
[2026-05-25 08:51:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7984405512241195400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9786063212849457058.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 104 cols 279 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-25 08:51:36] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9786063212849457058.kers
Total runtime 2 ms.
[2026-05-25 08:51:36] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-25 08:51:36] [INFO ] Invariant cache hit.
[2026-05-25 08:51:36] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-25 08:51:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/128 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 137 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7219 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 97/201 variables, 104/137 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 96/233 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/201 variables, and 241 constraints, problems are : Problem set: 0 solved, 96 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37335ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 37348ms
Starting structural reductions in LTL mode, iteration 1 : 104/115 places, 97/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37895 ms. Remains : 104/115 places, 97/107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2026-05-25 08:52:14] [INFO ] Invariant cache hit.
[2026-05-25 08:52:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-25 08:52:14] [INFO ] Invariant cache hit.
[2026-05-25 08:52:14] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 104/104 places, 97/97 transitions.
Support contains 20 out of 104 places after structural reductions.
[2026-05-25 08:52:14] [INFO ] Flatten gal took : 36 ms
[2026-05-25 08:52:14] [INFO ] Flatten gal took : 20 ms
[2026-05-25 08:52:14] [INFO ] Input system was already deterministic with 97 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (1104 resets) in 713 ms. (56 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40003 steps (303 resets) in 263 ms. (151 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (300 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (295 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
[2026-05-25 08:52:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/80 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 97/177 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/201 variables, 24/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 112 constraints, problems are : Problem set: 0 solved, 3 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 49/80 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 97/177 variables, 80/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 24/201 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/201 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/201 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 121 constraints, problems are : Problem set: 0 solved, 3 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 762ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 338 ms.
Support contains 5 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 97/97 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 104 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 91 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 26 place count 91 transition count 74
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 46 place count 81 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 79 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 79 transition count 72
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 2 with 40 rules applied. Total rules applied 90 place count 59 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 59 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 56 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 96 place count 55 transition count 49
Applied a total of 96 rules in 29 ms. Remains 55 /104 variables (removed 49) and now considering 49/97 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 55/104 places, 49/97 transitions.
RANDOM walk for 40000 steps (4283 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2019 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (2096 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (2010 resets) in 120 ms. (330 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2573 steps, run visited all 3 properties in 21 ms. (steps per millisecond=122 )
Probabilistic random walk after 2573 steps, saw 1113 distinct states, run finished after 24 ms. (steps per millisecond=107 ) properties seen :3
Computed a total of 104 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 97
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(!p1) U ((X(!p1)&&G(!p2))||X(G(!p1)))))||p0)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 98 transition count 91
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 98 transition count 91
Applied a total of 12 rules in 22 ms. Remains 98 /104 variables (removed 6) and now considering 91/97 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4743875351108756913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12770659497464633094.kers'
[2026-05-25 08:52:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4743875351108756913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12770659497464633094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 91 rows 98 cols 267 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-25 08:52:17] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12770659497464633094.kers
Total runtime 1 ms.
[2026-05-25 08:52:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-25 08:52:17] [INFO ] Invariant cache hit.
[2026-05-25 08:52:17] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2026-05-25 08:52:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/114 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 5/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 3/217 constraints. Problems are: Problem set: 0 solved, 90 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/189 variables, and 217 constraints, problems are : Problem set: 0 solved, 90 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 36085ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 36086ms
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36398 ms. Remains : 98/104 places, 91/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(!p1) U ((X(!p1)&&G(!p2))||X(G(!p1)))))||p0)))'
Stuttering acceptance computed with spot in 437 ms :[true, (AND (NOT p0) p1), (AND p2 p1), p2, (AND (NOT p0) p1), p1, p1, p1]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Computed a total of 98 stabilizing places and 91 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 98 transition count 91
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 6 factoid took 90 ms. Proved property starting from automaton with 8 states, 17 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 138 ms.
FORMULA MedleyA-PT-04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLCardinality-00 finished in 37402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 103 transition count 81
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 88 transition count 81
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 88 transition count 71
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 78 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 76 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 76 transition count 69
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 2 with 40 rules applied. Total rules applied 94 place count 56 transition count 49
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 55 transition count 48
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 98 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 53 transition count 47
Applied a total of 99 rules in 17 ms. Remains 53 /104 variables (removed 51) and now considering 47/97 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4986741970554193858.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1838022606571637727.kers'
[2026-05-25 08:52:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4986741970554193858.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1838022606571637727.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 47 rows 52 cols 177 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:52:54] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1838022606571637727.kers
Total runtime 0 ms.
[2026-05-25 08:52:54] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 08:52:54] [INFO ] Invariant cache hit.
[2026-05-25 08:52:54] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2026-05-25 08:52:54] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:52:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 65 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 46/110 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/100 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 112 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3787ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3788ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/104 places, 47/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3969 ms. Remains : 53/104 places, 47/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-02
Stuttering criterion allowed to conclude after 119 steps with 21 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-02 finished in 4044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 103 transition count 81
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 88 transition count 81
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 88 transition count 71
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 78 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 76 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 76 transition count 69
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 2 with 42 rules applied. Total rules applied 96 place count 55 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 54 transition count 47
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 99 place count 53 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 100 place count 52 transition count 46
Applied a total of 100 rules in 19 ms. Remains 52 /104 variables (removed 52) and now considering 46/97 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17118809172891412513.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4721375323567190996.kers'
[2026-05-25 08:52:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17118809172891412513.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4721375323567190996.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 6 ms.
// Phase 1: matrix 46 rows 51 cols 175 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 08:52:58] [INFO ] Computed 7 invariants in 11 ms
Computed 7 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-4721375323567190996.kers
Total runtime 11 ms.
[2026-05-25 08:52:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-25 08:52:58] [INFO ] Invariant cache hit.
[2026-05-25 08:52:58] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2026-05-25 08:52:58] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2026-05-25 08:52:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 1/98 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/98 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 65 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/97 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 110 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2192 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3450ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 52/104 places, 46/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3606 ms. Remains : 52/104 places, 46/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-03
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-03 finished in 3671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 100 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 9 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2348414640183003257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3083739730190337103.kers'
[2026-05-25 08:53:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2348414640183003257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3083739730190337103.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:53:02] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3083739730190337103.kers
Total runtime 0 ms.
[2026-05-25 08:53:02] [INFO ] Implicit Places using invariants in 82 ms returned []
[2026-05-25 08:53:02] [INFO ] Invariant cache hit.
[2026-05-25 08:53:02] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 08:53:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 121 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4229 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 91/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 218 constraints, problems are : Problem set: 0 solved, 91 unsolved in 16157 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20402ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 20402ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20572 ms. Remains : 99/104 places, 92/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-05 finished in 20822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 101 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 101 transition count 94
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 100 transition count 93
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 100 transition count 93
Applied a total of 8 rules in 3 ms. Remains 100 /104 variables (removed 4) and now considering 93/97 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17658622977140053301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8349667704938609269.kers'
[2026-05-25 08:53:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17658622977140053301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8349667704938609269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 100 cols 271 entries
Finished phase 1 with 92 SingleSign rule and 0 generalized
[2026-05-25 08:53:22] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8349667704938609269.kers
Total runtime 0 ms.
[2026-05-25 08:53:22] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 08:53:22] [INFO ] Invariant cache hit.
[2026-05-25 08:53:23] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 08:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 123 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4549 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 93/193 variables, 100/123 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 92/215 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 92 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 225 constraints, problems are : Problem set: 0 solved, 92 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 34571ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 34572ms
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 93/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34731 ms. Remains : 100/104 places, 93/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-06 finished in 34859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p1)))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 100 transition count 93
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 100 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 99 transition count 92
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 4 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15235135516570663919.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8349720787993387985.kers'
[2026-05-25 08:53:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15235135516570663919.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8349720787993387985.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 99 cols 269 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-25 08:53:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8349720787993387985.kers
Total runtime 0 ms.
[2026-05-25 08:53:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 08:53:57] [INFO ] Invariant cache hit.
[2026-05-25 08:53:58] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2026-05-25 08:53:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 92/191 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 122 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4555 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 5/218 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 223 constraints, problems are : Problem set: 0 solved, 91 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 34586ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 34587ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34975 ms. Remains : 99/104 places, 92/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(p1)))'
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-09
Product exploration explored 100000 steps with 33194 reset in 84 ms.
Product exploration explored 100000 steps with 33346 reset in 85 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 14 factoid took 70 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (1119 resets) in 231 ms. (172 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (303 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
[2026-05-25 08:54:33] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/191 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 17 ms.
Refiners :[Positive P Invariants (semi-flows): 0/8 constraints, State Equation: 0/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Negative knowledge disproves property using: (G p1)
Knowledge based reduction with 15 factoid took 54 ms. Proved property starting from automaton with 4 states, 10 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 333 ms.
FORMULA MedleyA-PT-04-LTLCardinality-09 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLCardinality-09 finished in 35689 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||F(G(p1))) U p2) U (X(p1)||p3))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 102 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 102 transition count 95
Applied a total of 4 rules in 2 ms. Remains 102 /104 variables (removed 2) and now considering 95/97 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5400563186187322703.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17259255637488936517.kers'
[2026-05-25 08:54:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5400563186187322703.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17259255637488936517.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 95 rows 102 cols 275 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-25 08:54:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17259255637488936517.kers
Total runtime 0 ms.
[2026-05-25 08:54:33] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-25 08:54:33] [INFO ] Invariant cache hit.
[2026-05-25 08:54:33] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2026-05-25 08:54:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/197 variables, 102/124 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 6/130 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 131 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6578 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 95/197 variables, 102/132 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 94/226 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/197 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 197/197 variables, and 230 constraints, problems are : Problem set: 0 solved, 94 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 36618ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 36618ms
Starting structural reductions in LTL mode, iteration 1 : 102/104 places, 95/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36781 ms. Remains : 102/104 places, 95/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0||F(G(p1))) U p2) U (X(p1)||p3))))'
Stuttering acceptance computed with spot in 398 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 102 stabilizing places and 95 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 102 transition count 95
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 20 factoid took 11 ms. Proved property starting from automaton with 7 states, 14 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 102 ms.
FORMULA MedleyA-PT-04-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLCardinality-13 finished in 37513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 103 transition count 81
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 88 transition count 81
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 88 transition count 71
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 78 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 76 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 76 transition count 69
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 2 with 40 rules applied. Total rules applied 94 place count 56 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 55 transition count 48
Reduce places removed 1 places and 0 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 2 with 2 rules applied. Total rules applied 97 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 53 transition count 47
Applied a total of 98 rules in 8 ms. Remains 53 /104 variables (removed 51) and now considering 47/97 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15279665375524050383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8142603656450057911.kers'
[2026-05-25 08:55:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15279665375524050383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8142603656450057911.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 47 rows 52 cols 177 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:55:10] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8142603656450057911.kers
Total runtime 0 ms.
[2026-05-25 08:55:11] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-25 08:55:11] [INFO ] Invariant cache hit.
[2026-05-25 08:55:11] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2026-05-25 08:55:11] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2026-05-25 08:55:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 1/100 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 0/100 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/100 variables, and 66 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/99 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 46/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/100 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/100 variables, and 113 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2636 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3952ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3952ms
Starting structural reductions in SI_LTL mode, iteration 1 : 53/104 places, 47/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4094 ms. Remains : 53/104 places, 47/97 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-15
Product exploration explored 100000 steps with 17695 reset in 63 ms.
Product exploration explored 100000 steps with 17780 reset in 101 ms.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (7103 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3179 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2384 steps, run visited all 1 properties in 12 ms. (steps per millisecond=198 )
Probabilistic random walk after 2384 steps, saw 1092 distinct states, run finished after 12 ms. (steps per millisecond=198 ) properties seen :1
Knowledge based reduction with 4 factoid took 56 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Knowledge-based reduction took 264 ms.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 53 /53 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2026-05-25 08:55:15] [INFO ] Invariant cache hit.
[2026-05-25 08:55:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 08:55:15] [INFO ] Invariant cache hit.
[2026-05-25 08:55:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2026-05-25 08:55:15] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 53/53 places, 47/47 transitions.
Computed a total of 53 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 53 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (7105 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3230 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2384 steps, run visited all 1 properties in 12 ms. (steps per millisecond=198 )
Probabilistic random walk after 2384 steps, saw 1092 distinct states, run finished after 12 ms. (steps per millisecond=198 ) properties seen :1
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Knowledge-based reduction took 326 ms.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 17806 reset in 98 ms.
Product exploration explored 100000 steps with 17614 reset in 81 ms.
Built C files in :
/tmp/ltsmin6672739643361136337
[2026-05-25 08:55:16] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2026-05-25 08:55:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:55:16] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2026-05-25 08:55:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:55:16] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2026-05-25 08:55:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 08:55:16] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6672739643361136337
Running compilation step : cd /tmp/ltsmin6672739643361136337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin6672739643361136337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin6672739643361136337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13992717149062856302.hoa' '--buchi-type=spotba'
LTSmin run took 176 ms.
FORMULA MedleyA-PT-04-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-04-LTLCardinality-15 finished in 6114 ms.
All properties solved by simple procedures.
Total runtime 221030 ms.

BK_STOP 1779699317461

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-04"
export BK_EXAMINATION="LTLCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-oct2-177969019900123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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